./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-invgen/nested6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-invgen/nested6.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 934ee9c856a834ce808d29dea79c6912619f897f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:53:20,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:53:20,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:53:20,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:53:20,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:53:20,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:53:20,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:53:20,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:53:20,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:53:20,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:53:20,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:53:20,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:53:20,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:53:20,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:53:20,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:53:20,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:53:20,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:53:20,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:53:20,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:53:20,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:53:20,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:53:20,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:53:20,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:53:20,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:53:20,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:53:20,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:53:20,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:53:20,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:53:20,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:53:20,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:53:20,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:53:20,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:53:20,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:53:20,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:53:20,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:53:20,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:53:20,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:53:20,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:53:20,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:53:20,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:53:20,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:53:20,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:53:20,870 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:53:20,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:53:20,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:53:20,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:53:20,882 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:53:20,882 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:53:20,882 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:53:20,883 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:53:20,883 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:53:20,883 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:53:20,884 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:53:20,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:53:20,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:53:20,885 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:53:20,885 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:53:20,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:53:20,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:53:20,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:53:20,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:53:20,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:53:20,887 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:53:20,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:53:20,888 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:53:20,888 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:53:20,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:53:20,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:53:20,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:53:20,890 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:53:20,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:53:20,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:53:20,891 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:53:20,893 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:53:20,893 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_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 934ee9c856a834ce808d29dea79c6912619f897f [2019-11-15 22:53:20,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:53:20,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:53:20,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:53:20,960 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:53:20,960 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:53:20,961 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/nested6.i [2019-11-15 22:53:21,036 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/data/3544873fc/6687f43d6c4344fab6edb9c6b2a52beb/FLAGb48313d5c [2019-11-15 22:53:21,524 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:53:21,525 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/sv-benchmarks/c/loop-invgen/nested6.i [2019-11-15 22:53:21,533 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/data/3544873fc/6687f43d6c4344fab6edb9c6b2a52beb/FLAGb48313d5c [2019-11-15 22:53:21,870 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/data/3544873fc/6687f43d6c4344fab6edb9c6b2a52beb [2019-11-15 22:53:21,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:53:21,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:53:21,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:53:21,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:53:21,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:53:21,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:53:21" (1/1) ... [2019-11-15 22:53:21,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb95f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:21, skipping insertion in model container [2019-11-15 22:53:21,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:53:21" (1/1) ... [2019-11-15 22:53:21,905 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:53:21,924 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:53:22,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:53:22,120 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:53:22,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:53:22,244 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:53:22,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:22 WrapperNode [2019-11-15 22:53:22,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:53:22,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:53:22,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:53:22,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:53:22,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:22" (1/1) ... [2019-11-15 22:53:22,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:22" (1/1) ... [2019-11-15 22:53:22,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:53:22,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:53:22,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:53:22,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:53:22,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:22" (1/1) ... [2019-11-15 22:53:22,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:22" (1/1) ... [2019-11-15 22:53:22,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:22" (1/1) ... [2019-11-15 22:53:22,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:22" (1/1) ... [2019-11-15 22:53:22,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:22" (1/1) ... [2019-11-15 22:53:22,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:22" (1/1) ... [2019-11-15 22:53:22,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:22" (1/1) ... [2019-11-15 22:53:22,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:53:22,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:53:22,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:53:22,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:53:22,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/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-15 22:53:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:53:22,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:53:22,733 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:53:22,733 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-15 22:53:22,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:53:22 BoogieIcfgContainer [2019-11-15 22:53:22,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:53:22,735 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:53:22,735 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:53:22,740 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:53:22,741 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:53:22,742 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:53:21" (1/3) ... [2019-11-15 22:53:22,743 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23029534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:53:22, skipping insertion in model container [2019-11-15 22:53:22,760 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:53:22,760 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:53:22" (2/3) ... [2019-11-15 22:53:22,761 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23029534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:53:22, skipping insertion in model container [2019-11-15 22:53:22,761 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:53:22,761 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:53:22" (3/3) ... [2019-11-15 22:53:22,763 INFO L371 chiAutomizerObserver]: Analyzing ICFG nested6.i [2019-11-15 22:53:22,865 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:53:22,865 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:53:22,866 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:53:22,867 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:53:22,867 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:53:22,867 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:53:22,867 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:53:22,868 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:53:22,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-15 22:53:22,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 22:53:22,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:22,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:22,940 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:53:22,940 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:22,941 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:53:22,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-11-15 22:53:22,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-15 22:53:22,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:22,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:22,948 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:53:22,948 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:22,958 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 21#L14true assume !!(main_~n~0 < 1000000); 3#L15true assume main_~k~0 == main_~n~0; 22#L15-1true main_~i~0 := 0; 5#L19-3true [2019-11-15 22:53:22,959 INFO L793 eck$LassoCheckResult]: Loop: 5#L19-3true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 8#L20-2true assume !(main_~j~0 < main_~n~0); 6#L19-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 5#L19-3true [2019-11-15 22:53:22,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:22,966 INFO L82 PathProgramCache]: Analyzing trace with hash 959370, now seen corresponding path program 1 times [2019-11-15 22:53:22,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:22,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805080963] [2019-11-15 22:53:22,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:22,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:22,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:23,122 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:23,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:23,124 INFO L82 PathProgramCache]: Analyzing trace with hash 50890, now seen corresponding path program 1 times [2019-11-15 22:53:23,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:23,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136520185] [2019-11-15 22:53:23,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:23,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:23,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:23,167 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158303, now seen corresponding path program 1 times [2019-11-15 22:53:23,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:23,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102307397] [2019-11-15 22:53:23,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:23,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:23,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:23,251 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-15 22:53:23,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102307397] [2019-11-15 22:53:23,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:23,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:53:23,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300279802] [2019-11-15 22:53:23,332 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:23,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:23,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:23,333 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:23,334 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:53:23,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:23,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:23,334 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:23,334 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration1_Loop [2019-11-15 22:53:23,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:23,335 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:23,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:23,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:23,472 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:23,473 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:23,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:23,481 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/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-15 22:53:23,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:53:23,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:53:23,849 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:53:23,852 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:23,852 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:23,852 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:23,852 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:23,853 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:23,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:23,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:23,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:23,853 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration1_Loop [2019-11-15 22:53:23,853 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:23,853 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:23,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:23,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:24,065 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 22:53:24,088 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:24,094 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:53:24,097 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-15 22:53:24,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:24,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:24,100 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:24,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:24,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:24,123 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:24,123 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:24,147 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:53:24,167 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:53:24,167 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:53:24,170 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:53:24,170 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:53:24,171 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:53:24,172 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 22:53:24,176 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:53:24,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:24,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:24,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:24,248 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:24,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:24,275 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-15 22:53:24,302 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:53:24,303 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-11-15 22:53:24,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 63 states and 90 transitions. Complement of second has 7 states. [2019-11-15 22:53:24,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:53:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2019-11-15 22:53:24,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-15 22:53:24,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:24,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 22:53:24,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:24,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-15 22:53:24,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:24,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 90 transitions. [2019-11-15 22:53:24,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 22:53:24,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 26 states and 33 transitions. [2019-11-15 22:53:24,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:53:24,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 22:53:24,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-11-15 22:53:24,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:24,417 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 22:53:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-11-15 22:53:24,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-15 22:53:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 22:53:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-11-15 22:53:24,452 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-15 22:53:24,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:53:24,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:53:24,458 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2019-11-15 22:53:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:24,540 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-11-15 22:53:24,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:53:24,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-11-15 22:53:24,544 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-15 22:53:24,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2019-11-15 22:53:24,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-15 22:53:24,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 22:53:24,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-11-15 22:53:24,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:24,548 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-15 22:53:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-11-15 22:53:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2019-11-15 22:53:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 22:53:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-15 22:53:24,553 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 22:53:24,553 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 22:53:24,553 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:53:24,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2019-11-15 22:53:24,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 22:53:24,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:24,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:24,556 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:53:24,556 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:53:24,557 INFO L791 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 231#L14 assume !!(main_~n~0 < 1000000); 208#L15 assume main_~k~0 == main_~n~0; 209#L15-1 main_~i~0 := 0; 210#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 212#L20-2 [2019-11-15 22:53:24,557 INFO L793 eck$LassoCheckResult]: Loop: 212#L20-2 assume !!(main_~j~0 < main_~n~0); 218#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 222#L22-2 assume !(main_~k~0 < main_~n~0); 216#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 212#L20-2 [2019-11-15 22:53:24,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:24,557 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 1 times [2019-11-15 22:53:24,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:24,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965237343] [2019-11-15 22:53:24,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:24,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:24,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:24,571 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1819467, now seen corresponding path program 1 times [2019-11-15 22:53:24,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:24,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485358433] [2019-11-15 22:53:24,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:24,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:24,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:24,597 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-15 22:53:24,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485358433] [2019-11-15 22:53:24,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:24,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:24,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810575382] [2019-11-15 22:53:24,599 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:53:24,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:24,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:53:24,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:53:24,600 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-15 22:53:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:24,653 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-15 22:53:24,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:53:24,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-11-15 22:53:24,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 22:53:24,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2019-11-15 22:53:24,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 22:53:24,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 22:53:24,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-11-15 22:53:24,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:24,657 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 22:53:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-11-15 22:53:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-15 22:53:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 22:53:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-15 22:53:24,662 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 22:53:24,662 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 22:53:24,662 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:53:24,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2019-11-15 22:53:24,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 22:53:24,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:24,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:24,670 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:53:24,670 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:53:24,670 INFO L791 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 294#L14 assume !!(main_~n~0 < 1000000); 271#L15 assume main_~k~0 == main_~n~0; 272#L15-1 main_~i~0 := 0; 273#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 275#L20-2 [2019-11-15 22:53:24,672 INFO L793 eck$LassoCheckResult]: Loop: 275#L20-2 assume !!(main_~j~0 < main_~n~0); 281#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 291#L4-3 assume !(0 == __VERIFIER_assert_~cond); 289#L4-5 __VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 283#L4-6 assume !(0 == __VERIFIER_assert_~cond); 279#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 275#L20-2 [2019-11-15 22:53:24,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:24,674 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 2 times [2019-11-15 22:53:24,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:24,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501360613] [2019-11-15 22:53:24,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:24,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:24,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:24,696 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:24,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 1 times [2019-11-15 22:53:24,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:24,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950438516] [2019-11-15 22:53:24,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:24,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:24,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:24,745 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:24,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1589140493, now seen corresponding path program 1 times [2019-11-15 22:53:24,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:24,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112330653] [2019-11-15 22:53:24,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:24,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:24,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:24,790 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:24,885 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:24,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:24,885 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:24,885 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:24,885 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:53:24,885 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:24,885 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:24,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:24,886 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration3_Loop [2019-11-15 22:53:24,886 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:24,886 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:24,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:24,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:24,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:24,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:25,012 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:25,012 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:53:25,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:25,021 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/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-15 22:53:25,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:53:25,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:53:25,495 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:53:25,498 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:25,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:25,499 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:25,499 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:25,499 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:25,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:25,499 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:25,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:25,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration3_Loop [2019-11-15 22:53:25,500 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:25,500 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:25,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:25,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:25,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:25,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:25,625 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:25,625 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:53:25,626 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-15 22:53:25,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:25,627 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:25,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:25,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:25,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:25,628 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:25,628 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:25,642 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:53:25,658 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:53:25,658 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:53:25,660 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:53:25,660 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:53:25,660 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:53:25,660 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-15 22:53:25,661 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:53:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:25,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:25,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:25,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:25,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:25,730 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-15 22:53:25,731 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:53:25,731 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 22:53:25,785 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 71 states and 90 transitions. Complement of second has 7 states. [2019-11-15 22:53:25,787 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-15 22:53:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-15 22:53:25,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-15 22:53:25,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:25,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2019-11-15 22:53:25,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:25,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 12 letters. [2019-11-15 22:53:25,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:25,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 90 transitions. [2019-11-15 22:53:25,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-15 22:53:25,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 56 states and 71 transitions. [2019-11-15 22:53:25,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:53:25,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-15 22:53:25,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 71 transitions. [2019-11-15 22:53:25,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:25,808 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2019-11-15 22:53:25,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 71 transitions. [2019-11-15 22:53:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-11-15 22:53:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 22:53:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-11-15 22:53:25,816 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-11-15 22:53:25,817 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-11-15 22:53:25,817 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:53:25,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 54 transitions. [2019-11-15 22:53:25,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-15 22:53:25,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:25,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:25,827 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:25,827 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:25,828 INFO L791 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 451#L14 assume !!(main_~n~0 < 1000000); 427#L15 assume main_~k~0 == main_~n~0; 428#L15-1 main_~i~0 := 0; 429#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 431#L20-2 assume !!(main_~j~0 < main_~n~0); 439#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 443#L22-2 [2019-11-15 22:53:25,828 INFO L793 eck$LassoCheckResult]: Loop: 443#L22-2 assume !!(main_~k~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 444#L4 assume !(0 == __VERIFIER_assert_~cond); 453#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 443#L22-2 [2019-11-15 22:53:25,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:25,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158290, now seen corresponding path program 1 times [2019-11-15 22:53:25,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:25,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113564862] [2019-11-15 22:53:25,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:25,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:25,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:25,847 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:25,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:25,848 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 1 times [2019-11-15 22:53:25,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:25,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546623661] [2019-11-15 22:53:25,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:25,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:25,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:25,901 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:25,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:25,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2128734878, now seen corresponding path program 1 times [2019-11-15 22:53:25,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:25,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671336914] [2019-11-15 22:53:25,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:25,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:25,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:25,928 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:25,974 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:25,974 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:25,974 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:25,975 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:25,975 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:53:25,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:25,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:25,975 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:25,975 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration4_Loop [2019-11-15 22:53:25,976 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:25,976 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:25,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:25,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:26,117 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:26,117 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:53:26,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:26,129 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:26,135 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:53:26,135 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:26,142 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:26,142 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:53:26,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:53:26,165 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:26,621 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:53:26,624 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:26,624 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:26,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:26,624 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:26,625 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:26,625 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:26,625 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:26,625 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:26,625 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration4_Loop [2019-11-15 22:53:26,625 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:26,625 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:26,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:26,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:26,764 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:26,765 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:53:26,765 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-15 22:53:26,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:26,766 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:26,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:26,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:26,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:26,767 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:26,768 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:26,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:26,769 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-15 22:53:26,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:26,770 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:26,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:26,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:26,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:26,778 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:26,779 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:26,801 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:53:26,812 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:53:26,812 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:53:26,812 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:53:26,812 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:53:26,813 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:53:26,813 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-15 22:53:26,813 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:53:26,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:26,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:26,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:26,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:26,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:26,881 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-15 22:53:26,881 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:53:26,881 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-15 22:53:26,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 132 states and 167 transitions. Complement of second has 7 states. [2019-11-15 22:53:26,949 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-15 22:53:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-15 22:53:26,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 22:53:26,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:26,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 22:53:26,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:26,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 22:53:26,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:26,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 167 transitions. [2019-11-15 22:53:26,954 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2019-11-15 22:53:26,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 97 states and 121 transitions. [2019-11-15 22:53:26,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-15 22:53:26,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-11-15 22:53:26,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 121 transitions. [2019-11-15 22:53:26,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:26,968 INFO L688 BuchiCegarLoop]: Abstraction has 97 states and 121 transitions. [2019-11-15 22:53:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 121 transitions. [2019-11-15 22:53:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2019-11-15 22:53:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-15 22:53:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2019-11-15 22:53:26,980 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-11-15 22:53:26,981 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-11-15 22:53:26,981 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:53:26,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2019-11-15 22:53:26,984 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-11-15 22:53:26,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:26,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:26,987 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:26,987 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:53:26,989 INFO L791 eck$LassoCheckResult]: Stem: 682#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 683#L14 assume !!(main_~n~0 < 1000000); 656#L15 assume main_~k~0 == main_~n~0; 657#L15-1 main_~i~0 := 0; 658#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 659#L20-2 assume !!(main_~j~0 < main_~n~0); 703#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 708#L4-3 assume !(0 == __VERIFIER_assert_~cond); 707#L4-5 __VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 706#L4-6 assume !(0 == __VERIFIER_assert_~cond); 705#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 699#L20-2 assume !(main_~j~0 < main_~n~0); 701#L19-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 698#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 697#L20-2 [2019-11-15 22:53:26,989 INFO L793 eck$LassoCheckResult]: Loop: 697#L20-2 assume !!(main_~j~0 < main_~n~0); 693#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 694#L4-3 assume !(0 == __VERIFIER_assert_~cond); 704#L4-5 __VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 702#L4-6 assume !(0 == __VERIFIER_assert_~cond); 700#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 697#L20-2 [2019-11-15 22:53:26,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:26,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1340048366, now seen corresponding path program 1 times [2019-11-15 22:53:26,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:26,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211778377] [2019-11-15 22:53:26,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:26,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:26,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:27,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211778377] [2019-11-15 22:53:27,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102134317] [2019-11-15 22:53:27,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:27,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:53:27,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:27,224 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:53:27,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-15 22:53:27,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265706426] [2019-11-15 22:53:27,225 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:27,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 2 times [2019-11-15 22:53:27,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:27,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595634018] [2019-11-15 22:53:27,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:27,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:27,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:27,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:27,337 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:27,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:27,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:27,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:27,338 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:53:27,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:27,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:27,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:27,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration5_Loop [2019-11-15 22:53:27,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:27,338 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:27,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:27,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:27,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:27,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:27,457 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:27,457 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:27,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:27,475 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/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-15 22:53:27,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:53:27,501 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-15 22:53:28,066 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:53:28,069 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:28,069 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:28,069 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:28,069 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:28,069 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:28,069 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:28,070 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:28,070 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:28,070 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration5_Loop [2019-11-15 22:53:28,070 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:28,070 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:28,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:28,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:28,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:28,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:28,182 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:28,182 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:53:28,183 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-15 22:53:28,184 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:28,184 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:28,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:28,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:28,184 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:28,185 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:28,185 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:28,198 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:53:28,205 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:53:28,209 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:53:28,209 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:53:28,210 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:53:28,210 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:53:28,210 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-15 22:53:28,211 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:53:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:28,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:28,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:28,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:28,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:28,285 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-15 22:53:28,286 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:53:28,286 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-11-15 22:53:28,335 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 123 states and 155 transitions. Complement of second has 7 states. [2019-11-15 22:53:28,338 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-15 22:53:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-15 22:53:28,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 22:53:28,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:28,339 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:53:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:28,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:28,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:28,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:28,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:28,401 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-15 22:53:28,401 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:53:28,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-11-15 22:53:28,477 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 123 states and 155 transitions. Complement of second has 7 states. [2019-11-15 22:53:28,479 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-15 22:53:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-15 22:53:28,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 22:53:28,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:28,480 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:53:28,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:28,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:28,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:28,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:28,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:28,543 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-15 22:53:28,543 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:53:28,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-11-15 22:53:28,594 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 123 states and 154 transitions. Complement of second has 6 states. [2019-11-15 22:53:28,595 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-15 22:53:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-11-15 22:53:28,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 22:53:28,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:28,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 20 letters. Loop has 6 letters. [2019-11-15 22:53:28,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:28,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 12 letters. [2019-11-15 22:53:28,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:28,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 154 transitions. [2019-11-15 22:53:28,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 22:53:28,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 74 states and 92 transitions. [2019-11-15 22:53:28,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 22:53:28,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 22:53:28,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 92 transitions. [2019-11-15 22:53:28,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:28,607 INFO L688 BuchiCegarLoop]: Abstraction has 74 states and 92 transitions. [2019-11-15 22:53:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 92 transitions. [2019-11-15 22:53:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2019-11-15 22:53:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-15 22:53:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2019-11-15 22:53:28,621 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-11-15 22:53:28,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:28,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:53:28,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:53:28,623 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 11 states. [2019-11-15 22:53:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:28,749 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2019-11-15 22:53:28,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:53:28,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 180 transitions. [2019-11-15 22:53:28,752 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 22:53:28,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 143 states and 176 transitions. [2019-11-15 22:53:28,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 22:53:28,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 22:53:28,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 176 transitions. [2019-11-15 22:53:28,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:53:28,755 INFO L688 BuchiCegarLoop]: Abstraction has 143 states and 176 transitions. [2019-11-15 22:53:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 176 transitions. [2019-11-15 22:53:28,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 60. [2019-11-15 22:53:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 22:53:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2019-11-15 22:53:28,760 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-11-15 22:53:28,760 INFO L591 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-11-15 22:53:28,760 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:53:28,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 75 transitions. [2019-11-15 22:53:28,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:53:28,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:28,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:28,762 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:28,762 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:53:28,762 INFO L791 eck$LassoCheckResult]: Stem: 1578#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 1579#L14 assume !!(main_~n~0 < 1000000); 1558#L15 assume main_~k~0 == main_~n~0; 1559#L15-1 main_~i~0 := 0; 1560#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1562#L20-2 assume !!(main_~j~0 < main_~n~0); 1569#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 1573#L22-2 assume !!(main_~k~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1574#L4 assume !(0 == __VERIFIER_assert_~cond); 1581#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1582#L22-2 assume !(main_~k~0 < main_~n~0); 1592#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1583#L20-2 assume !!(main_~j~0 < main_~n~0); 1576#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 1571#L22-2 [2019-11-15 22:53:28,762 INFO L793 eck$LassoCheckResult]: Loop: 1571#L22-2 assume !!(main_~k~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1572#L4 assume !(0 == __VERIFIER_assert_~cond); 1580#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1571#L22-2 [2019-11-15 22:53:28,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:28,763 INFO L82 PathProgramCache]: Analyzing trace with hash 279041640, now seen corresponding path program 1 times [2019-11-15 22:53:28,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:28,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498453750] [2019-11-15 22:53:28,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:28,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:28,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:28,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498453750] [2019-11-15 22:53:28,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667453942] [2019-11-15 22:53:28,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:53:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:28,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:53:28,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:28,879 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:53:28,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-15 22:53:28,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482420861] [2019-11-15 22:53:28,880 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 2 times [2019-11-15 22:53:28,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:28,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232613602] [2019-11-15 22:53:28,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:28,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:28,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:28,890 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:28,917 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:28,918 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:28,918 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:28,918 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:28,918 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:53:28,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:28,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:28,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:28,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration6_Loop [2019-11-15 22:53:28,918 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:28,919 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:28,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:28,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:29,016 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:29,017 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:29,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:29,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:53:29,037 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:53:29,037 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:29,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:29,056 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cf4d84f-0708-4d09-a0a2-d2163f1343cc/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:29,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:53:29,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:53:29,594 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:53:29,596 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:29,597 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:29,597 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:29,597 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:29,597 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:29,597 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:29,597 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:29,597 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:29,597 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration6_Loop [2019-11-15 22:53:29,597 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:29,597 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:29,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:29,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:29,677 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:29,678 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:53:29,678 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-15 22:53:29,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:29,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:29,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:29,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:29,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:29,680 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:29,680 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:29,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:29,682 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-15 22:53:29,682 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:29,683 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:29,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:29,683 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:29,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:29,684 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:29,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:29,689 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:53:29,708 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:53:29,708 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:53:29,709 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:53:29,709 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:53:29,709 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:53:29,710 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-15 22:53:29,711 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:53:29,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:29,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:29,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:29,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:29,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:29,771 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-15 22:53:29,771 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:53:29,771 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-11-15 22:53:29,808 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 115 states and 147 transitions. Complement of second has 7 states. [2019-11-15 22:53:29,808 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-15 22:53:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-15 22:53:29,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 22:53:29,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:29,809 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:53:29,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:29,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:29,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:29,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:29,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:29,850 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-15 22:53:29,850 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:53:29,850 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-11-15 22:53:29,887 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 115 states and 147 transitions. Complement of second has 7 states. [2019-11-15 22:53:29,887 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-15 22:53:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-15 22:53:29,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 22:53:29,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:29,888 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:53:29,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:29,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:29,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:29,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:53:29,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:29,930 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-15 22:53:29,931 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:53:29,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-11-15 22:53:29,967 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 94 states and 119 transitions. Complement of second has 6 states. [2019-11-15 22:53:29,968 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-15 22:53:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:53:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-11-15 22:53:29,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 22:53:29,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:29,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-15 22:53:29,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:29,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 22:53:29,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:29,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 119 transitions. [2019-11-15 22:53:29,972 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:53:29,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 0 states and 0 transitions. [2019-11-15 22:53:29,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:53:29,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:53:29,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:53:29,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:29,973 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:29,974 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:29,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:29,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:53:29,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:53:29,974 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2019-11-15 22:53:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:29,974 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 22:53:29,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:53:29,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 22:53:29,975 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:53:29,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:53:29,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:53:29,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:53:29,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:53:29,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:29,975 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:29,975 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:29,976 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:29,976 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:53:29,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:53:29,976 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:53:29,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:53:29,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:53:29 BoogieIcfgContainer [2019-11-15 22:53:29,982 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:53:29,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:53:29,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:53:29,983 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:53:29,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:53:22" (3/4) ... [2019-11-15 22:53:29,987 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:53:29,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:53:29,990 INFO L168 Benchmark]: Toolchain (without parser) took 8111.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -122.2 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:29,990 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:53:29,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:29,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.24 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-15 22:53:29,992 INFO L168 Benchmark]: Boogie Preprocessor took 26.48 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-15 22:53:29,993 INFO L168 Benchmark]: RCFGBuilder took 423.87 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: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:29,994 INFO L168 Benchmark]: BuchiAutomizer took 7246.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.2 MB). Peak memory consumption was 105.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:29,994 INFO L168 Benchmark]: Witness Printer took 5.60 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-15 22:53:29,998 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.24 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 26.48 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 423.87 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: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7246.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.2 MB). Peak memory consumption was 105.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.60 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (4 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * j + n and consists of 4 locations. One deterministic module has affine ranking function -1 * k + n and consists of 4 locations. One nondeterministic module has affine ranking function n + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function -1 * k + n and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 173 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 189 SDtfs, 349 SDslu, 123 SDs, 0 SdLazy, 297 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf98 lsp85 ukn100 mio100 lsp100 div100 bol100 ite114 ukn100 eq152 hnf93 smp83 dnf98 smp100 tf107 neg99 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 75ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...