./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/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 64bit --witnessprinter.graph.data.programhash cb528549fa76ae8087cf7043645dfa20323a0116 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:43:57,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:43:57,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:43:57,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:43:57,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:43:57,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:43:57,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:43:57,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:43:57,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:43:57,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:43:57,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:43:57,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:43:57,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:43:57,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:43:57,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:43:57,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:43:57,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:43:57,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:43:57,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:43:57,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:43:57,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:43:57,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:43:57,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:43:57,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:43:57,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:43:57,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:43:57,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:43:57,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:43:57,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:43:57,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:43:57,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:43:57,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:43:57,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:43:57,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:43:57,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:43:57,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:43:57,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:43:57,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:43:57,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:43:57,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:43:57,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:43:57,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:43:57,482 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:43:57,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:43:57,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:43:57,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:43:57,494 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:43:57,494 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:43:57,494 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:43:57,495 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:43:57,495 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:43:57,495 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:43:57,495 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:43:57,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:43:57,496 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:43:57,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:43:57,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:43:57,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:43:57,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:43:57,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:43:57,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:43:57,498 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:43:57,498 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:43:57,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:43:57,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:43:57,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:43:57,499 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:43:57,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:43:57,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:43:57,500 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:43:57,501 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:43:57,503 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb528549fa76ae8087cf7043645dfa20323a0116 [2019-11-16 00:43:57,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:43:57,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:43:57,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:43:57,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:43:57,553 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:43:57,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-11-16 00:43:57,602 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/data/36ffdd931/80bf7344c25a4f51afe6788018e83fcd/FLAG532a1b3b5 [2019-11-16 00:43:57,973 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:43:57,974 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-11-16 00:43:57,979 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/data/36ffdd931/80bf7344c25a4f51afe6788018e83fcd/FLAG532a1b3b5 [2019-11-16 00:43:58,394 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/data/36ffdd931/80bf7344c25a4f51afe6788018e83fcd [2019-11-16 00:43:58,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:43:58,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:43:58,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:43:58,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:43:58,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:43:58,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:43:58" (1/1) ... [2019-11-16 00:43:58,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3e9369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58, skipping insertion in model container [2019-11-16 00:43:58,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:43:58" (1/1) ... [2019-11-16 00:43:58,411 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:43:58,424 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:43:58,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:43:58,619 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:43:58,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:43:58,644 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:43:58,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58 WrapperNode [2019-11-16 00:43:58,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:43:58,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:43:58,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:43:58,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:43:58,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58" (1/1) ... [2019-11-16 00:43:58,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58" (1/1) ... [2019-11-16 00:43:58,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:43:58,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:43:58,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:43:58,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:43:58,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58" (1/1) ... [2019-11-16 00:43:58,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58" (1/1) ... [2019-11-16 00:43:58,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58" (1/1) ... [2019-11-16 00:43:58,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58" (1/1) ... [2019-11-16 00:43:58,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58" (1/1) ... [2019-11-16 00:43:58,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58" (1/1) ... [2019-11-16 00:43:58,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58" (1/1) ... [2019-11-16 00:43:58,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:43:58,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:43:58,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:43:58,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:43:58,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:43:58,754 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-16 00:43:58,755 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-16 00:43:58,755 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-16 00:43:58,756 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-16 00:43:58,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:43:58,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:43:58,937 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:43:58,939 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:43:58,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:58 BoogieIcfgContainer [2019-11-16 00:43:58,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:43:58,941 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:43:58,941 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:43:58,959 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:43:58,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:43:58,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:43:58" (1/3) ... [2019-11-16 00:43:58,961 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f1f5e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:43:58, skipping insertion in model container [2019-11-16 00:43:58,961 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:43:58,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:58" (2/3) ... [2019-11-16 00:43:58,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f1f5e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:43:58, skipping insertion in model container [2019-11-16 00:43:58,962 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:43:58,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:58" (3/3) ... [2019-11-16 00:43:58,964 INFO L371 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1b.c [2019-11-16 00:43:59,054 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:43:59,054 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:43:59,054 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:43:59,054 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:43:59,054 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:43:59,054 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:43:59,055 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:43:59,055 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:43:59,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-16 00:43:59,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:43:59,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:43:59,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:43:59,119 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:43:59,119 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:59,119 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:43:59,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-16 00:43:59,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:43:59,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:43:59,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:43:59,125 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:43:59,125 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:59,133 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 22#L25true call main_#t~ret6 := rec2(main_~x~0);< 3#rec2ENTRYtrue [2019-11-16 00:43:59,135 INFO L793 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue ~j := #in~j; 20#L18true assume !(~j <= 0); 18#L20true call #t~ret3 := rec1(~j - 1);< 4#rec1ENTRYtrue ~i := #in~i; 9#L12true assume ~i <= 0;#res := 0; 5#rec1FINALtrue assume true; 12#rec1EXITtrue >#33#return; 23#L20-1true call #t~ret4 := rec2(#t~ret3);< 3#rec2ENTRYtrue [2019-11-16 00:43:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:59,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 1 times [2019-11-16 00:43:59,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:59,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645755744] [2019-11-16 00:43:59,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:59,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:59,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:43:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:43:59,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:43:59,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:59,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1102838740, now seen corresponding path program 1 times [2019-11-16 00:43:59,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:59,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773042108] [2019-11-16 00:43:59,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:59,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:59,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:43:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:43:59,259 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:43:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:59,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1371489668, now seen corresponding path program 1 times [2019-11-16 00:43:59,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:59,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832108007] [2019-11-16 00:43:59,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:59,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:59,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:43:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:43:59,276 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:43:59,453 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:43:59,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:43:59,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:43:59,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:43:59,454 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:43:59,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:43:59,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:43:59,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:43:59,455 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration1_Loop [2019-11-16 00:43:59,455 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:43:59,456 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:43:59,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-11-16 00:43:59,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:43:59,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:43:59,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:43:59,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:43:59,553 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:43:59,554 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:43:59,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:43:59,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:43:59,574 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:43:59,574 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_~j=0} Honda state: {rec2_~j=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:43:59,584 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:43:59,584 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:43:59,588 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:43:59,588 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:43:59,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:43:59,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:43:59,605 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:43:59,605 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:43:59,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:43:59,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:43:59,620 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:43:59,621 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:43:59,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:43:59,642 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:43:59,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:43:59,666 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:43:59,678 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:43:59,680 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:43:59,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:43:59,681 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:43:59,681 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:43:59,681 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:43:59,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:43:59,681 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:43:59,681 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:43:59,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration1_Loop [2019-11-16 00:43:59,682 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:43:59,682 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:43:59,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:43:59,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:43:59,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:43:59,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:43:59,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:43:59,748 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:43:59,753 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:43:59,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:43:59,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:43:59,756 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:43:59,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:43:59,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:43:59,757 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:43:59,759 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:43:59,759 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:43:59,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:43:59,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:43:59,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:43:59,765 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:43:59,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:43:59,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:43:59,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:43:59,766 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:43:59,766 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:43:59,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:43:59,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:43:59,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:43:59,769 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:43:59,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:43:59,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:43:59,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:43:59,770 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:43:59,770 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:43:59,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:43:59,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:43:59,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:43:59,773 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:43:59,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:43:59,774 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:43:59,774 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:43:59,775 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:43:59,775 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:43:59,783 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:43:59,789 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:43:59,789 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:43:59,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:43:59,791 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:43:59,791 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:43:59,792 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2019-11-16 00:43:59,795 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:43:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:59,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:43:59,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:59,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:43:59,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:00,018 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-16 00:44:00,020 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 7 states. [2019-11-16 00:44:00,546 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 7 states. Result 194 states and 279 transitions. Complement of second has 61 states. [2019-11-16 00:44:00,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:44:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2019-11-16 00:44:00,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 57 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-16 00:44:00,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:00,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 57 transitions. Stem has 10 letters. Loop has 8 letters. [2019-11-16 00:44:00,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:00,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 57 transitions. Stem has 2 letters. Loop has 16 letters. [2019-11-16 00:44:00,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:00,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 279 transitions. [2019-11-16 00:44:00,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:44:00,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 82 states and 120 transitions. [2019-11-16 00:44:00,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-11-16 00:44:00,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-16 00:44:00,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 120 transitions. [2019-11-16 00:44:00,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:00,588 INFO L688 BuchiCegarLoop]: Abstraction has 82 states and 120 transitions. [2019-11-16 00:44:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 120 transitions. [2019-11-16 00:44:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2019-11-16 00:44:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-16 00:44:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2019-11-16 00:44:00,637 INFO L711 BuchiCegarLoop]: Abstraction has 55 states and 83 transitions. [2019-11-16 00:44:00,638 INFO L591 BuchiCegarLoop]: Abstraction has 55 states and 83 transitions. [2019-11-16 00:44:00,638 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:44:00,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 83 transitions. [2019-11-16 00:44:00,644 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:44:00,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:00,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:00,646 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:00,646 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:44:00,646 INFO L791 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 345#L25 call main_#t~ret6 := rec2(main_~x~0);< 344#rec2ENTRY ~j := #in~j; 347#L18 assume !(~j <= 0); 363#L20 call #t~ret3 := rec1(~j - 1);< 379#rec1ENTRY ~i := #in~i; 397#L12 assume !(~i <= 0); 351#L14 call #t~ret0 := rec1(~i - 2);< 350#rec1ENTRY [2019-11-16 00:44:00,647 INFO L793 eck$LassoCheckResult]: Loop: 350#rec1ENTRY ~i := #in~i; 358#L12 assume !(~i <= 0); 354#L14 call #t~ret0 := rec1(~i - 2);< 350#rec1ENTRY [2019-11-16 00:44:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:00,647 INFO L82 PathProgramCache]: Analyzing trace with hash 874549579, now seen corresponding path program 1 times [2019-11-16 00:44:00,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:00,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747726931] [2019-11-16 00:44:00,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:00,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:00,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:00,679 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:00,680 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 1 times [2019-11-16 00:44:00,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:00,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574693120] [2019-11-16 00:44:00,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:00,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:00,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:00,706 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:00,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:00,706 INFO L82 PathProgramCache]: Analyzing trace with hash 434890603, now seen corresponding path program 2 times [2019-11-16 00:44:00,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:00,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247663916] [2019-11-16 00:44:00,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:00,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:00,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:00,723 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:00,760 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:00,760 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:00,761 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:00,761 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:00,761 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:44:00,761 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:00,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:00,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:00,761 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration2_Loop [2019-11-16 00:44:00,762 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:00,762 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:00,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:00,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:00,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:00,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:00,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:00,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-11-16 00:44:00,828 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:00,828 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/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-11-16 00:44:00,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:00,839 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-11-16 00:44:00,846 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:44:00,846 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/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) [2019-11-16 00:44:00,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:00,861 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:00,864 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:44:00,865 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:00,884 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:00,884 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:44:00,897 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:44:00,897 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:00,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:00,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:44:00,917 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:44:00,917 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:00,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:00,924 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:44:00,928 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:44:00,928 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:00,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:00,934 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:00,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:44:00,941 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:44:00,946 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:44:00,948 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:00,948 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:00,948 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:00,948 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:00,948 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:44:00,948 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:00,948 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:00,948 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:00,949 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration2_Loop [2019-11-16 00:44:00,949 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:00,949 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:00,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:00,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:00,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-11-16 00:44:00,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-11-16 00:44:00,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-11-16 00:44:00,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-11-16 00:44:01,023 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:01,023 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:44:01,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:01,024 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:01,024 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:01,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:01,025 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:01,025 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:01,025 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:01,026 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:01,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:01,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:01,028 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:01,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:01,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:01,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:01,028 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:01,029 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:01,029 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:01,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:01,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:01,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:01,031 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:01,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:01,031 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:01,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:01,033 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:01,033 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:01,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:01,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:01,036 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:01,037 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:01,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:01,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:01,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:01,042 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:01,042 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:01,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:01,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:01,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:01,046 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:01,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:01,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:01,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:01,048 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:01,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:01,060 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:44:01,068 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-16 00:44:01,076 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:44:01,077 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:44:01,077 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:44:01,077 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:44:01,077 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-11-16 00:44:01,078 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:44:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:01,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:44:01,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:01,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:44:01,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:01,159 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:44:01,159 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 83 transitions. cyclomatic complexity: 32 Second operand 4 states. [2019-11-16 00:44:01,222 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 83 transitions. cyclomatic complexity: 32. Second operand 4 states. Result 105 states and 149 transitions. Complement of second has 13 states. [2019-11-16 00:44:01,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:44:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-16 00:44:01,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-16 00:44:01,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:01,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 3 letters. [2019-11-16 00:44:01,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:01,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-16 00:44:01,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:01,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 149 transitions. [2019-11-16 00:44:01,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:44:01,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 93 states and 137 transitions. [2019-11-16 00:44:01,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-16 00:44:01,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-16 00:44:01,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 137 transitions. [2019-11-16 00:44:01,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:01,235 INFO L688 BuchiCegarLoop]: Abstraction has 93 states and 137 transitions. [2019-11-16 00:44:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 137 transitions. [2019-11-16 00:44:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-11-16 00:44:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-16 00:44:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2019-11-16 00:44:01,246 INFO L711 BuchiCegarLoop]: Abstraction has 89 states and 129 transitions. [2019-11-16 00:44:01,246 INFO L591 BuchiCegarLoop]: Abstraction has 89 states and 129 transitions. [2019-11-16 00:44:01,246 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:44:01,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 129 transitions. [2019-11-16 00:44:01,248 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:44:01,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:01,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:01,249 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:01,249 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:44:01,249 INFO L791 eck$LassoCheckResult]: Stem: 613#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 614#L25 call main_#t~ret6 := rec2(main_~x~0);< 620#rec2ENTRY ~j := #in~j; 633#L18 assume !(~j <= 0); 615#L20 call #t~ret3 := rec1(~j - 1);< 642#rec1ENTRY ~i := #in~i; 637#L12 assume !(~i <= 0); 577#L14 call #t~ret0 := rec1(~i - 2);< 576#rec1ENTRY ~i := #in~i; 579#L12 assume ~i <= 0;#res := 0; 583#rec1FINAL assume true; 584#rec1EXIT >#27#return; 593#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 595#rec1ENTRY [2019-11-16 00:44:01,249 INFO L793 eck$LassoCheckResult]: Loop: 595#rec1ENTRY ~i := #in~i; 632#L12 assume !(~i <= 0); 589#L14 call #t~ret0 := rec1(~i - 2);< 595#rec1ENTRY [2019-11-16 00:44:01,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1317996508, now seen corresponding path program 1 times [2019-11-16 00:44:01,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:01,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867523095] [2019-11-16 00:44:01,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:01,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:01,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:01,269 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 2 times [2019-11-16 00:44:01,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:01,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137376108] [2019-11-16 00:44:01,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:01,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:01,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:01,311 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:01,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:01,312 INFO L82 PathProgramCache]: Analyzing trace with hash -157050054, now seen corresponding path program 2 times [2019-11-16 00:44:01,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:01,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241499243] [2019-11-16 00:44:01,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:01,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:01,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:44:01,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241499243] [2019-11-16 00:44:01,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:44:01,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:44:01,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228474423] [2019-11-16 00:44:01,426 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:01,427 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:01,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:01,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:01,427 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:44:01,427 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:01,427 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:01,427 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:01,427 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration3_Loop [2019-11-16 00:44:01,427 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:01,427 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:01,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:01,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:01,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:01,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:01,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:01,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:01,474 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:01,474 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:01,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:01,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:44:01,491 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:44:01,491 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:01,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:01,497 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:01,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:44:01,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:44:01,565 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:44:01,567 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:01,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:01,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:01,567 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:01,567 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:44:01,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:01,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:01,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:01,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration3_Loop [2019-11-16 00:44:01,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:01,568 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:01,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:01,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:01,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:01,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:01,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:01,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:01,614 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:01,614 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:44:01,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-11-16 00:44:01,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:01,615 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:01,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:01,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:01,616 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:01,616 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:01,616 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:01,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:01,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:01,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:01,618 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:01,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:01,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:01,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:01,618 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:01,619 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:01,621 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:44:01,623 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-16 00:44:01,623 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:44:01,624 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:44:01,624 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:44:01,624 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:44:01,624 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-11-16 00:44:01,625 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:44:01,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:01,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:44:01,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:01,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:44:01,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:01,734 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-16 00:44:01,734 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 129 transitions. cyclomatic complexity: 47 Second operand 5 states. [2019-11-16 00:44:01,844 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 129 transitions. cyclomatic complexity: 47. Second operand 5 states. Result 134 states and 193 transitions. Complement of second has 14 states. [2019-11-16 00:44:01,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:44:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-16 00:44:01,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-16 00:44:01,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:01,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2019-11-16 00:44:01,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:01,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-16 00:44:01,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:01,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 193 transitions. [2019-11-16 00:44:01,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:44:01,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 122 states and 181 transitions. [2019-11-16 00:44:01,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-11-16 00:44:01,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2019-11-16 00:44:01,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 181 transitions. [2019-11-16 00:44:01,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:01,855 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 181 transitions. [2019-11-16 00:44:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 181 transitions. [2019-11-16 00:44:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2019-11-16 00:44:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-16 00:44:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2019-11-16 00:44:01,867 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 165 transitions. [2019-11-16 00:44:01,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:01,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:44:01,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:44:01,871 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand 6 states. [2019-11-16 00:44:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:01,918 INFO L93 Difference]: Finished difference Result 123 states and 175 transitions. [2019-11-16 00:44:01,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:44:01,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 175 transitions. [2019-11-16 00:44:01,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-16 00:44:01,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 121 states and 173 transitions. [2019-11-16 00:44:01,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-11-16 00:44:01,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-11-16 00:44:01,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 173 transitions. [2019-11-16 00:44:01,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:01,925 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 173 transitions. [2019-11-16 00:44:01,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 173 transitions. [2019-11-16 00:44:01,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2019-11-16 00:44:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-16 00:44:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2019-11-16 00:44:01,935 INFO L711 BuchiCegarLoop]: Abstraction has 101 states and 143 transitions. [2019-11-16 00:44:01,935 INFO L591 BuchiCegarLoop]: Abstraction has 101 states and 143 transitions. [2019-11-16 00:44:01,935 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:44:01,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 143 transitions. [2019-11-16 00:44:01,936 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-16 00:44:01,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:01,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:01,937 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:01,938 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:01,938 INFO L791 eck$LassoCheckResult]: Stem: 1167#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 1168#L25 call main_#t~ret6 := rec2(main_~x~0);< 1174#rec2ENTRY ~j := #in~j; 1185#L18 assume !(~j <= 0); 1146#L20 call #t~ret3 := rec1(~j - 1);< 1184#rec1ENTRY ~i := #in~i; 1183#L12 assume !(~i <= 0); 1156#L14 call #t~ret0 := rec1(~i - 2);< 1181#rec1ENTRY ~i := #in~i; 1179#L12 assume !(~i <= 0); 1161#L14 call #t~ret0 := rec1(~i - 2);< 1178#rec1ENTRY ~i := #in~i; 1180#L12 assume ~i <= 0;#res := 0; 1222#rec1FINAL assume true; 1166#rec1EXIT >#27#return; 1133#L14-1 [2019-11-16 00:44:01,938 INFO L793 eck$LassoCheckResult]: Loop: 1133#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1132#rec1ENTRY ~i := #in~i; 1135#L12 assume ~i <= 0;#res := 0; 1140#rec1FINAL assume true; 1141#rec1EXIT >#29#return; 1154#L14-2 call #t~ret2 := rec1(#t~ret1);< 1163#rec1ENTRY ~i := #in~i; 1204#L12 assume !(~i <= 0); 1157#L14 call #t~ret0 := rec1(~i - 2);< 1163#rec1ENTRY ~i := #in~i; 1204#L12 assume ~i <= 0;#res := 0; 1205#rec1FINAL assume true; 1213#rec1EXIT >#27#return; 1133#L14-1 [2019-11-16 00:44:01,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:01,938 INFO L82 PathProgramCache]: Analyzing trace with hash -377207200, now seen corresponding path program 1 times [2019-11-16 00:44:01,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:01,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474381903] [2019-11-16 00:44:01,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:01,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:01,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:01,964 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:01,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1306212703, now seen corresponding path program 1 times [2019-11-16 00:44:01,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:01,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768790715] [2019-11-16 00:44:01,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:01,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:01,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:44:02,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768790715] [2019-11-16 00:44:02,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817525038] [2019-11-16 00:44:02,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:44:02,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:02,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:44:02,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2019-11-16 00:44:02,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347460104] [2019-11-16 00:44:02,061 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:44:02,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:02,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:44:02,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:44:02,062 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-11-16 00:44:02,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:02,107 INFO L93 Difference]: Finished difference Result 117 states and 161 transitions. [2019-11-16 00:44:02,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:44:02,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 161 transitions. [2019-11-16 00:44:02,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:44:02,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 161 transitions. [2019-11-16 00:44:02,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-16 00:44:02,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-11-16 00:44:02,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 161 transitions. [2019-11-16 00:44:02,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:02,113 INFO L688 BuchiCegarLoop]: Abstraction has 117 states and 161 transitions. [2019-11-16 00:44:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 161 transitions. [2019-11-16 00:44:02,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-11-16 00:44:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-16 00:44:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2019-11-16 00:44:02,123 INFO L711 BuchiCegarLoop]: Abstraction has 113 states and 157 transitions. [2019-11-16 00:44:02,123 INFO L591 BuchiCegarLoop]: Abstraction has 113 states and 157 transitions. [2019-11-16 00:44:02,123 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:44:02,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 157 transitions. [2019-11-16 00:44:02,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-16 00:44:02,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:02,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:02,126 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:02,126 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:02,126 INFO L791 eck$LassoCheckResult]: Stem: 1445#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 1446#L25 call main_#t~ret6 := rec2(main_~x~0);< 1458#rec2ENTRY ~j := #in~j; 1471#L18 assume !(~j <= 0); 1422#L20 call #t~ret3 := rec1(~j - 1);< 1470#rec1ENTRY ~i := #in~i; 1469#L12 assume !(~i <= 0); 1418#L14 call #t~ret0 := rec1(~i - 2);< 1467#rec1ENTRY ~i := #in~i; 1440#L12 assume ~i <= 0;#res := 0; 1417#rec1FINAL assume true; 1419#rec1EXIT >#27#return; 1410#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1409#rec1ENTRY ~i := #in~i; 1412#L12 assume ~i <= 0;#res := 0; 1515#rec1FINAL assume true; 1509#rec1EXIT >#29#return; 1441#L14-2 call #t~ret2 := rec1(#t~ret1);< 1442#rec1ENTRY ~i := #in~i; 1510#L12 assume ~i <= 0;#res := 0; 1508#rec1FINAL assume true; 1505#rec1EXIT >#31#return; 1434#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret2;havoc #t~ret1; 1435#rec1FINAL assume true; 1464#rec1EXIT >#33#return; 1404#L20-1 [2019-11-16 00:44:02,126 INFO L793 eck$LassoCheckResult]: Loop: 1404#L20-1 call #t~ret4 := rec2(#t~ret3);< 1403#rec2ENTRY ~j := #in~j; 1405#L18 assume !(~j <= 0); 1452#L20 call #t~ret3 := rec1(~j - 1);< 1454#rec1ENTRY ~i := #in~i; 1512#L12 assume !(~i <= 0); 1447#L14 call #t~ret0 := rec1(~i - 2);< 1454#rec1ENTRY ~i := #in~i; 1512#L12 assume ~i <= 0;#res := 0; 1511#rec1FINAL assume true; 1507#rec1EXIT >#27#return; 1411#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1409#rec1ENTRY ~i := #in~i; 1412#L12 assume ~i <= 0;#res := 0; 1515#rec1FINAL assume true; 1509#rec1EXIT >#29#return; 1506#L14-2 call #t~ret2 := rec1(#t~ret1);< 1442#rec1ENTRY ~i := #in~i; 1510#L12 assume ~i <= 0;#res := 0; 1508#rec1FINAL assume true; 1505#rec1EXIT >#31#return; 1463#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret2;havoc #t~ret1; 1475#rec1FINAL assume true; 1461#rec1EXIT >#33#return; 1404#L20-1 [2019-11-16 00:44:02,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:02,127 INFO L82 PathProgramCache]: Analyzing trace with hash -790062692, now seen corresponding path program 1 times [2019-11-16 00:44:02,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:02,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144070059] [2019-11-16 00:44:02,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:02,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:02,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:02,144 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash 125202860, now seen corresponding path program 1 times [2019-11-16 00:44:02,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:02,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474104859] [2019-11-16 00:44:02,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:02,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:02,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:02,169 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:02,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:02,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2019382713, now seen corresponding path program 1 times [2019-11-16 00:44:02,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:02,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351549048] [2019-11-16 00:44:02,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:02,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:02,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:44:02,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351549048] [2019-11-16 00:44:02,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304202233] [2019-11-16 00:44:02,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:02,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:44:02,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:44:02,490 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:02,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-16 00:44:02,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304282073] [2019-11-16 00:44:02,714 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:02,714 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:02,715 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:02,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:02,715 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:44:02,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:02,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:02,715 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:02,715 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration5_Loop [2019-11-16 00:44:02,715 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:02,715 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:02,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:02,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:02,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:02,776 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:02,776 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:02,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:02,789 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:02,799 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:44:02,800 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:44:06,059 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:44:06,061 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:06,061 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:06,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:06,062 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:06,062 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:44:06,062 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:06,062 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:06,062 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:06,062 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration5_Loop [2019-11-16 00:44:06,062 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:06,062 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:06,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:06,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:06,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:06,108 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:06,108 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:44:06,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:06,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:06,110 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:06,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:06,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:06,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:06,110 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:06,111 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:06,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:06,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:06,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:06,112 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:06,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:06,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:06,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:06,113 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:06,113 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:06,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:06,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:06,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:06,114 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:06,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:06,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:06,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:06,116 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:06,116 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:06,121 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:44:06,124 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:44:06,124 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:44:06,125 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:44:06,125 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:44:06,125 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:44:06,125 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#t~ret3) = 1*rec2_#t~ret3 Supporting invariants [] [2019-11-16 00:44:06,126 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:44:06,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:06,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:44:06,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:06,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:06,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:06,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:06,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:44:06,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:44:06,382 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2019-11-16 00:44:06,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 157 transitions. cyclomatic complexity: 51 Second operand 11 states. [2019-11-16 00:44:06,799 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 157 transitions. cyclomatic complexity: 51. Second operand 11 states. Result 584 states and 903 transitions. Complement of second has 45 states. [2019-11-16 00:44:06,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:44:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2019-11-16 00:44:06,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 25 letters. Loop has 24 letters. [2019-11-16 00:44:06,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:06,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 49 letters. Loop has 24 letters. [2019-11-16 00:44:06,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:06,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 25 letters. Loop has 48 letters. [2019-11-16 00:44:06,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:06,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 584 states and 903 transitions. [2019-11-16 00:44:06,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-11-16 00:44:06,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 584 states to 432 states and 649 transitions. [2019-11-16 00:44:06,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2019-11-16 00:44:06,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2019-11-16 00:44:06,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 432 states and 649 transitions. [2019-11-16 00:44:06,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:06,822 INFO L688 BuchiCegarLoop]: Abstraction has 432 states and 649 transitions. [2019-11-16 00:44:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states and 649 transitions. [2019-11-16 00:44:06,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 383. [2019-11-16 00:44:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-16 00:44:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 534 transitions. [2019-11-16 00:44:06,849 INFO L711 BuchiCegarLoop]: Abstraction has 383 states and 534 transitions. [2019-11-16 00:44:06,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:06,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:44:06,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:44:06,849 INFO L87 Difference]: Start difference. First operand 383 states and 534 transitions. Second operand 12 states. [2019-11-16 00:44:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:07,051 INFO L93 Difference]: Finished difference Result 442 states and 645 transitions. [2019-11-16 00:44:07,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:44:07,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 442 states and 645 transitions. [2019-11-16 00:44:07,060 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-11-16 00:44:07,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 442 states to 349 states and 495 transitions. [2019-11-16 00:44:07,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2019-11-16 00:44:07,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2019-11-16 00:44:07,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 349 states and 495 transitions. [2019-11-16 00:44:07,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:07,068 INFO L688 BuchiCegarLoop]: Abstraction has 349 states and 495 transitions. [2019-11-16 00:44:07,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states and 495 transitions. [2019-11-16 00:44:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 314. [2019-11-16 00:44:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-16 00:44:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 415 transitions. [2019-11-16 00:44:07,084 INFO L711 BuchiCegarLoop]: Abstraction has 314 states and 415 transitions. [2019-11-16 00:44:07,084 INFO L591 BuchiCegarLoop]: Abstraction has 314 states and 415 transitions. [2019-11-16 00:44:07,084 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:44:07,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 314 states and 415 transitions. [2019-11-16 00:44:07,087 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-11-16 00:44:07,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:07,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:07,088 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:07,088 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:44:07,089 INFO L791 eck$LassoCheckResult]: Stem: 3437#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 3438#L25 call main_#t~ret6 := rec2(main_~x~0);< 3454#rec2ENTRY ~j := #in~j; 3476#L18 assume !(~j <= 0); 3456#L20 call #t~ret3 := rec1(~j - 1);< 3474#rec1ENTRY ~i := #in~i; 3490#L12 assume !(~i <= 0); 3483#L14 call #t~ret0 := rec1(~i - 2);< 3489#rec1ENTRY ~i := #in~i; 3494#L12 assume ~i <= 0;#res := 0; 3548#rec1FINAL assume true; 3545#rec1EXIT >#27#return; 3540#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 3541#rec1ENTRY ~i := #in~i; 3544#L12 assume ~i <= 0;#res := 0; 3543#rec1FINAL assume true; 3539#rec1EXIT >#29#return; 3535#L14-2 call #t~ret2 := rec1(#t~ret1);< 3537#rec1ENTRY ~i := #in~i; 3542#L12 assume ~i <= 0;#res := 0; 3538#rec1FINAL assume true; 3536#rec1EXIT >#31#return; 3532#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret2;havoc #t~ret1; 3568#rec1FINAL assume true; 3455#rec1EXIT >#33#return; 3386#L20-1 call #t~ret4 := rec2(#t~ret3);< 3385#rec2ENTRY ~j := #in~j; 3387#L18 assume !(~j <= 0); 3521#L20 call #t~ret3 := rec1(~j - 1);< 3461#rec1ENTRY ~i := #in~i; 3567#L12 assume !(~i <= 0); 3423#L14 call #t~ret0 := rec1(~i - 2);< 3440#rec1ENTRY [2019-11-16 00:44:07,089 INFO L793 eck$LassoCheckResult]: Loop: 3440#rec1ENTRY ~i := #in~i; 3553#L12 assume !(~i <= 0); 3420#L14 call #t~ret0 := rec1(~i - 2);< 3440#rec1ENTRY [2019-11-16 00:44:07,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash -744961728, now seen corresponding path program 2 times [2019-11-16 00:44:07,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:07,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406208619] [2019-11-16 00:44:07,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:07,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:07,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:44:07,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406208619] [2019-11-16 00:44:07,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941644840] [2019-11-16 00:44:07,171 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:07,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:44:07,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:44:07,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:44:07,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:44:07,232 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:07,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-16 00:44:07,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417388723] [2019-11-16 00:44:07,233 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:44:07,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:07,234 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 3 times [2019-11-16 00:44:07,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:07,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132754242] [2019-11-16 00:44:07,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:07,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:07,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:07,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:07,290 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:07,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:07,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:07,290 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:07,290 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:44:07,290 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:07,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:07,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:07,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration6_Loop [2019-11-16 00:44:07,291 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:07,291 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:07,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:07,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:07,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:07,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:07,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:07,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:07,334 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:07,334 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:44:07,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:07,353 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:07,357 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:44:07,357 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:07,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:07,363 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:07,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:44:07,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:44:07,414 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:44:07,415 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:07,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:07,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:07,416 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:07,416 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:44:07,416 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:07,416 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:07,416 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:07,416 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration6_Loop [2019-11-16 00:44:07,416 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:07,416 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:07,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:07,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:07,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:07,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:07,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:07,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:07,451 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:07,451 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:44:07,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:07,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:07,452 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:07,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:07,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:07,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:07,453 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:07,453 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:07,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:07,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:07,455 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:07,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:07,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:07,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:07,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:07,456 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:07,456 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:07,457 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:44:07,458 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-16 00:44:07,458 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:44:07,459 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:44:07,459 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:44:07,459 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:44:07,459 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-11-16 00:44:07,459 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:44:07,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:44:07,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:07,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:07,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:07,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:44:07,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:07,609 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-16 00:44:07,609 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-11-16 00:44:07,695 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 348 states and 455 transitions. Complement of second has 14 states. [2019-11-16 00:44:07,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:07,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:44:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-11-16 00:44:07,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 32 letters. Loop has 3 letters. [2019-11-16 00:44:07,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:07,699 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:44:07,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:44:07,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:07,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:07,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:07,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:44:07,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:07,834 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-16 00:44:07,834 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-11-16 00:44:07,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 348 states and 455 transitions. Complement of second has 14 states. [2019-11-16 00:44:07,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:44:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-11-16 00:44:07,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 32 letters. Loop has 3 letters. [2019-11-16 00:44:07,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:07,910 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:44:07,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:44:07,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:07,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:07,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:07,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:07,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:44:07,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:08,005 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-16 00:44:08,005 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114 Second operand 5 states. [2019-11-16 00:44:08,088 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 314 states and 415 transitions. cyclomatic complexity: 114. Second operand 5 states. Result 485 states and 616 transitions. Complement of second has 16 states. [2019-11-16 00:44:08,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:44:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-11-16 00:44:08,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2019-11-16 00:44:08,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:08,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 35 letters. Loop has 3 letters. [2019-11-16 00:44:08,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:08,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 6 letters. [2019-11-16 00:44:08,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:08,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 485 states and 616 transitions. [2019-11-16 00:44:08,105 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-11-16 00:44:08,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 485 states to 395 states and 526 transitions. [2019-11-16 00:44:08,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-11-16 00:44:08,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2019-11-16 00:44:08,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 395 states and 526 transitions. [2019-11-16 00:44:08,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:08,115 INFO L688 BuchiCegarLoop]: Abstraction has 395 states and 526 transitions. [2019-11-16 00:44:08,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states and 526 transitions. [2019-11-16 00:44:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 351. [2019-11-16 00:44:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-16 00:44:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 456 transitions. [2019-11-16 00:44:08,130 INFO L711 BuchiCegarLoop]: Abstraction has 351 states and 456 transitions. [2019-11-16 00:44:08,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:44:08,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:44:08,131 INFO L87 Difference]: Start difference. First operand 351 states and 456 transitions. Second operand 10 states. [2019-11-16 00:44:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:08,270 INFO L93 Difference]: Finished difference Result 378 states and 513 transitions. [2019-11-16 00:44:08,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:44:08,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 513 transitions. [2019-11-16 00:44:08,279 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-16 00:44:08,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 104 states and 142 transitions. [2019-11-16 00:44:08,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2019-11-16 00:44:08,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2019-11-16 00:44:08,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 142 transitions. [2019-11-16 00:44:08,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:08,282 INFO L688 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2019-11-16 00:44:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 142 transitions. [2019-11-16 00:44:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2019-11-16 00:44:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-16 00:44:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2019-11-16 00:44:08,287 INFO L711 BuchiCegarLoop]: Abstraction has 86 states and 106 transitions. [2019-11-16 00:44:08,288 INFO L591 BuchiCegarLoop]: Abstraction has 86 states and 106 transitions. [2019-11-16 00:44:08,288 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:44:08,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 106 transitions. [2019-11-16 00:44:08,289 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-16 00:44:08,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:08,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:08,290 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:08,290 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:44:08,290 INFO L791 eck$LassoCheckResult]: Stem: 6182#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 6183#L25 call main_#t~ret6 := rec2(main_~x~0);< 6187#rec2ENTRY ~j := #in~j; 6213#L18 assume !(~j <= 0); 6210#L20 call #t~ret3 := rec1(~j - 1);< 6212#rec1ENTRY ~i := #in~i; 6211#L12 assume !(~i <= 0); 6172#L14 call #t~ret0 := rec1(~i - 2);< 6189#rec1ENTRY ~i := #in~i; 6177#L12 assume !(~i <= 0); 6170#L14 [2019-11-16 00:44:08,290 INFO L793 eck$LassoCheckResult]: Loop: 6170#L14 call #t~ret0 := rec1(~i - 2);< 6219#rec1ENTRY ~i := #in~i; 6177#L12 assume !(~i <= 0); 6170#L14 [2019-11-16 00:44:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:08,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1371444593, now seen corresponding path program 3 times [2019-11-16 00:44:08,291 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:08,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968920257] [2019-11-16 00:44:08,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:08,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:08,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:08,300 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:08,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash 54781, now seen corresponding path program 4 times [2019-11-16 00:44:08,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:08,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684461147] [2019-11-16 00:44:08,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:08,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:08,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:08,307 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:08,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:08,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1318041775, now seen corresponding path program 4 times [2019-11-16 00:44:08,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:08,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333968269] [2019-11-16 00:44:08,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:08,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:08,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:08,320 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:08,349 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:08,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:08,349 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:08,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:08,350 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:44:08,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:08,350 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:08,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:08,350 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration7_Loop [2019-11-16 00:44:08,350 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:08,350 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:08,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:08,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:08,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:08,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:08,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:08,400 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:08,400 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:44:08,408 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:08,408 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/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) [2019-11-16 00:44:08,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:44:08,420 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:14,190 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:44:14,191 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:14,192 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:14,192 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:14,192 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:14,192 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:44:14,192 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:14,192 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:14,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:14,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration7_Loop [2019-11-16 00:44:14,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:14,192 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:14,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,241 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:14,242 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:44:14,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:14,242 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:14,242 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:14,243 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:14,243 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:14,243 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:14,243 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:14,243 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:14,245 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:44:14,247 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:44:14,247 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:44:14,248 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:44:14,248 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:44:14,248 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:44:14,248 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_~i) = 1*rec1_~i Supporting invariants [] [2019-11-16 00:44:14,248 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:44:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:44:14,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:44:14,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:14,303 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:44:14,303 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 106 transitions. cyclomatic complexity: 23 Second operand 4 states. [2019-11-16 00:44:14,338 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 106 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 100 states and 124 transitions. Complement of second has 11 states. [2019-11-16 00:44:14,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:44:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-11-16 00:44:14,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-16 00:44:14,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:14,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-16 00:44:14,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:14,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-16 00:44:14,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:14,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 124 transitions. [2019-11-16 00:44:14,342 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-16 00:44:14,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 94 states and 117 transitions. [2019-11-16 00:44:14,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2019-11-16 00:44:14,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-11-16 00:44:14,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 117 transitions. [2019-11-16 00:44:14,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:14,345 INFO L688 BuchiCegarLoop]: Abstraction has 94 states and 117 transitions. [2019-11-16 00:44:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 117 transitions. [2019-11-16 00:44:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-11-16 00:44:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-16 00:44:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2019-11-16 00:44:14,351 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 114 transitions. [2019-11-16 00:44:14,351 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 114 transitions. [2019-11-16 00:44:14,351 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:44:14,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 114 transitions. [2019-11-16 00:44:14,352 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-11-16 00:44:14,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:44:14,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:44:14,354 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:14,354 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-16 00:44:14,355 INFO L791 eck$LassoCheckResult]: Stem: 6436#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 6405#L25 call main_#t~ret6 := rec2(main_~x~0);< 6404#rec2ENTRY ~j := #in~j; 6406#L18 assume !(~j <= 0); 6439#L20 call #t~ret3 := rec1(~j - 1);< 6440#rec1ENTRY ~i := #in~i; 6461#L12 assume !(~i <= 0); 6424#L14 call #t~ret0 := rec1(~i - 2);< 6458#rec1ENTRY ~i := #in~i; 6475#L12 assume !(~i <= 0); 6408#L14 call #t~ret0 := rec1(~i - 2);< 6407#rec1ENTRY ~i := #in~i; 6409#L12 assume ~i <= 0;#res := 0; 6495#rec1FINAL assume true; 6493#rec1EXIT >#27#return; 6417#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6423#rec1ENTRY ~i := #in~i; 6489#L12 assume ~i <= 0;#res := 0; 6488#rec1FINAL assume true; 6466#rec1EXIT >#29#return; 6467#L14-2 call #t~ret2 := rec1(#t~ret1);< 6479#rec1ENTRY ~i := #in~i; 6485#L12 assume ~i <= 0;#res := 0; 6484#rec1FINAL assume true; 6477#rec1EXIT >#31#return; 6476#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret2;havoc #t~ret1; 6464#rec1FINAL assume true; 6465#rec1EXIT >#27#return; 6418#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6454#rec1ENTRY [2019-11-16 00:44:14,355 INFO L793 eck$LassoCheckResult]: Loop: 6454#rec1ENTRY ~i := #in~i; 6482#L12 assume !(~i <= 0); 6422#L14 call #t~ret0 := rec1(~i - 2);< 6437#rec1ENTRY ~i := #in~i; 6481#L12 assume !(~i <= 0); 6415#L14 call #t~ret0 := rec1(~i - 2);< 6438#rec1ENTRY ~i := #in~i; 6435#L12 assume ~i <= 0;#res := 0; 6414#rec1FINAL assume true; 6416#rec1EXIT >#27#return; 6417#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6423#rec1ENTRY ~i := #in~i; 6489#L12 assume ~i <= 0;#res := 0; 6488#rec1FINAL assume true; 6466#rec1EXIT >#29#return; 6467#L14-2 call #t~ret2 := rec1(#t~ret1);< 6479#rec1ENTRY ~i := #in~i; 6485#L12 assume ~i <= 0;#res := 0; 6484#rec1FINAL assume true; 6477#rec1EXIT >#31#return; 6476#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret2;havoc #t~ret1; 6464#rec1FINAL assume true; 6465#rec1EXIT >#27#return; 6419#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6454#rec1ENTRY [2019-11-16 00:44:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:14,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1733863270, now seen corresponding path program 1 times [2019-11-16 00:44:14,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:14,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261274221] [2019-11-16 00:44:14,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:14,378 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:14,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:14,378 INFO L82 PathProgramCache]: Analyzing trace with hash -165506564, now seen corresponding path program 1 times [2019-11-16 00:44:14,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:14,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784614208] [2019-11-16 00:44:14,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:14,400 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:14,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:14,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2126813793, now seen corresponding path program 2 times [2019-11-16 00:44:14,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:14,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662664375] [2019-11-16 00:44:14,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:14,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 43 proven. 32 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-16 00:44:14,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662664375] [2019-11-16 00:44:14,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852435734] [2019-11-16 00:44:14,538 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:14,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:44:14,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:44:14,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:44:14,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:44:14,609 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:14,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 11 [2019-11-16 00:44:14,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992671341] [2019-11-16 00:44:14,833 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:14,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:14,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:14,834 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:14,834 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:44:14,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:14,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:14,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:14,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration8_Loop [2019-11-16 00:44:14,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:14,834 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:14,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,887 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:14,887 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:14,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:14,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:44:14,894 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:44:14,894 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:14,897 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:14,897 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:44:14,900 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:44:14,900 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:14,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:14,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:44:14,906 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:44:14,906 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:14,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:44:14,911 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5938717f-cdb8-44b3-9dc4-9ef808e6d53f/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-11-16 00:44:14,917 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:44:14,917 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-11-16 00:44:14,922 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:44:14,923 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:44:14,923 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:44:14,923 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:44:14,923 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:44:14,923 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:44:14,923 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:44:14,923 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:44:14,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:44:14,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration8_Loop [2019-11-16 00:44:14,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:44:14,924 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:44:14,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:44:14,959 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:44:14,959 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:44:14,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:14,960 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:14,960 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:14,960 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:14,960 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:14,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:14,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:14,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:14,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:14,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:14,961 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:14,962 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:14,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:14,962 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:14,962 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:14,962 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:14,962 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:14,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:44:14,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:44:14,963 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:44:14,963 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:44:14,963 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:44:14,963 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:44:14,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:44:14,964 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:44:14,964 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:44:14,965 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:44:14,966 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:44:14,966 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:44:14,967 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:44:14,967 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:44:14,967 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:44:14,967 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-11-16 00:44:14,967 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:44:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:15,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:44:15,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:15,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:15,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:15,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:15,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:44:15,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:44:15,185 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2019-11-16 00:44:15,186 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26 Second operand 11 states. [2019-11-16 00:44:15,238 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 100 states and 122 transitions. Complement of second has 7 states. [2019-11-16 00:44:15,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:44:15,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-16 00:44:15,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 24 letters. [2019-11-16 00:44:15,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:15,239 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:44:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:15,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:44:15,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:15,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:15,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:15,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:15,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:44:15,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:44:15,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2019-11-16 00:44:15,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26 Second operand 11 states. [2019-11-16 00:44:15,534 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 100 states and 122 transitions. Complement of second has 7 states. [2019-11-16 00:44:15,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:44:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-16 00:44:15,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 24 letters. [2019-11-16 00:44:15,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:15,536 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:44:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:15,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:44:15,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:15,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:15,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:15,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:15,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:44:15,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:44:15,784 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 9 loop predicates [2019-11-16 00:44:15,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26 Second operand 11 states. [2019-11-16 00:44:16,058 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 257 states and 303 transitions. Complement of second has 31 states. [2019-11-16 00:44:16,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:44:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2019-11-16 00:44:16,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 38 transitions. Stem has 29 letters. Loop has 24 letters. [2019-11-16 00:44:16,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:16,060 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:44:16,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:16,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:44:16,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:16,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:16,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:16,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:16,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:44:16,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:44:16,262 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2019-11-16 00:44:16,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26 Second operand 11 states. [2019-11-16 00:44:16,687 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 26. Second operand 11 states. Result 409 states and 515 transitions. Complement of second has 80 states. [2019-11-16 00:44:16,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2019-11-16 00:44:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:44:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2019-11-16 00:44:16,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 29 letters. Loop has 24 letters. [2019-11-16 00:44:16,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:16,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 53 letters. Loop has 24 letters. [2019-11-16 00:44:16,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:16,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 49 transitions. Stem has 29 letters. Loop has 48 letters. [2019-11-16 00:44:16,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:44:16,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 515 transitions. [2019-11-16 00:44:16,703 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2019-11-16 00:44:16,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 253 states and 345 transitions. [2019-11-16 00:44:16,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2019-11-16 00:44:16,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2019-11-16 00:44:16,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 253 states and 345 transitions. [2019-11-16 00:44:16,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:44:16,709 INFO L688 BuchiCegarLoop]: Abstraction has 253 states and 345 transitions. [2019-11-16 00:44:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states and 345 transitions. [2019-11-16 00:44:16,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 216. [2019-11-16 00:44:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-16 00:44:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 270 transitions. [2019-11-16 00:44:16,718 INFO L711 BuchiCegarLoop]: Abstraction has 216 states and 270 transitions. [2019-11-16 00:44:16,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:16,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:44:16,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:44:16,718 INFO L87 Difference]: Start difference. First operand 216 states and 270 transitions. Second operand 11 states. [2019-11-16 00:44:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:16,840 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-11-16 00:44:16,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:44:16,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2019-11-16 00:44:16,841 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:44:16,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2019-11-16 00:44:16,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:44:16,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:44:16,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:44:16,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:44:16,842 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:16,842 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:16,842 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:44:16,842 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:44:16,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:44:16,842 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:44:16,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:44:16,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:44:16 BoogieIcfgContainer [2019-11-16 00:44:16,850 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:44:16,852 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:44:16,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:44:16,853 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:44:16,853 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:58" (3/4) ... [2019-11-16 00:44:16,862 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:44:16,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:44:16,870 INFO L168 Benchmark]: Toolchain (without parser) took 18471.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 946.5 MB in the beginning and 952.4 MB in the end (delta: -5.9 MB). Peak memory consumption was 190.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:16,871 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:16,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:16,873 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.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-11-16 00:44:16,873 INFO L168 Benchmark]: Boogie Preprocessor took 15.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:16,874 INFO L168 Benchmark]: RCFGBuilder took 250.89 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:16,876 INFO L168 Benchmark]: BuchiAutomizer took 17909.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 952.4 MB in the end (delta: 158.3 MB). Peak memory consumption was 220.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:16,876 INFO L168 Benchmark]: Witness Printer took 16.02 ms. Allocated memory is still 1.2 GB. Free memory is still 952.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:16,879 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.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 15.54 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 250.89 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17909.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 952.4 MB in the end (delta: 158.3 MB). Peak memory consumption was 220.7 MB. Max. memory is 11.5 GB. * Witness Printer took 16.02 ms. Allocated memory is still 1.2 GB. Free memory is still 952.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (5 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 11 locations. One deterministic module has affine ranking function \old(i) and consists of 4 locations. One deterministic module has affine ranking function \old(i) and consists of 5 locations. One deterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19a06a8b and consists of 11 locations. One deterministic module has affine ranking function i and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 15 locations. 5 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.8s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 12.5s. Construction of modules took 1.0s. Büchi inclusion checks took 3.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 249 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 314 states and ocurred in iteration 5. Nontrivial modules had stage [5, 0, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 38/58 HoareTripleCheckerStatistics: 284 SDtfs, 352 SDslu, 489 SDs, 0 SdLazy, 977 SolverSat, 338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT3 conc0 concLT3 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf98 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf92 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 9.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...