./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c.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_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/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 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:09:32,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:09:32,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:09:32,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:09:32,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:09:32,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:09:32,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:09:32,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:09:32,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:09:32,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:09:32,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:09:32,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:09:32,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:09:32,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:09:32,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:09:32,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:09:32,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:09:32,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:09:32,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:09:32,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:09:32,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:09:32,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:09:32,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:09:32,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:09:32,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:09:32,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:09:32,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:09:32,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:09:32,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:09:32,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:09:32,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:09:32,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:09:32,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:09:32,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:09:32,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:09:32,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:09:32,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:09:32,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:09:32,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:09:32,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:09:32,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:09:32,410 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:09:32,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:09:32,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:09:32,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:09:32,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:09:32,428 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:09:32,428 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:09:32,429 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:09:32,429 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:09:32,429 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:09:32,429 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:09:32,430 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:09:32,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:09:32,430 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:09:32,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:09:32,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:09:32,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:09:32,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:09:32,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:09:32,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:09:32,432 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:09:32,432 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:09:32,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:09:32,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:09:32,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:09:32,434 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:09:32,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:09:32,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:09:32,434 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:09:32,435 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:09:32,436 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_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/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 -> 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 [2019-11-16 00:09:32,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:09:32,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:09:32,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:09:32,480 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:09:32,481 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:09:32,481 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c.c [2019-11-16 00:09:32,540 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/data/27316922c/594a3af7371144618c3343f7aa452344/FLAG72a7af5f1 [2019-11-16 00:09:32,927 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:09:32,928 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/sv-benchmarks/c/termination-crafted/NestedRecursion_1c.c [2019-11-16 00:09:32,934 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/data/27316922c/594a3af7371144618c3343f7aa452344/FLAG72a7af5f1 [2019-11-16 00:09:33,277 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/data/27316922c/594a3af7371144618c3343f7aa452344 [2019-11-16 00:09:33,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:09:33,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:09:33,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:09:33,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:09:33,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:09:33,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:09:33" (1/1) ... [2019-11-16 00:09:33,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c123861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:33, skipping insertion in model container [2019-11-16 00:09:33,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:09:33" (1/1) ... [2019-11-16 00:09:33,298 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:09:33,313 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:09:33,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:09:33,447 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:09:33,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:09:33,544 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:09:33,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:33 WrapperNode [2019-11-16 00:09:33,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:09:33,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:09:33,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:09:33,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:09:33,553 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:09:33" (1/1) ... [2019-11-16 00:09:33,558 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:09:33" (1/1) ... [2019-11-16 00:09:33,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:09:33,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:09:33,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:09:33,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:09:33,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:33" (1/1) ... [2019-11-16 00:09:33,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:33" (1/1) ... [2019-11-16 00:09:33,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:33" (1/1) ... [2019-11-16 00:09:33,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:33" (1/1) ... [2019-11-16 00:09:33,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:33" (1/1) ... [2019-11-16 00:09:33,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:33" (1/1) ... [2019-11-16 00:09:33,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:33" (1/1) ... [2019-11-16 00:09:33,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:09:33,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:09:33,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:09:33,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:09:33,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/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:09:33,673 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-16 00:09:33,673 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-16 00:09:33,674 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-16 00:09:33,675 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-16 00:09:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:09:33,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:09:33,904 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:09:33,906 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:09:33,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:09:33 BoogieIcfgContainer [2019-11-16 00:09:33,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:09:33,909 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:09:33,909 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:09:33,913 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:09:33,914 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:09:33,914 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:09:33" (1/3) ... [2019-11-16 00:09:33,915 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70a923c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:09:33, skipping insertion in model container [2019-11-16 00:09:33,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:09:33,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:33" (2/3) ... [2019-11-16 00:09:33,916 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70a923c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:09:33, skipping insertion in model container [2019-11-16 00:09:33,916 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:09:33,916 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:09:33" (3/3) ... [2019-11-16 00:09:33,918 INFO L371 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1c.c [2019-11-16 00:09:33,966 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:09:33,966 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:09:33,967 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:09:33,967 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:09:33,967 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:09:33,967 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:09:33,967 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:09:33,967 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:09:33,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-16 00:09:34,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-16 00:09:34,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:34,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:34,015 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:09:34,016 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:09:34,016 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:09:34,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-16 00:09:34,029 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-16 00:09:34,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:34,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:34,030 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:09:34,030 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:09:34,037 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:09:34,038 INFO L793 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue ~j := #in~j; 20#L18true assume !(~j <= 0); 18#L20true call #t~ret3 := rec2(~j - 1);< 3#rec2ENTRYtrue [2019-11-16 00:09:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 1 times [2019-11-16 00:09:34,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:34,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524390001] [2019-11-16 00:09:34,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:34,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:34,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:34,133 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:34,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:34,135 INFO L82 PathProgramCache]: Analyzing trace with hash 39867, now seen corresponding path program 1 times [2019-11-16 00:09:34,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:34,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383643305] [2019-11-16 00:09:34,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:34,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:34,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:34,155 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:34,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:34,157 INFO L82 PathProgramCache]: Analyzing trace with hash 48182123, now seen corresponding path program 1 times [2019-11-16 00:09:34,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:34,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296279003] [2019-11-16 00:09:34,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:34,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:34,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:34,170 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:34,278 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:34,279 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:34,279 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:34,279 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:34,279 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:09:34,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:34,280 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:34,280 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:34,280 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c.c_Iteration1_Loop [2019-11-16 00:09:34,280 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:34,280 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:34,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:09:34,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:09:34,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,334 INFO 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:09:34,393 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:34,394 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/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:09:34,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:09:34,402 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:34,412 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:09:34,413 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_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:34,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:09:34,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:09:34,424 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:09:34,424 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_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/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:09:34,432 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:09:34,432 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:09:34,436 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:09:34,436 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_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/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:09:34,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:09:34,442 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:34,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:09:34,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:09:34,465 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:09:34,468 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:34,469 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:34,469 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:34,469 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:34,469 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:09:34,469 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:34,469 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:34,470 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:34,470 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c.c_Iteration1_Loop [2019-11-16 00:09:34,470 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:34,470 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:34,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:34,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:09:34,489 INFO 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:09:34,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:09:34,497 INFO 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:09:34,605 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:34,610 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:09:34,612 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:09:34,614 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:34,614 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:34,614 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:34,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:34,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:34,617 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:34,617 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:34,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:34,622 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:09:34,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:34,623 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:34,623 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:34,623 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:34,623 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:34,624 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:34,625 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:34,647 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:09:34,654 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:09:34,660 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:09:34,662 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:09:34,663 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:09:34,663 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:09:34,663 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2019-11-16 00:09:34,675 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:09:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:34,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:09:34,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:34,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:09:34,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:34,820 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:09:34,838 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:09:34,839 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 4 states. [2019-11-16 00:09:34,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 4 states. Result 36 states and 44 transitions. Complement of second has 12 states. [2019-11-16 00:09:34,993 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:09:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:09:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-11-16 00:09:34,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-16 00:09:34,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:34,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-16 00:09:34,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:34,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-16 00:09:34,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:34,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2019-11-16 00:09:35,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:09:35,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 23 states and 30 transitions. [2019-11-16 00:09:35,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-16 00:09:35,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-16 00:09:35,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-11-16 00:09:35,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:35,016 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-16 00:09:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-11-16 00:09:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-11-16 00:09:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:09:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-16 00:09:35,048 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-16 00:09:35,048 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-16 00:09:35,048 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:09:35,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-16 00:09:35,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:09:35,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:35,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:35,051 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:35,051 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:09:35,051 INFO L791 eck$LassoCheckResult]: Stem: 125#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; 108#L25 call main_#t~ret6 := rec2(main_~x~0);< 107#rec2ENTRY ~j := #in~j; 109#L18 assume !(~j <= 0); 111#L20 call #t~ret3 := rec2(~j - 1);< 110#rec2ENTRY ~j := #in~j; 112#L18 assume ~j <= 0;#res := 0; 121#rec2FINAL assume true; 122#rec2EXIT >#33#return; 117#L20-1 call #t~ret4 := rec1(#t~ret3);< 113#rec1ENTRY [2019-11-16 00:09:35,051 INFO L793 eck$LassoCheckResult]: Loop: 113#rec1ENTRY ~i := #in~i; 118#L12 assume !(~i <= 0); 114#L14 call #t~ret0 := rec1(~i - 2);< 113#rec1ENTRY [2019-11-16 00:09:35,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:35,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1361947899, now seen corresponding path program 1 times [2019-11-16 00:09:35,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:35,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850093538] [2019-11-16 00:09:35,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:35,070 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 1 times [2019-11-16 00:09:35,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:35,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788080131] [2019-11-16 00:09:35,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:35,079 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:35,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:35,080 INFO L82 PathProgramCache]: Analyzing trace with hash 766186353, now seen corresponding path program 1 times [2019-11-16 00:09:35,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:35,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146191996] [2019-11-16 00:09:35,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:09:35,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146191996] [2019-11-16 00:09:35,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:35,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:09:35,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291798840] [2019-11-16 00:09:35,209 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:35,209 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:35,209 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:35,209 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:35,210 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:09:35,210 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:35,210 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:35,210 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:35,210 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c.c_Iteration2_Loop [2019-11-16 00:09:35,210 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:35,210 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:35,212 INFO 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:09:35,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:35,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:35,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:35,235 INFO 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:09:35,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:35,286 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:35,286 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/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:09:35,302 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:09:35,302 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:35,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:09:35,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:09:35,372 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:09:35,373 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:35,373 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:35,374 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:35,374 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:35,374 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:09:35,374 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:35,374 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:35,374 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:35,374 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c.c_Iteration2_Loop [2019-11-16 00:09:35,374 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:35,374 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:35,375 INFO 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:09:35,395 INFO 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:09:35,398 INFO 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:09:35,400 INFO 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:09:35,403 INFO 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:09:35,405 INFO 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:09:35,450 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:35,450 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:09:35,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:09:35,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:35,452 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:35,452 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:35,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:35,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:35,453 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:35,454 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:35,460 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:09:35,466 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-16 00:09:35,467 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:09:35,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:09:35,468 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:09:35,468 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:09:35,469 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-11-16 00:09:35,469 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:09:35,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:35,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:09:35,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:35,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:09:35,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:35,614 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:09:35,614 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:09:35,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-11-16 00:09:35,748 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 58 transitions. Complement of second has 14 states. [2019-11-16 00:09:35,749 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:09:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:09:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-16 00:09:35,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-16 00:09:35,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:35,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-16 00:09:35,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:35,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-16 00:09:35,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:35,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 58 transitions. [2019-11-16 00:09:35,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:09:35,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 37 states and 50 transitions. [2019-11-16 00:09:35,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-16 00:09:35,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-16 00:09:35,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-11-16 00:09:35,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:35,763 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-11-16 00:09:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-11-16 00:09:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-11-16 00:09:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-16 00:09:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-11-16 00:09:35,771 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-11-16 00:09:35,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:35,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:09:35,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:09:35,777 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 6 states. [2019-11-16 00:09:35,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:35,832 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-11-16 00:09:35,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:09:35,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-11-16 00:09:35,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:09:35,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 40 transitions. [2019-11-16 00:09:35,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-16 00:09:35,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-16 00:09:35,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-11-16 00:09:35,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:35,839 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-16 00:09:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-11-16 00:09:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-11-16 00:09:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-16 00:09:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-16 00:09:35,846 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-16 00:09:35,846 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-16 00:09:35,846 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:09:35,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2019-11-16 00:09:35,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:09:35,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:09:35,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:09:35,850 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:35,850 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:09:35,850 INFO L791 eck$LassoCheckResult]: Stem: 347#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; 324#L25 call main_#t~ret6 := rec2(main_~x~0);< 323#rec2ENTRY ~j := #in~j; 325#L18 assume !(~j <= 0); 327#L20 call #t~ret3 := rec2(~j - 1);< 326#rec2ENTRY ~j := #in~j; 330#L18 assume !(~j <= 0); 328#L20 call #t~ret3 := rec2(~j - 1);< 326#rec2ENTRY ~j := #in~j; 329#L18 assume ~j <= 0;#res := 0; 340#rec2FINAL assume true; 341#rec2EXIT >#33#return; 332#L20-1 call #t~ret4 := rec1(#t~ret3);< 331#rec1ENTRY ~i := #in~i; 333#L12 assume ~i <= 0;#res := 0; 344#rec1FINAL assume true; 345#rec1EXIT >#35#return; 346#L20-2 #res := #t~ret4 - 1;havoc #t~ret4;havoc #t~ret3; 348#rec2FINAL assume true; 350#rec2EXIT >#33#return; 337#L20-1 call #t~ret4 := rec1(#t~ret3);< 342#rec1ENTRY [2019-11-16 00:09:35,850 INFO L793 eck$LassoCheckResult]: Loop: 342#rec1ENTRY ~i := #in~i; 349#L12 assume !(~i <= 0); 335#L14 call #t~ret0 := rec1(~i - 2);< 342#rec1ENTRY [2019-11-16 00:09:35,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:35,851 INFO L82 PathProgramCache]: Analyzing trace with hash -196165858, now seen corresponding path program 1 times [2019-11-16 00:09:35,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:35,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702489868] [2019-11-16 00:09:35,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:35,885 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:35,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:35,886 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 2 times [2019-11-16 00:09:35,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:35,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295392326] [2019-11-16 00:09:35,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:09:35,895 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:09:35,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:35,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1473414328, now seen corresponding path program 1 times [2019-11-16 00:09:35,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:35,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698020074] [2019-11-16 00:09:35,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:35,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:09:36,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698020074] [2019-11-16 00:09:36,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:09:36,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:09:36,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627833274] [2019-11-16 00:09:36,113 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:36,113 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:36,113 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:36,113 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:36,114 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:09:36,114 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:36,114 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:36,114 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:36,114 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c.c_Iteration3_Loop [2019-11-16 00:09:36,115 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:36,115 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:36,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:36,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:36,123 INFO 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:09:36,126 INFO 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:09:36,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:36,134 INFO 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:09:36,176 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:36,177 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/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:09:36,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:09:36,191 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:09:36,197 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:09:36,197 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_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:09:36,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:09:36,213 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:36,217 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:09:36,218 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_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/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) [2019-11-16 00:09:36,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:09:36,234 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:36,241 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:09:36,241 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_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:09:36,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:09:36,257 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:36,262 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:09:36,262 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_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:09:36,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:09:36,277 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:36,282 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:09:36,282 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_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/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) [2019-11-16 00:09:36,304 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:09:36,304 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b7b185e8-06f6-49e2-a82c-4bbca88bc37e/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:09:36,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:09:36,328 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:36,400 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:09:36,404 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:09:36,404 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:09:36,404 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:09:36,404 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:09:36,404 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:09:36,405 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:09:36,405 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:09:36,405 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:09:36,405 INFO L131 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1c.c_Iteration3_Loop [2019-11-16 00:09:36,405 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:09:36,405 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:09:36,407 INFO 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:09:36,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:36,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:09:36,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:36,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:09:36,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:09:36,489 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:09:36,489 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:09:36,490 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:09:36,491 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:36,491 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:36,492 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:36,492 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:36,492 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:36,493 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:36,493 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:36,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:36,495 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:09:36,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:36,496 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:36,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:36,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:36,497 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:36,498 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:36,498 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:36,499 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:36,500 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:09:36,500 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:36,501 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:36,501 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:36,501 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:36,501 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:36,502 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:36,502 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:36,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:36,504 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:09:36,504 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:36,505 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:36,505 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:36,505 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:36,505 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:36,506 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:36,506 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:36,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:09:36,508 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:09:36,508 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:09:36,509 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:09:36,509 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:09:36,509 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:09:36,509 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:09:36,510 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:09:36,510 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:09:36,515 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:09:36,518 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-16 00:09:36,518 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:09:36,519 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:09:36,519 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:09:36,519 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:09:36,519 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2019-11-16 00:09:36,520 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:09:36,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:09:36,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:36,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:36,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:09:36,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:36,720 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:09:36,720 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:09:36,720 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-11-16 00:09:36,816 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 31 states and 37 transitions. Complement of second has 7 states. [2019-11-16 00:09:36,817 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:09:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:09:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-16 00:09:36,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-16 00:09:36,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:36,818 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:09:36,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:09:36,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:36,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:36,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:36,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:09:36,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:36,956 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:09:36,957 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:09:36,957 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-11-16 00:09:37,044 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 31 states and 37 transitions. Complement of second has 7 states. [2019-11-16 00:09:37,046 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:09:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:09:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-16 00:09:37,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-16 00:09:37,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:37,047 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:09:37,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:37,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:09:37,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:37,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:37,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:37,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:09:37,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:37,182 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:09:37,182 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:09:37,182 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-11-16 00:09:37,320 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 34 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 53 states and 65 transitions. Complement of second has 13 states. [2019-11-16 00:09:37,321 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:09:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:09:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2019-11-16 00:09:37,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-16 00:09:37,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:37,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-16 00:09:37,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:37,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 21 letters. Loop has 6 letters. [2019-11-16 00:09:37,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:09:37,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2019-11-16 00:09:37,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:09:37,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 41 states and 52 transitions. [2019-11-16 00:09:37,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-16 00:09:37,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-11-16 00:09:37,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2019-11-16 00:09:37,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:09:37,329 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-11-16 00:09:37,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2019-11-16 00:09:37,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-16 00:09:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-16 00:09:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2019-11-16 00:09:37,336 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-11-16 00:09:37,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:37,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:09:37,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:09:37,337 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 8 states. [2019-11-16 00:09:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:37,411 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-11-16 00:09:37,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:09:37,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2019-11-16 00:09:37,413 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:09:37,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-11-16 00:09:37,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:09:37,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:09:37,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:09:37,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:09:37,414 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:09:37,414 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:09:37,414 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:09:37,414 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:09:37,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:09:37,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:09:37,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:09:37,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:09:37 BoogieIcfgContainer [2019-11-16 00:09:37,421 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:09:37,421 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:09:37,421 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:09:37,422 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:09:37,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:09:33" (3/4) ... [2019-11-16 00:09:37,426 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:09:37,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:09:37,428 INFO L168 Benchmark]: Toolchain (without parser) took 4145.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -77.0 MB). Peak memory consumption was 47.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:37,429 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:09:37,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:37,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.67 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:09:37,430 INFO L168 Benchmark]: Boogie Preprocessor took 16.26 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:09:37,431 INFO L168 Benchmark]: RCFGBuilder took 315.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:37,432 INFO L168 Benchmark]: BuchiAutomizer took 3512.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.1 MB). Peak memory consumption was 78.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:09:37,432 INFO L168 Benchmark]: Witness Printer took 4.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:09:37,435 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.67 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 16.26 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 315.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3512.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.1 MB). Peak memory consumption was 78.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 4 locations. One deterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 4 iterations. TraceHistogramMax:3. Analysis of lassos took 1.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 88 SDtfs, 94 SDslu, 174 SDs, 0 SdLazy, 126 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...