./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/nested6.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/nested6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9224d4a04faa6242dd3ed0329b76a8b0c73c93d0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 02:07:52,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 02:07:52,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 02:07:52,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 02:07:52,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 02:07:52,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 02:07:52,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 02:07:52,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 02:07:52,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 02:07:52,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 02:07:52,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 02:07:52,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 02:07:52,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 02:07:52,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 02:07:52,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 02:07:52,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 02:07:52,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 02:07:52,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 02:07:52,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 02:07:52,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 02:07:52,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 02:07:52,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 02:07:52,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 02:07:52,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 02:07:52,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 02:07:52,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 02:07:52,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 02:07:52,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 02:07:52,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 02:07:52,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 02:07:52,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 02:07:52,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 02:07:52,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 02:07:52,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 02:07:52,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 02:07:52,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 02:07:52,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 02:07:52,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 02:07:52,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 02:07:52,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 02:07:52,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 02:07:52,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 02:07:52,776 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 02:07:52,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 02:07:52,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 02:07:52,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 02:07:52,780 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 02:07:52,780 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 02:07:52,780 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 02:07:52,780 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 02:07:52,781 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 02:07:52,781 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 02:07:52,781 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 02:07:52,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 02:07:52,781 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 02:07:52,782 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 02:07:52,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 02:07:52,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 02:07:52,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 02:07:52,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 02:07:52,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 02:07:52,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 02:07:52,784 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 02:07:52,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 02:07:52,784 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 02:07:52,784 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 02:07:52,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 02:07:52,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 02:07:52,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 02:07:52,785 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 02:07:52,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 02:07:52,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 02:07:52,786 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 02:07:52,786 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 02:07:52,787 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 02:07:52,788 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 9224d4a04faa6242dd3ed0329b76a8b0c73c93d0 [2020-07-29 02:07:53,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 02:07:53,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 02:07:53,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 02:07:53,113 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 02:07:53,114 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 02:07:53,114 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/nested6.i [2020-07-29 02:07:53,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31fad1c2e/5a4db6e9b6204514a04d195d4de2993c/FLAG1e2129f6e [2020-07-29 02:07:53,607 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 02:07:53,608 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested6.i [2020-07-29 02:07:53,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31fad1c2e/5a4db6e9b6204514a04d195d4de2993c/FLAG1e2129f6e [2020-07-29 02:07:53,996 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31fad1c2e/5a4db6e9b6204514a04d195d4de2993c [2020-07-29 02:07:53,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 02:07:54,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 02:07:54,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 02:07:54,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 02:07:54,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 02:07:54,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:07:53" (1/1) ... [2020-07-29 02:07:54,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777df8f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54, skipping insertion in model container [2020-07-29 02:07:54,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:07:53" (1/1) ... [2020-07-29 02:07:54,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 02:07:54,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 02:07:54,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:07:54,291 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 02:07:54,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:07:54,334 INFO L208 MainTranslator]: Completed translation [2020-07-29 02:07:54,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54 WrapperNode [2020-07-29 02:07:54,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 02:07:54,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 02:07:54,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 02:07:54,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 02:07:54,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54" (1/1) ... [2020-07-29 02:07:54,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54" (1/1) ... [2020-07-29 02:07:54,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 02:07:54,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 02:07:54,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 02:07:54,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 02:07:54,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54" (1/1) ... [2020-07-29 02:07:54,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54" (1/1) ... [2020-07-29 02:07:54,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54" (1/1) ... [2020-07-29 02:07:54,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54" (1/1) ... [2020-07-29 02:07:54,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54" (1/1) ... [2020-07-29 02:07:54,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54" (1/1) ... [2020-07-29 02:07:54,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54" (1/1) ... [2020-07-29 02:07:54,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 02:07:54,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 02:07:54,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 02:07:54,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 02:07:54,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 02:07:54,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 02:07:54,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 02:07:54,894 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 02:07:54,894 INFO L295 CfgBuilder]: Removed 13 assume(true) statements. [2020-07-29 02:07:54,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:07:54 BoogieIcfgContainer [2020-07-29 02:07:54,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 02:07:54,899 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 02:07:54,899 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 02:07:54,903 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 02:07:54,904 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:07:54,905 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 02:07:53" (1/3) ... [2020-07-29 02:07:54,906 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9a5cb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:07:54, skipping insertion in model container [2020-07-29 02:07:54,906 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:07:54,906 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:54" (2/3) ... [2020-07-29 02:07:54,907 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9a5cb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:07:54, skipping insertion in model container [2020-07-29 02:07:54,907 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:07:54,907 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:07:54" (3/3) ... [2020-07-29 02:07:54,909 INFO L371 chiAutomizerObserver]: Analyzing ICFG nested6.i [2020-07-29 02:07:54,954 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 02:07:54,954 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 02:07:54,954 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 02:07:54,954 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 02:07:54,955 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 02:07:54,955 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 02:07:54,955 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 02:07:54,955 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 02:07:54,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-07-29 02:07:54,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 02:07:54,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:54,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:54,996 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 02:07:54,997 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:07:54,997 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 02:07:54,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-07-29 02:07:55,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 02:07:55,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:55,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:55,002 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 02:07:55,002 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:07:55,009 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 5#L17true assume !!(main_~n~0 < 1000000); 9#L18true assume main_~k~0 == main_~n~0; 6#L18-1true main_~i~0 := 0; 11#L22-3true [2020-07-29 02:07:55,010 INFO L796 eck$LassoCheckResult]: Loop: 11#L22-3true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 14#L23-2true assume !(main_~j~0 < main_~n~0); 12#L22-2true main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 11#L22-3true [2020-07-29 02:07:55,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:55,014 INFO L82 PathProgramCache]: Analyzing trace with hash 959370, now seen corresponding path program 1 times [2020-07-29 02:07:55,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:55,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383027010] [2020-07-29 02:07:55,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:55,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:55,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:55,103 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:55,104 INFO L82 PathProgramCache]: Analyzing trace with hash 50890, now seen corresponding path program 1 times [2020-07-29 02:07:55,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:55,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608164155] [2020-07-29 02:07:55,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:55,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:55,125 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:55,128 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:55,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158303, now seen corresponding path program 1 times [2020-07-29 02:07:55,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:55,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142779334] [2020-07-29 02:07:55,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:55,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {30#true} is VALID [2020-07-29 02:07:55,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume !!(main_~n~0 < 1000000); {30#true} is VALID [2020-07-29 02:07:55,233 INFO L280 TraceCheckUtils]: 2: Hoare triple {30#true} assume main_~k~0 == main_~n~0; {30#true} is VALID [2020-07-29 02:07:55,234 INFO L280 TraceCheckUtils]: 3: Hoare triple {30#true} main_~i~0 := 0; {32#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 02:07:55,236 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {33#(<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 02:07:55,239 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#(<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)} assume !(main_~j~0 < main_~n~0); {31#false} is VALID [2020-07-29 02:07:55,239 INFO L280 TraceCheckUtils]: 6: Hoare triple {31#false} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {31#false} is VALID [2020-07-29 02:07:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:55,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142779334] [2020-07-29 02:07:55,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:07:55,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 02:07:55,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753960598] [2020-07-29 02:07:55,297 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:55,298 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:55,298 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:55,299 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:55,299 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:07:55,299 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:55,299 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:55,299 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:55,300 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration1_Loop [2020-07-29 02:07:55,300 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:55,300 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:55,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:55,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:55,455 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:55,456 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:55,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:55,463 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:55,506 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:55,506 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:07:55,834 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:07:55,837 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:55,837 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:55,837 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:55,838 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:55,838 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:07:55,838 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:55,838 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:55,838 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:55,838 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration1_Loop [2020-07-29 02:07:55,838 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:55,839 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:55,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:55,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:55,963 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:55,968 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:55,985 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 [2020-07-29 02:07:55,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:07:55,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:07:55,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:07:55,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:07:55,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:07:56,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:07:56,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:07:56,009 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:07:56,023 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 02:07:56,023 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:56,031 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:07:56,031 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:07:56,032 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:07:56,033 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 [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:56,063 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:07:56,067 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0;" "assume !(main_~j~0 < main_~n~0);" "main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2;" [2020-07-29 02:07:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:56,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:56,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:07:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:56,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:56,130 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {34#unseeded} is VALID [2020-07-29 02:07:56,131 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#unseeded} assume !!(main_~n~0 < 1000000); {34#unseeded} is VALID [2020-07-29 02:07:56,132 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#unseeded} assume main_~k~0 == main_~n~0; {34#unseeded} is VALID [2020-07-29 02:07:56,134 INFO L280 TraceCheckUtils]: 3: Hoare triple {34#unseeded} main_~i~0 := 0; {34#unseeded} is VALID [2020-07-29 02:07:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:56,141 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:07:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:56,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:56,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {61#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:07:56,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {61#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} assume !(main_~j~0 < main_~n~0); {61#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:07:56,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {61#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {47#(or (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:07:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:56,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:07:56,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:07:56,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:56,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,208 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 [2020-07-29 02:07:56,210 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2020-07-29 02:07:56,359 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 63 states and 90 transitions. Complement of second has 7 states. [2020-07-29 02:07:56,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:07:56,360 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:56,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2020-07-29 02:07:56,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 02:07:56,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:56,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:56,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:07:56,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 02:07:56,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:56,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:56,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 90 transitions. [2020-07-29 02:07:56,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 02:07:56,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:56,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:56,377 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states. [2020-07-29 02:07:56,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 02:07:56,387 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 02:07:56,387 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:07:56,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 02:07:56,395 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:07:56,395 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 63 states and 90 transitions. cyclomatic complexity: 30 [2020-07-29 02:07:56,400 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 02:07:56,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:56,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:56,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:56,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:56,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:56,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:56,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:56,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:56,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:56,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 63 letters. Loop has 63 letters. [2020-07-29 02:07:56,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 63 letters. [2020-07-29 02:07:56,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 63 letters. Loop has 63 letters. [2020-07-29 02:07:56,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 02:07:56,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 02:07:56,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 22 letters. Loop has 22 letters. [2020-07-29 02:07:56,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:07:56,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:07:56,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:07:56,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:56,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:56,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:56,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 02:07:56,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 02:07:56,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 10 letters. Loop has 7 letters. [2020-07-29 02:07:56,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:56,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:56,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:56,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 02:07:56,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 7 letters. [2020-07-29 02:07:56,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 7 letters. [2020-07-29 02:07:56,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:07:56,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:07:56,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:07:56,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:56,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:56,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:56,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:56,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:56,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:56,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:07:56,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:07:56,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:07:56,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:56,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:56,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:56,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 02:07:56,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 02:07:56,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 6 letters. [2020-07-29 02:07:56,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:56,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:56,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:56,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 02:07:56,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 02:07:56,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 6 letters. [2020-07-29 02:07:56,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:56,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:56,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:56,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 7 letters. Loop has 6 letters. [2020-07-29 02:07:56,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 6 letters. [2020-07-29 02:07:56,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 7 letters. Loop has 6 letters. [2020-07-29 02:07:56,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:56,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:56,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:56,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:56,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:56,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:56,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:56,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:56,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:56,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 02:07:56,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 02:07:56,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 6 letters. [2020-07-29 02:07:56,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:56,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:56,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:56,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:07:56,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:07:56,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:07:56,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:56,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:56,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:56,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 02:07:56,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 02:07:56,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 6 letters. [2020-07-29 02:07:56,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:56,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:56,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:56,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 7 letters. Loop has 6 letters. [2020-07-29 02:07:56,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 6 letters. [2020-07-29 02:07:56,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 7 letters. Loop has 6 letters. [2020-07-29 02:07:56,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:07:56,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:07:56,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 90 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:07:56,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,466 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:07:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2020-07-29 02:07:56,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:56,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:56,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 02:07:56,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:56,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 90 transitions. cyclomatic complexity: 30 [2020-07-29 02:07:56,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 02:07:56,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 26 states and 33 transitions. [2020-07-29 02:07:56,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 02:07:56,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 02:07:56,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-07-29 02:07:56,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:07:56,486 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 02:07:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-07-29 02:07:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-29 02:07:56,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:07:56,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 33 transitions. Second operand 25 states. [2020-07-29 02:07:56,513 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 33 transitions. Second operand 25 states. [2020-07-29 02:07:56,515 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 25 states. [2020-07-29 02:07:56,518 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:07:56,521 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-29 02:07:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-29 02:07:56,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:56,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:56,523 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states and 33 transitions. [2020-07-29 02:07:56,523 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states and 33 transitions. [2020-07-29 02:07:56,524 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:07:56,526 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 02:07:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-29 02:07:56,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:56,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:56,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:07:56,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:07:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 02:07:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-07-29 02:07:56,530 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-07-29 02:07:56,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:07:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 02:07:56,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 02:07:56,534 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2020-07-29 02:07:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:07:56,652 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2020-07-29 02:07:56,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 02:07:56,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:07:56,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:07:56,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2020-07-29 02:07:56,666 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-07-29 02:07:56,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2020-07-29 02:07:56,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 02:07:56,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 02:07:56,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2020-07-29 02:07:56,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:07:56,669 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2020-07-29 02:07:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2020-07-29 02:07:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2020-07-29 02:07:56,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:07:56,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states and 58 transitions. Second operand 26 states. [2020-07-29 02:07:56,672 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states and 58 transitions. Second operand 26 states. [2020-07-29 02:07:56,672 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 26 states. [2020-07-29 02:07:56,673 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:07:56,676 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2020-07-29 02:07:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2020-07-29 02:07:56,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:56,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:56,677 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 46 states and 58 transitions. [2020-07-29 02:07:56,677 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 46 states and 58 transitions. [2020-07-29 02:07:56,677 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:07:56,681 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2020-07-29 02:07:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2020-07-29 02:07:56,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:56,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:56,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:07:56,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:07:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 02:07:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-07-29 02:07:56,683 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 02:07:56,683 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 02:07:56,684 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 02:07:56,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2020-07-29 02:07:56,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 02:07:56,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:56,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:56,685 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 02:07:56,685 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:07:56,686 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 320#L17 assume !!(main_~n~0 < 1000000); 321#L18 assume main_~k~0 == main_~n~0; 322#L18-1 main_~i~0 := 0; 323#L22-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 327#L23-2 [2020-07-29 02:07:56,686 INFO L796 eck$LassoCheckResult]: Loop: 327#L23-2 assume !!(main_~j~0 < main_~n~0); 333#L24 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; 317#L25-2 assume !(main_~k~0 < main_~n~0); 331#L7-8 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 327#L23-2 [2020-07-29 02:07:56,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:56,686 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 1 times [2020-07-29 02:07:56,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:56,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990843609] [2020-07-29 02:07:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:56,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:56,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:56,700 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:56,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:56,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1819467, now seen corresponding path program 1 times [2020-07-29 02:07:56,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:56,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542005803] [2020-07-29 02:07:56,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:56,737 INFO L280 TraceCheckUtils]: 0: Hoare triple {497#true} assume !!(main_~j~0 < main_~n~0); {499#(<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 02:07:56,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {499#(<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)} assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; {500#(<= (+ ULTIMATE.start_main_~k~0 1) ULTIMATE.start_main_~n~0)} is VALID [2020-07-29 02:07:56,739 INFO L280 TraceCheckUtils]: 2: Hoare triple {500#(<= (+ ULTIMATE.start_main_~k~0 1) ULTIMATE.start_main_~n~0)} assume !(main_~k~0 < main_~n~0); {498#false} is VALID [2020-07-29 02:07:56,739 INFO L280 TraceCheckUtils]: 3: Hoare triple {498#false} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {498#false} is VALID [2020-07-29 02:07:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:56,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542005803] [2020-07-29 02:07:56,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:07:56,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 02:07:56,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179431604] [2020-07-29 02:07:56,741 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 02:07:56,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:07:56,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 02:07:56,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 02:07:56,742 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 02:07:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:07:56,833 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-29 02:07:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 02:07:56,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:07:56,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:07:56,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-07-29 02:07:56,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 02:07:56,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2020-07-29 02:07:56,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 02:07:56,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 02:07:56,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2020-07-29 02:07:56,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:07:56,843 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-29 02:07:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2020-07-29 02:07:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-29 02:07:56,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:07:56,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 35 transitions. Second operand 28 states. [2020-07-29 02:07:56,846 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 35 transitions. Second operand 28 states. [2020-07-29 02:07:56,846 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 28 states. [2020-07-29 02:07:56,846 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:07:56,848 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-29 02:07:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2020-07-29 02:07:56,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:56,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:56,849 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states and 35 transitions. [2020-07-29 02:07:56,849 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states and 35 transitions. [2020-07-29 02:07:56,850 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:07:56,852 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-29 02:07:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2020-07-29 02:07:56,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:56,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:56,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:07:56,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:07:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 02:07:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-29 02:07:56,855 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-29 02:07:56,855 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-29 02:07:56,855 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 02:07:56,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2020-07-29 02:07:56,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 02:07:56,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:56,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:56,856 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 02:07:56,856 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 02:07:56,857 INFO L794 eck$LassoCheckResult]: Stem: 550#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 535#L17 assume !!(main_~n~0 < 1000000); 536#L18 assume main_~k~0 == main_~n~0; 537#L18-1 main_~i~0 := 0; 538#L22-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 542#L23-2 [2020-07-29 02:07:56,857 INFO L796 eck$LassoCheckResult]: Loop: 542#L23-2 assume !!(main_~j~0 < main_~n~0); 548#L24 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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; 557#L7-3 assume !(0 == __VERIFIER_assert_~cond); 555#L7-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; 551#L7-6 assume !(0 == __VERIFIER_assert_~cond); 546#L7-8 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 542#L23-2 [2020-07-29 02:07:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 2 times [2020-07-29 02:07:56,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:56,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065761753] [2020-07-29 02:07:56,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:56,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:56,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:56,869 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:56,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:56,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 1 times [2020-07-29 02:07:56,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:56,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836778029] [2020-07-29 02:07:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:56,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:56,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:56,898 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:56,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:56,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1589140493, now seen corresponding path program 1 times [2020-07-29 02:07:56,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:56,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398753032] [2020-07-29 02:07:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:56,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:56,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:56,948 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:57,057 INFO L342 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-07-29 02:07:57,058 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 02:07:57,112 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:57,113 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:57,113 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:57,113 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:57,113 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:07:57,113 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:57,114 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:57,114 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:57,114 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration3_Loop [2020-07-29 02:07:57,114 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:57,114 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:57,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:57,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:57,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:57,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:57,297 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:57,299 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:57,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:57,303 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:57,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:07:57,355 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:57,658 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:07:57,661 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:57,661 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:57,661 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:57,661 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:57,661 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:07:57,661 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:57,661 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:57,661 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:57,661 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration3_Loop [2020-07-29 02:07:57,661 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:57,661 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:57,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:57,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:57,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:57,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:57,830 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:57,830 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:57,835 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 [2020-07-29 02:07:57,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:07:57,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:07:57,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:07:57,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:07:57,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:07:57,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:07:57,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:07:57,842 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:07:57,853 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 02:07:57,853 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:57,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:07:57,857 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:07:57,857 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:07:57,858 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 [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:57,889 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:07:57,893 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 < main_~n~0);" "assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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;" "assume !(0 == __VERIFIER_assert_~cond);" "__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;" "assume !(0 == __VERIFIER_assert_~cond);" "main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3;" [2020-07-29 02:07:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:57,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:07:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:57,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:57,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {676#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {676#unseeded} is VALID [2020-07-29 02:07:57,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {676#unseeded} assume !!(main_~n~0 < 1000000); {676#unseeded} is VALID [2020-07-29 02:07:57,931 INFO L280 TraceCheckUtils]: 2: Hoare triple {676#unseeded} assume main_~k~0 == main_~n~0; {676#unseeded} is VALID [2020-07-29 02:07:57,932 INFO L280 TraceCheckUtils]: 3: Hoare triple {676#unseeded} main_~i~0 := 0; {676#unseeded} is VALID [2020-07-29 02:07:57,933 INFO L280 TraceCheckUtils]: 4: Hoare triple {676#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {676#unseeded} is VALID [2020-07-29 02:07:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:57,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:07:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:57,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:57,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {679#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~n~0))} assume !!(main_~j~0 < main_~n~0); {706#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:07:57,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {706#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:07:57,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {706#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {706#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:07:57,980 INFO L280 TraceCheckUtils]: 3: Hoare triple {706#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} __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#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:07:57,981 INFO L280 TraceCheckUtils]: 4: Hoare triple {706#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {706#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:07:57,982 INFO L280 TraceCheckUtils]: 5: Hoare triple {706#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {689#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~n~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:07:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:57,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:07:57,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:07:57,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 6 letters. [2020-07-29 02:07:57,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:57,993 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 [2020-07-29 02:07:57,993 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 02:07:58,143 INFO L75 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. [2020-07-29 02:07:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:07:58,143 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:58,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. cyclomatic complexity: 9 [2020-07-29 02:07:58,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:58,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:58,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:07:58,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:07:58,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:58,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:58,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 90 transitions. [2020-07-29 02:07:58,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-07-29 02:07:58,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:58,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:58,150 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 35 transitions. cyclomatic complexity: 9 [2020-07-29 02:07:58,153 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 02:07:58,156 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:07:58,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:07:58,160 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:07:58,160 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 71 states and 90 transitions. cyclomatic complexity: 25 [2020-07-29 02:07:58,163 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 02:07:58,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 6 letters. [2020-07-29 02:07:58,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 6 letters. [2020-07-29 02:07:58,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 6 letters. [2020-07-29 02:07:58,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:58,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:58,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:58,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:58,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:58,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:58,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 71 letters. Loop has 71 letters. [2020-07-29 02:07:58,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 71 letters. [2020-07-29 02:07:58,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 71 letters. Loop has 71 letters. [2020-07-29 02:07:58,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 28 letters. Loop has 28 letters. [2020-07-29 02:07:58,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 02:07:58,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 28 letters. Loop has 28 letters. [2020-07-29 02:07:58,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:07:58,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:07:58,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:07:58,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 6 letters. [2020-07-29 02:07:58,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 02:07:58,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 6 letters. [2020-07-29 02:07:58,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:58,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:58,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:58,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2020-07-29 02:07:58,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 02:07:58,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 02:07:58,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 6 letters. [2020-07-29 02:07:58,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 02:07:58,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 6 letters. [2020-07-29 02:07:58,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 6 letters. [2020-07-29 02:07:58,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 02:07:58,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 6 letters. [2020-07-29 02:07:58,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 7 letters. [2020-07-29 02:07:58,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 02:07:58,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 7 letters. [2020-07-29 02:07:58,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:58,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:58,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:58,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 6 letters. [2020-07-29 02:07:58,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 6 letters. [2020-07-29 02:07:58,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 6 letters. [2020-07-29 02:07:58,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 6 letters. [2020-07-29 02:07:58,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 6 letters. [2020-07-29 02:07:58,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 6 letters. [2020-07-29 02:07:58,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 6 letters. [2020-07-29 02:07:58,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 6 letters. [2020-07-29 02:07:58,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 6 letters. [2020-07-29 02:07:58,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:58,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:58,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:58,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2020-07-29 02:07:58,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 02:07:58,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 02:07:58,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:58,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:58,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:58,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:58,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:58,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:58,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:07:58,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:07:58,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:07:58,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:07:58,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:07:58,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:07:58,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:07:58,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:07:58,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:07:58,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 7 letters. [2020-07-29 02:07:58,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 7 letters. [2020-07-29 02:07:58,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 7 letters. [2020-07-29 02:07:58,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:07:58,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:07:58,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:07:58,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2020-07-29 02:07:58,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 02:07:58,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 3 letters. [2020-07-29 02:07:58,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:07:58,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:07:58,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:07:58,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:07:58,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:07:58,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:07:58,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:07:58,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:07:58,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:07:58,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:07:58,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:07:58,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 90 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:07:58,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,201 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:07:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 02:07:58,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 6 letters. [2020-07-29 02:07:58,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2020-07-29 02:07:58,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 12 letters. [2020-07-29 02:07:58,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 90 transitions. cyclomatic complexity: 25 [2020-07-29 02:07:58,206 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-07-29 02:07:58,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 56 states and 71 transitions. [2020-07-29 02:07:58,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 02:07:58,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-07-29 02:07:58,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 71 transitions. [2020-07-29 02:07:58,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:07:58,209 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2020-07-29 02:07:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 71 transitions. [2020-07-29 02:07:58,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2020-07-29 02:07:58,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:07:58,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states and 71 transitions. Second operand 43 states. [2020-07-29 02:07:58,213 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states and 71 transitions. Second operand 43 states. [2020-07-29 02:07:58,213 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand 43 states. [2020-07-29 02:07:58,214 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:07:58,218 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2020-07-29 02:07:58,218 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2020-07-29 02:07:58,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:58,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:58,219 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 56 states and 71 transitions. [2020-07-29 02:07:58,219 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 56 states and 71 transitions. [2020-07-29 02:07:58,220 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:07:58,223 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2020-07-29 02:07:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2020-07-29 02:07:58,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:58,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:58,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:07:58,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:07:58,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 02:07:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2020-07-29 02:07:58,226 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2020-07-29 02:07:58,226 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2020-07-29 02:07:58,227 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 02:07:58,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 54 transitions. [2020-07-29 02:07:58,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-07-29 02:07:58,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:58,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:58,229 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:07:58,229 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:07:58,229 INFO L794 eck$LassoCheckResult]: Stem: 823#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 807#L17 assume !!(main_~n~0 < 1000000); 808#L18 assume main_~k~0 == main_~n~0; 809#L18-1 main_~i~0 := 0; 810#L22-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 814#L23-2 assume !!(main_~j~0 < main_~n~0); 829#L24 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; 804#L25-2 [2020-07-29 02:07:58,229 INFO L796 eck$LassoCheckResult]: Loop: 804#L25-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; 811#L7 assume !(0 == __VERIFIER_assert_~cond); 803#L7-2 main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; 804#L25-2 [2020-07-29 02:07:58,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:58,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158290, now seen corresponding path program 1 times [2020-07-29 02:07:58,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:58,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581238438] [2020-07-29 02:07:58,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:58,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:58,241 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:58,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:58,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:58,244 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 1 times [2020-07-29 02:07:58,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:58,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098105295] [2020-07-29 02:07:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:58,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:58,269 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:58,271 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:58,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2128734878, now seen corresponding path program 1 times [2020-07-29 02:07:58,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:58,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789868145] [2020-07-29 02:07:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:58,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:58,304 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:58,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:58,374 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:58,375 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:58,375 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:58,375 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:58,375 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:07:58,375 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:58,375 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:58,376 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:58,376 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration4_Loop [2020-07-29 02:07:58,376 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:58,376 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:58,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:58,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:58,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:58,479 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:58,479 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:58,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:58,483 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:58,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:07:58,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:07:58,701 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:07:58,703 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:58,703 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:58,703 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:58,703 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:58,703 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:07:58,704 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:58,704 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:58,704 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:58,704 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration4_Loop [2020-07-29 02:07:58,704 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:58,704 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:58,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:58,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:58,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:58,820 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:58,820 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:58,829 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 [2020-07-29 02:07:58,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:07:58,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:07:58,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:07:58,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:07:58,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:07:58,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:07:58,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:58,838 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:07:58,843 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 02:07:58,843 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:58,854 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:07:58,854 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:07:58,855 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:07:58,855 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 [] Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:58,891 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:07:58,894 INFO L393 LassoCheck]: Loop: "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;" "assume !(0 == __VERIFIER_assert_~cond);" "main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5;" [2020-07-29 02:07:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:58,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:07:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:58,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:58,923 INFO L280 TraceCheckUtils]: 0: Hoare triple {1039#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {1039#unseeded} is VALID [2020-07-29 02:07:58,924 INFO L280 TraceCheckUtils]: 1: Hoare triple {1039#unseeded} assume !!(main_~n~0 < 1000000); {1039#unseeded} is VALID [2020-07-29 02:07:58,925 INFO L280 TraceCheckUtils]: 2: Hoare triple {1039#unseeded} assume main_~k~0 == main_~n~0; {1039#unseeded} is VALID [2020-07-29 02:07:58,925 INFO L280 TraceCheckUtils]: 3: Hoare triple {1039#unseeded} main_~i~0 := 0; {1039#unseeded} is VALID [2020-07-29 02:07:58,926 INFO L280 TraceCheckUtils]: 4: Hoare triple {1039#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {1039#unseeded} is VALID [2020-07-29 02:07:58,926 INFO L280 TraceCheckUtils]: 5: Hoare triple {1039#unseeded} assume !!(main_~j~0 < main_~n~0); {1039#unseeded} is VALID [2020-07-29 02:07:58,927 INFO L280 TraceCheckUtils]: 6: Hoare triple {1039#unseeded} assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; {1039#unseeded} is VALID [2020-07-29 02:07:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:58,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:07:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:58,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:58,953 INFO L280 TraceCheckUtils]: 0: Hoare triple {1042#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~n~0))} 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; {1075#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:07:58,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {1075#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {1075#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:07:58,956 INFO L280 TraceCheckUtils]: 2: Hoare triple {1075#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; {1052#(or unseeded (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~n~0)) (>= oldRank0 0)))} is VALID [2020-07-29 02:07:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:58,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:07:58,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:07:58,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:58,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:58,966 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 [2020-07-29 02:07:58,966 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 15 Second operand 3 states. [2020-07-29 02:07:59,061 INFO L75 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. [2020-07-29 02:07:59,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:07:59,061 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:59,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 54 transitions. cyclomatic complexity: 15 [2020-07-29 02:07:59,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:59,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:59,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:07:59,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:07:59,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:59,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:59,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 167 transitions. [2020-07-29 02:07:59,065 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2020-07-29 02:07:59,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:59,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:59,066 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 54 transitions. cyclomatic complexity: 15 [2020-07-29 02:07:59,068 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 02:07:59,068 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:07:59,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:07:59,069 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:07:59,069 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 132 states and 167 transitions. cyclomatic complexity: 52 [2020-07-29 02:07:59,073 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 25 examples of accepted words. [2020-07-29 02:07:59,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:59,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:59,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:59,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:59,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:59,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:59,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:07:59,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:07:59,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:07:59,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 132 letters. Loop has 132 letters. [2020-07-29 02:07:59,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 132 letters. Loop has 132 letters. [2020-07-29 02:07:59,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 132 letters. Loop has 132 letters. [2020-07-29 02:07:59,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 43 letters. Loop has 43 letters. [2020-07-29 02:07:59,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 02:07:59,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 43 letters. Loop has 43 letters. [2020-07-29 02:07:59,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:07:59,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:07:59,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:07:59,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:59,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:59,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 9 letters. Loop has 3 letters. [2020-07-29 02:07:59,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:59,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:59,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:59,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:59,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:59,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:07:59,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:07:59,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:07:59,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:07:59,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2020-07-29 02:07:59,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 02:07:59,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 3 letters. [2020-07-29 02:07:59,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:07:59,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:07:59,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:07:59,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:07:59,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:07:59,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:07:59,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 7 letters. [2020-07-29 02:07:59,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 7 letters. [2020-07-29 02:07:59,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 7 letters. [2020-07-29 02:07:59,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:07:59,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:07:59,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:07:59,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:07:59,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:07:59,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:07:59,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:07:59,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:07:59,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:07:59,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:07:59,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:07:59,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:07:59,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:07:59,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:07:59,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:07:59,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:59,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:59,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:59,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:07:59,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:07:59,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:07:59,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:07:59,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:07:59,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:07:59,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:07:59,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:07:59,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:07:59,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 23 letters. Loop has 6 letters. [2020-07-29 02:07:59,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 6 letters. [2020-07-29 02:07:59,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 23 letters. Loop has 6 letters. [2020-07-29 02:07:59,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:07:59,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:07:59,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:07:59,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:07:59,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:07:59,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:07:59,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 6 letters. [2020-07-29 02:07:59,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 6 letters. [2020-07-29 02:07:59,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 24 letters. Loop has 6 letters. [2020-07-29 02:07:59,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 6 letters. [2020-07-29 02:07:59,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 6 letters. [2020-07-29 02:07:59,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 25 letters. Loop has 6 letters. [2020-07-29 02:07:59,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 6 letters. [2020-07-29 02:07:59,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 26 letters. Loop has 6 letters. [2020-07-29 02:07:59,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 26 letters. Loop has 6 letters. [2020-07-29 02:07:59,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 6 letters. [2020-07-29 02:07:59,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 6 letters. [2020-07-29 02:07:59,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 6 letters. [2020-07-29 02:07:59,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:07:59,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:07:59,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:07:59,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:07:59,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:07:59,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:07:59,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 22 letters. Loop has 6 letters. [2020-07-29 02:07:59,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 6 letters. [2020-07-29 02:07:59,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 22 letters. Loop has 6 letters. [2020-07-29 02:07:59,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:07:59,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:07:59,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:07:59,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:07:59,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:07:59,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:07:59,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:07:59,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:07:59,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:07:59,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:07:59,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:07:59,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:07:59,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:07:59,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:07:59,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:07:59,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:07:59,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:07:59,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:07:59,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:07:59,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:07:59,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:07:59,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:07:59,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:07:59,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:07:59,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:07:59,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:07:59,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:07:59,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:07:59,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:07:59,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:07:59,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:07:59,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:07:59,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:07:59,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 54 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:07:59,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:07:59,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 167 transitions. cyclomatic complexity: 52 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:07:59,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,126 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:59,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:07:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 02:07:59,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:59,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 02:07:59,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 02:07:59,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:59,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 167 transitions. cyclomatic complexity: 52 [2020-07-29 02:07:59,134 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2020-07-29 02:07:59,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 97 states and 121 transitions. [2020-07-29 02:07:59,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2020-07-29 02:07:59,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2020-07-29 02:07:59,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 121 transitions. [2020-07-29 02:07:59,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:07:59,139 INFO L688 BuchiCegarLoop]: Abstraction has 97 states and 121 transitions. [2020-07-29 02:07:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 121 transitions. [2020-07-29 02:07:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2020-07-29 02:07:59,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:07:59,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states and 121 transitions. Second operand 67 states. [2020-07-29 02:07:59,144 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states and 121 transitions. Second operand 67 states. [2020-07-29 02:07:59,145 INFO L87 Difference]: Start difference. First operand 97 states and 121 transitions. Second operand 67 states. [2020-07-29 02:07:59,145 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:07:59,151 INFO L93 Difference]: Finished difference Result 124 states and 156 transitions. [2020-07-29 02:07:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 156 transitions. [2020-07-29 02:07:59,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:59,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:59,152 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 97 states and 121 transitions. [2020-07-29 02:07:59,152 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 97 states and 121 transitions. [2020-07-29 02:07:59,153 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:07:59,159 INFO L93 Difference]: Finished difference Result 125 states and 157 transitions. [2020-07-29 02:07:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2020-07-29 02:07:59,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:59,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:59,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:07:59,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:07:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-29 02:07:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2020-07-29 02:07:59,163 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2020-07-29 02:07:59,163 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2020-07-29 02:07:59,163 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 02:07:59,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2020-07-29 02:07:59,164 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-07-29 02:07:59,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:59,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:59,165 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:07:59,165 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 02:07:59,165 INFO L794 eck$LassoCheckResult]: Stem: 1246#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 1228#L17 assume !!(main_~n~0 < 1000000); 1229#L18 assume main_~k~0 == main_~n~0; 1230#L18-1 main_~i~0 := 0; 1231#L22-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1235#L23-2 assume !!(main_~j~0 < main_~n~0); 1270#L24 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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; 1275#L7-3 assume !(0 == __VERIFIER_assert_~cond); 1274#L7-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; 1273#L7-6 assume !(0 == __VERIFIER_assert_~cond); 1272#L7-8 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1266#L23-2 assume !(main_~j~0 < main_~n~0); 1268#L22-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 1265#L22-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1264#L23-2 [2020-07-29 02:07:59,165 INFO L796 eck$LassoCheckResult]: Loop: 1264#L23-2 assume !!(main_~j~0 < main_~n~0); 1254#L24 assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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; 1255#L7-3 assume !(0 == __VERIFIER_assert_~cond); 1271#L7-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; 1269#L7-6 assume !(0 == __VERIFIER_assert_~cond); 1267#L7-8 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 1264#L23-2 [2020-07-29 02:07:59,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1340048366, now seen corresponding path program 1 times [2020-07-29 02:07:59,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:59,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33409135] [2020-07-29 02:07:59,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:59,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {1672#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {1672#true} is VALID [2020-07-29 02:07:59,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {1672#true} assume !!(main_~n~0 < 1000000); {1672#true} is VALID [2020-07-29 02:07:59,252 INFO L280 TraceCheckUtils]: 2: Hoare triple {1672#true} assume main_~k~0 == main_~n~0; {1672#true} is VALID [2020-07-29 02:07:59,253 INFO L280 TraceCheckUtils]: 3: Hoare triple {1672#true} main_~i~0 := 0; {1674#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 02:07:59,255 INFO L280 TraceCheckUtils]: 4: Hoare triple {1674#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {1675#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:07:59,255 INFO L280 TraceCheckUtils]: 5: Hoare triple {1675#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} assume !!(main_~j~0 < main_~n~0); {1675#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:07:59,255 INFO L280 TraceCheckUtils]: 6: Hoare triple {1675#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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; {1675#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:07:59,256 INFO L280 TraceCheckUtils]: 7: Hoare triple {1675#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} assume !(0 == __VERIFIER_assert_~cond); {1675#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:07:59,257 INFO L280 TraceCheckUtils]: 8: Hoare triple {1675#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} __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; {1675#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:07:59,257 INFO L280 TraceCheckUtils]: 9: Hoare triple {1675#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} assume !(0 == __VERIFIER_assert_~cond); {1675#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:07:59,258 INFO L280 TraceCheckUtils]: 10: Hoare triple {1675#(<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {1676#(<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 02:07:59,259 INFO L280 TraceCheckUtils]: 11: Hoare triple {1676#(<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~i~0 1))} assume !(main_~j~0 < main_~n~0); {1677#(<= ULTIMATE.start_main_~n~0 (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 02:07:59,260 INFO L280 TraceCheckUtils]: 12: Hoare triple {1677#(<= ULTIMATE.start_main_~n~0 (+ ULTIMATE.start_main_~i~0 1))} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {1678#(<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:07:59,267 INFO L280 TraceCheckUtils]: 13: Hoare triple {1678#(<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {1673#false} is VALID [2020-07-29 02:07:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:59,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33409135] [2020-07-29 02:07:59,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357559652] [2020-07-29 02:07:59,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 02:07:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:59,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 02:07:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:59,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:59,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {1672#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {1672#true} is VALID [2020-07-29 02:07:59,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {1672#true} assume !!(main_~n~0 < 1000000); {1672#true} is VALID [2020-07-29 02:07:59,506 INFO L280 TraceCheckUtils]: 2: Hoare triple {1672#true} assume main_~k~0 == main_~n~0; {1672#true} is VALID [2020-07-29 02:07:59,507 INFO L280 TraceCheckUtils]: 3: Hoare triple {1672#true} main_~i~0 := 0; {1674#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 02:07:59,508 INFO L280 TraceCheckUtils]: 4: Hoare triple {1674#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {1694#(and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 02:07:59,509 INFO L280 TraceCheckUtils]: 5: Hoare triple {1694#(and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))} assume !!(main_~j~0 < main_~n~0); {1694#(and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 02:07:59,510 INFO L280 TraceCheckUtils]: 6: Hoare triple {1694#(and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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; {1694#(and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 02:07:59,511 INFO L280 TraceCheckUtils]: 7: Hoare triple {1694#(and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))} assume !(0 == __VERIFIER_assert_~cond); {1694#(and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 02:07:59,512 INFO L280 TraceCheckUtils]: 8: Hoare triple {1694#(and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))} __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; {1694#(and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 02:07:59,513 INFO L280 TraceCheckUtils]: 9: Hoare triple {1694#(and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))} assume !(0 == __VERIFIER_assert_~cond); {1694#(and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 02:07:59,514 INFO L280 TraceCheckUtils]: 10: Hoare triple {1694#(and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {1713#(and (<= ULTIMATE.start_main_~j~0 (+ (* 2 ULTIMATE.start_main_~i~0) 1)) (<= ULTIMATE.start_main_~i~0 0))} is VALID [2020-07-29 02:07:59,515 INFO L280 TraceCheckUtils]: 11: Hoare triple {1713#(and (<= ULTIMATE.start_main_~j~0 (+ (* 2 ULTIMATE.start_main_~i~0) 1)) (<= ULTIMATE.start_main_~i~0 0))} assume !(main_~j~0 < main_~n~0); {1717#(and (<= ULTIMATE.start_main_~n~0 (+ (* 2 ULTIMATE.start_main_~i~0) 1)) (<= ULTIMATE.start_main_~i~0 0))} is VALID [2020-07-29 02:07:59,517 INFO L280 TraceCheckUtils]: 12: Hoare triple {1717#(and (<= ULTIMATE.start_main_~n~0 (+ (* 2 ULTIMATE.start_main_~i~0) 1)) (<= ULTIMATE.start_main_~i~0 0))} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {1721#(and (<= (+ (div (+ (* ULTIMATE.start_main_~n~0 (- 1)) 1) (- 2)) 1) ULTIMATE.start_main_~i~0) (<= (div (+ (* ULTIMATE.start_main_~n~0 (- 1)) 1) (- 2)) 0))} is VALID [2020-07-29 02:07:59,518 INFO L280 TraceCheckUtils]: 13: Hoare triple {1721#(and (<= (+ (div (+ (* ULTIMATE.start_main_~n~0 (- 1)) 1) (- 2)) 1) ULTIMATE.start_main_~i~0) (<= (div (+ (* ULTIMATE.start_main_~n~0 (- 1)) 1) (- 2)) 0))} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {1673#false} is VALID [2020-07-29 02:07:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:59,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 02:07:59,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-07-29 02:07:59,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207331484] [2020-07-29 02:07:59,520 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 02:07:59,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:59,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 2 times [2020-07-29 02:07:59,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:59,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439559663] [2020-07-29 02:07:59,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:59,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:59,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:59,536 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:59,582 INFO L342 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-07-29 02:07:59,582 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 02:07:59,618 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:59,618 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:59,618 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:59,618 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:59,618 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:07:59,619 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:59,619 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:59,619 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:59,619 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration5_Loop [2020-07-29 02:07:59,619 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:59,619 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:59,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:59,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:59,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:59,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:59,757 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:59,757 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 02:07:59,761 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:59,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:07:59,765 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:07:59,765 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3=0} Honda state: {ULTIMATE.start_main_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:59,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:59,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:07:59,791 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:07:59,791 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:59,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:59,829 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:59,882 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:07:59,882 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:00,290 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:08:00,293 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:00,293 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:00,293 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:00,293 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:00,293 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:08:00,293 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:00,293 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:00,294 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:00,294 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration5_Loop [2020-07-29 02:08:00,294 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:00,294 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:00,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:00,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:00,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:00,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:00,426 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:00,426 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:00,432 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 [2020-07-29 02:08:00,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:00,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:00,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:00,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:00,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:00,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:00,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:08:00,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:00,463 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 [2020-07-29 02:08:00,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:00,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:00,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:00,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:00,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:00,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:00,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:08:00,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:00,496 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 [2020-07-29 02:08:00,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:00,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:00,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:00,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:00,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:00,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:00,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:08:00,505 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:08:00,511 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 02:08:00,511 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:00,514 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:08:00,515 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:08:00,515 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:08:00,515 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 [] [2020-07-29 02:08:00,536 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:08:00,539 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 < main_~n~0);" "assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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;" "assume !(0 == __VERIFIER_assert_~cond);" "__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;" "assume !(0 == __VERIFIER_assert_~cond);" "main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3;" [2020-07-29 02:08:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:00,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:00,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:00,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:00,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {1724#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {1724#unseeded} is VALID [2020-07-29 02:08:00,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {1724#unseeded} assume !!(main_~n~0 < 1000000); {1724#unseeded} is VALID [2020-07-29 02:08:00,583 INFO L280 TraceCheckUtils]: 2: Hoare triple {1724#unseeded} assume main_~k~0 == main_~n~0; {1724#unseeded} is VALID [2020-07-29 02:08:00,583 INFO L280 TraceCheckUtils]: 3: Hoare triple {1724#unseeded} main_~i~0 := 0; {1724#unseeded} is VALID [2020-07-29 02:08:00,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {1724#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {1724#unseeded} is VALID [2020-07-29 02:08:00,584 INFO L280 TraceCheckUtils]: 5: Hoare triple {1724#unseeded} assume !!(main_~j~0 < main_~n~0); {1724#unseeded} is VALID [2020-07-29 02:08:00,585 INFO L280 TraceCheckUtils]: 6: Hoare triple {1724#unseeded} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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; {1724#unseeded} is VALID [2020-07-29 02:08:00,585 INFO L280 TraceCheckUtils]: 7: Hoare triple {1724#unseeded} assume !(0 == __VERIFIER_assert_~cond); {1724#unseeded} is VALID [2020-07-29 02:08:00,586 INFO L280 TraceCheckUtils]: 8: Hoare triple {1724#unseeded} __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; {1724#unseeded} is VALID [2020-07-29 02:08:00,586 INFO L280 TraceCheckUtils]: 9: Hoare triple {1724#unseeded} assume !(0 == __VERIFIER_assert_~cond); {1724#unseeded} is VALID [2020-07-29 02:08:00,587 INFO L280 TraceCheckUtils]: 10: Hoare triple {1724#unseeded} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {1724#unseeded} is VALID [2020-07-29 02:08:00,587 INFO L280 TraceCheckUtils]: 11: Hoare triple {1724#unseeded} assume !(main_~j~0 < main_~n~0); {1724#unseeded} is VALID [2020-07-29 02:08:00,588 INFO L280 TraceCheckUtils]: 12: Hoare triple {1724#unseeded} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {1724#unseeded} is VALID [2020-07-29 02:08:00,588 INFO L280 TraceCheckUtils]: 13: Hoare triple {1724#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {1724#unseeded} is VALID [2020-07-29 02:08:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:00,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:00,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:00,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {1727#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~j~0)))} assume !!(main_~j~0 < main_~n~0); {1781#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:00,629 INFO L280 TraceCheckUtils]: 1: Hoare triple {1781#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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; {1781#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:00,630 INFO L280 TraceCheckUtils]: 2: Hoare triple {1781#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {1781#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:00,631 INFO L280 TraceCheckUtils]: 3: Hoare triple {1781#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} __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; {1781#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:00,631 INFO L280 TraceCheckUtils]: 4: Hoare triple {1781#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {1781#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:00,632 INFO L280 TraceCheckUtils]: 5: Hoare triple {1781#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {1737#(or unseeded (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~j~0))) (>= oldRank0 0)))} is VALID [2020-07-29 02:08:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:00,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:08:00,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:00,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,651 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 [2020-07-29 02:08:00,652 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2020-07-29 02:08:00,736 INFO L75 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. [2020-07-29 02:08:00,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:00,736 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:00,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. cyclomatic complexity: 24 [2020-07-29 02:08:00,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:00,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:00,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:08:00,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:00,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:00,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:00,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 155 transitions. [2020-07-29 02:08:00,740 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-07-29 02:08:00,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:00,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:00,741 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 67 states and 83 transitions. cyclomatic complexity: 24 [2020-07-29 02:08:00,743 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2020-07-29 02:08:00,744 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:08:00,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:00,745 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:00,745 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 123 states and 155 transitions. cyclomatic complexity: 45 [2020-07-29 02:08:00,748 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2020-07-29 02:08:00,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:00,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:00,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:00,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 123 letters. Loop has 123 letters. [2020-07-29 02:08:00,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 123 letters. Loop has 123 letters. [2020-07-29 02:08:00,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 123 letters. Loop has 123 letters. [2020-07-29 02:08:00,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 67 letters. Loop has 67 letters. [2020-07-29 02:08:00,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 67 letters. [2020-07-29 02:08:00,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 67 letters. Loop has 67 letters. [2020-07-29 02:08:00,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:00,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:00,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:00,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:00,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:00,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:00,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:00,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:00,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:00,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:00,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:00,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:00,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:00,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:00,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:00,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:00,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:00,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:00,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:00,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:00,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:00,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:00,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:00,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:00,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:00,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:00,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:00,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:00,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:00,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:00,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:00,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:00,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:00,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:00,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:00,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:00,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:00,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:00,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:00,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:00,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:00,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:00,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:00,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:00,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:00,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:00,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:00,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:00,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:00,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:00,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:00,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:00,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:00,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:00,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:00,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:00,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:00,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:00,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:00,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:00,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:00,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:00,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:00,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:00,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:00,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:00,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:00,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:00,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:00,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:00,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:00,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:00,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:00,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:00,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:00,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:00,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:00,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:00,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:00,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:00,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:00,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:00,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:00,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:00,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:00,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:00,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:00,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:00,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:00,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:00,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:00,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:00,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:00,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:00,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:00,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:00,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:00,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:00,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:00,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:00,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:00,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:00,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:00,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:00,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:00,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:00,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:00,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:00,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:00,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:00,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:00,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:00,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:00,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:00,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,807 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:08:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 02:08:00,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,809 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 02:08:00,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:00,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:00,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:00,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {1724#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {1724#unseeded} is VALID [2020-07-29 02:08:00,850 INFO L280 TraceCheckUtils]: 1: Hoare triple {1724#unseeded} assume !!(main_~n~0 < 1000000); {1724#unseeded} is VALID [2020-07-29 02:08:00,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {1724#unseeded} assume main_~k~0 == main_~n~0; {1724#unseeded} is VALID [2020-07-29 02:08:00,852 INFO L280 TraceCheckUtils]: 3: Hoare triple {1724#unseeded} main_~i~0 := 0; {1724#unseeded} is VALID [2020-07-29 02:08:00,852 INFO L280 TraceCheckUtils]: 4: Hoare triple {1724#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {1724#unseeded} is VALID [2020-07-29 02:08:00,853 INFO L280 TraceCheckUtils]: 5: Hoare triple {1724#unseeded} assume !!(main_~j~0 < main_~n~0); {1724#unseeded} is VALID [2020-07-29 02:08:00,854 INFO L280 TraceCheckUtils]: 6: Hoare triple {1724#unseeded} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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; {1724#unseeded} is VALID [2020-07-29 02:08:00,854 INFO L280 TraceCheckUtils]: 7: Hoare triple {1724#unseeded} assume !(0 == __VERIFIER_assert_~cond); {1724#unseeded} is VALID [2020-07-29 02:08:00,855 INFO L280 TraceCheckUtils]: 8: Hoare triple {1724#unseeded} __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; {1724#unseeded} is VALID [2020-07-29 02:08:00,856 INFO L280 TraceCheckUtils]: 9: Hoare triple {1724#unseeded} assume !(0 == __VERIFIER_assert_~cond); {1724#unseeded} is VALID [2020-07-29 02:08:00,856 INFO L280 TraceCheckUtils]: 10: Hoare triple {1724#unseeded} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {1724#unseeded} is VALID [2020-07-29 02:08:00,857 INFO L280 TraceCheckUtils]: 11: Hoare triple {1724#unseeded} assume !(main_~j~0 < main_~n~0); {1724#unseeded} is VALID [2020-07-29 02:08:00,858 INFO L280 TraceCheckUtils]: 12: Hoare triple {1724#unseeded} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {1724#unseeded} is VALID [2020-07-29 02:08:00,858 INFO L280 TraceCheckUtils]: 13: Hoare triple {1724#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {1724#unseeded} is VALID [2020-07-29 02:08:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:00,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:00,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:00,893 INFO L280 TraceCheckUtils]: 0: Hoare triple {1727#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~j~0)))} assume !!(main_~j~0 < main_~n~0); {1973#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:00,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {1973#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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; {1973#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:00,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {1973#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {1973#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:00,895 INFO L280 TraceCheckUtils]: 3: Hoare triple {1973#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} __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; {1973#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:00,896 INFO L280 TraceCheckUtils]: 4: Hoare triple {1973#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {1973#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:00,897 INFO L280 TraceCheckUtils]: 5: Hoare triple {1973#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {1737#(or unseeded (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~j~0))) (>= oldRank0 0)))} is VALID [2020-07-29 02:08:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:00,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:08:00,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:00,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:00,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:00,910 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 [2020-07-29 02:08:00,911 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2020-07-29 02:08:01,045 INFO L75 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. [2020-07-29 02:08:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:01,045 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:01,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. cyclomatic complexity: 24 [2020-07-29 02:08:01,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:01,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:01,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:08:01,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:01,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:01,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:01,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 155 transitions. [2020-07-29 02:08:01,048 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-07-29 02:08:01,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:01,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:01,049 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 67 states and 83 transitions. cyclomatic complexity: 24 [2020-07-29 02:08:01,049 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2020-07-29 02:08:01,049 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:08:01,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:01,050 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:01,050 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 123 states and 155 transitions. cyclomatic complexity: 45 [2020-07-29 02:08:01,053 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2020-07-29 02:08:01,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:01,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:01,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:01,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 123 letters. Loop has 123 letters. [2020-07-29 02:08:01,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 123 letters. Loop has 123 letters. [2020-07-29 02:08:01,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 123 letters. Loop has 123 letters. [2020-07-29 02:08:01,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 67 letters. Loop has 67 letters. [2020-07-29 02:08:01,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 67 letters. [2020-07-29 02:08:01,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 67 letters. Loop has 67 letters. [2020-07-29 02:08:01,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:01,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:01,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:01,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:01,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:01,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:01,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:01,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:01,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:01,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:01,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:01,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:01,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:01,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:01,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:01,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:01,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:01,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:01,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:01,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:01,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:01,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:01,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:01,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:01,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:01,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:01,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:01,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:01,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:01,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:01,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:01,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:01,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:01,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:01,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:01,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:01,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:01,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:01,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:01,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:01,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:01,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:01,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:01,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:01,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:01,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:01,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:01,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:01,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 155 transitions. cyclomatic complexity: 45 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,119 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:08:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 02:08:01,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,120 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 02:08:01,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:01,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:01,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:01,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {1724#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {1724#unseeded} is VALID [2020-07-29 02:08:01,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {1724#unseeded} assume !!(main_~n~0 < 1000000); {1724#unseeded} is VALID [2020-07-29 02:08:01,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {1724#unseeded} assume main_~k~0 == main_~n~0; {1724#unseeded} is VALID [2020-07-29 02:08:01,154 INFO L280 TraceCheckUtils]: 3: Hoare triple {1724#unseeded} main_~i~0 := 0; {1724#unseeded} is VALID [2020-07-29 02:08:01,155 INFO L280 TraceCheckUtils]: 4: Hoare triple {1724#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {1724#unseeded} is VALID [2020-07-29 02:08:01,156 INFO L280 TraceCheckUtils]: 5: Hoare triple {1724#unseeded} assume !!(main_~j~0 < main_~n~0); {1724#unseeded} is VALID [2020-07-29 02:08:01,156 INFO L280 TraceCheckUtils]: 6: Hoare triple {1724#unseeded} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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; {1724#unseeded} is VALID [2020-07-29 02:08:01,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {1724#unseeded} assume !(0 == __VERIFIER_assert_~cond); {1724#unseeded} is VALID [2020-07-29 02:08:01,158 INFO L280 TraceCheckUtils]: 8: Hoare triple {1724#unseeded} __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; {1724#unseeded} is VALID [2020-07-29 02:08:01,158 INFO L280 TraceCheckUtils]: 9: Hoare triple {1724#unseeded} assume !(0 == __VERIFIER_assert_~cond); {1724#unseeded} is VALID [2020-07-29 02:08:01,159 INFO L280 TraceCheckUtils]: 10: Hoare triple {1724#unseeded} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {1724#unseeded} is VALID [2020-07-29 02:08:01,159 INFO L280 TraceCheckUtils]: 11: Hoare triple {1724#unseeded} assume !(main_~j~0 < main_~n~0); {1724#unseeded} is VALID [2020-07-29 02:08:01,160 INFO L280 TraceCheckUtils]: 12: Hoare triple {1724#unseeded} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {1724#unseeded} is VALID [2020-07-29 02:08:01,161 INFO L280 TraceCheckUtils]: 13: Hoare triple {1724#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {1724#unseeded} is VALID [2020-07-29 02:08:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:01,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:01,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:01,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {1727#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~j~0)))} assume !!(main_~j~0 < main_~n~0); {2165#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:01,199 INFO L280 TraceCheckUtils]: 1: Hoare triple {2165#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__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; {2165#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:01,200 INFO L280 TraceCheckUtils]: 2: Hoare triple {2165#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {2165#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:01,201 INFO L280 TraceCheckUtils]: 3: Hoare triple {2165#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} __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; {2165#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:01,202 INFO L280 TraceCheckUtils]: 4: Hoare triple {2165#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {2165#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:01,203 INFO L280 TraceCheckUtils]: 5: Hoare triple {2165#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~j~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {1737#(or unseeded (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~j~0))) (>= oldRank0 0)))} is VALID [2020-07-29 02:08:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:01,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:08:01,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:01,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,215 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 [2020-07-29 02:08:01,215 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2020-07-29 02:08:01,285 INFO L75 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. [2020-07-29 02:08:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:01,286 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:01,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. cyclomatic complexity: 24 [2020-07-29 02:08:01,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:01,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:01,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:08:01,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:01,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:01,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:01,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 154 transitions. [2020-07-29 02:08:01,288 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 02:08:01,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:01,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:01,289 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 67 states and 83 transitions. cyclomatic complexity: 24 [2020-07-29 02:08:01,289 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2020-07-29 02:08:01,289 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:08:01,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:01,290 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:01,290 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 123 states and 154 transitions. cyclomatic complexity: 44 [2020-07-29 02:08:01,291 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 02:08:01,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:01,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:01,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:01,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 123 letters. Loop has 123 letters. [2020-07-29 02:08:01,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 123 letters. Loop has 123 letters. [2020-07-29 02:08:01,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 123 letters. Loop has 123 letters. [2020-07-29 02:08:01,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 67 letters. Loop has 67 letters. [2020-07-29 02:08:01,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 67 letters. [2020-07-29 02:08:01,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 67 letters. Loop has 67 letters. [2020-07-29 02:08:01,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:01,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:01,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:01,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:01,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:01,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:01,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:01,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:01,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:01,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:01,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:01,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:01,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:01,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:01,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:01,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:01,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:01,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:01,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:01,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:01,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:01,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:01,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:01,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 17 letters. Loop has 7 letters. [2020-07-29 02:08:01,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 19 letters. Loop has 6 letters. [2020-07-29 02:08:01,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 18 letters. Loop has 6 letters. [2020-07-29 02:08:01,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 15 letters. Loop has 6 letters. [2020-07-29 02:08:01,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 17 letters. Loop has 6 letters. [2020-07-29 02:08:01,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 16 letters. Loop has 6 letters. [2020-07-29 02:08:01,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:01,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:01,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:01,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:01,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:01,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:01,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:01,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:01,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:01,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:01,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:01,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:01,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 20 letters. Loop has 3 letters. [2020-07-29 02:08:01,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:01,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:01,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 18 letters. Loop has 3 letters. [2020-07-29 02:08:01,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 83 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:01,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:01,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 123 states and 154 transitions. cyclomatic complexity: 44 Stem has 19 letters. Loop has 3 letters. [2020-07-29 02:08:01,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,315 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:08:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-07-29 02:08:01,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:01,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 20 letters. Loop has 6 letters. [2020-07-29 02:08:01,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 12 letters. [2020-07-29 02:08:01,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:01,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 154 transitions. cyclomatic complexity: 44 [2020-07-29 02:08:01,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 02:08:01,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 74 states and 92 transitions. [2020-07-29 02:08:01,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 02:08:01,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 02:08:01,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 92 transitions. [2020-07-29 02:08:01,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:08:01,322 INFO L688 BuchiCegarLoop]: Abstraction has 74 states and 92 transitions. [2020-07-29 02:08:01,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 92 transitions. [2020-07-29 02:08:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2020-07-29 02:08:01,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:01,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states and 92 transitions. Second operand 48 states. [2020-07-29 02:08:01,325 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states and 92 transitions. Second operand 48 states. [2020-07-29 02:08:01,325 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand 48 states. [2020-07-29 02:08:01,325 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:01,328 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2020-07-29 02:08:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2020-07-29 02:08:01,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:01,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:01,329 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 74 states and 92 transitions. [2020-07-29 02:08:01,329 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 74 states and 92 transitions. [2020-07-29 02:08:01,329 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:01,332 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2020-07-29 02:08:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2020-07-29 02:08:01,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:01,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:01,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:01,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-29 02:08:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2020-07-29 02:08:01,334 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2020-07-29 02:08:01,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:08:01,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 02:08:01,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-29 02:08:01,334 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 11 states. [2020-07-29 02:08:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:01,640 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2020-07-29 02:08:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 02:08:01,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 02:08:01,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:01,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 180 transitions. [2020-07-29 02:08:01,672 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 02:08:01,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 143 states and 176 transitions. [2020-07-29 02:08:01,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 02:08:01,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 02:08:01,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 176 transitions. [2020-07-29 02:08:01,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:08:01,675 INFO L688 BuchiCegarLoop]: Abstraction has 143 states and 176 transitions. [2020-07-29 02:08:01,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 176 transitions. [2020-07-29 02:08:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 60. [2020-07-29 02:08:01,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:01,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states and 176 transitions. Second operand 60 states. [2020-07-29 02:08:01,679 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states and 176 transitions. Second operand 60 states. [2020-07-29 02:08:01,679 INFO L87 Difference]: Start difference. First operand 143 states and 176 transitions. Second operand 60 states. [2020-07-29 02:08:01,680 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:01,683 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2020-07-29 02:08:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2020-07-29 02:08:01,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:01,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:01,684 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 143 states and 176 transitions. [2020-07-29 02:08:01,684 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 143 states and 176 transitions. [2020-07-29 02:08:01,685 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:01,689 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2020-07-29 02:08:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2020-07-29 02:08:01,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:01,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:01,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:01,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-29 02:08:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2020-07-29 02:08:01,691 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2020-07-29 02:08:01,691 INFO L591 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2020-07-29 02:08:01,691 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 02:08:01,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 75 transitions. [2020-07-29 02:08:01,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:01,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:01,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:01,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:08:01,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:08:01,693 INFO L794 eck$LassoCheckResult]: Stem: 2821#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; 2806#L17 assume !!(main_~n~0 < 1000000); 2807#L18 assume main_~k~0 == main_~n~0; 2808#L18-1 main_~i~0 := 0; 2809#L22-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2813#L23-2 assume !!(main_~j~0 < main_~n~0); 2820#L24 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; 2823#L25-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; 2811#L7 assume !(0 == __VERIFIER_assert_~cond); 2804#L7-2 main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; 2805#L25-2 assume !(main_~k~0 < main_~n~0); 2854#L7-8 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 2827#L23-2 assume !!(main_~j~0 < main_~n~0); 2825#L24 assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; 2803#L25-2 [2020-07-29 02:08:01,693 INFO L796 eck$LassoCheckResult]: Loop: 2803#L25-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; 2810#L7 assume !(0 == __VERIFIER_assert_~cond); 2802#L7-2 main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; 2803#L25-2 [2020-07-29 02:08:01,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:01,693 INFO L82 PathProgramCache]: Analyzing trace with hash 279041640, now seen corresponding path program 1 times [2020-07-29 02:08:01,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:01,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019212180] [2020-07-29 02:08:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:01,742 INFO L280 TraceCheckUtils]: 0: Hoare triple {3351#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {3351#true} is VALID [2020-07-29 02:08:01,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {3351#true} assume !!(main_~n~0 < 1000000); {3351#true} is VALID [2020-07-29 02:08:01,743 INFO L280 TraceCheckUtils]: 2: Hoare triple {3351#true} assume main_~k~0 == main_~n~0; {3351#true} is VALID [2020-07-29 02:08:01,743 INFO L280 TraceCheckUtils]: 3: Hoare triple {3351#true} main_~i~0 := 0; {3351#true} is VALID [2020-07-29 02:08:01,743 INFO L280 TraceCheckUtils]: 4: Hoare triple {3351#true} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {3351#true} is VALID [2020-07-29 02:08:01,744 INFO L280 TraceCheckUtils]: 5: Hoare triple {3351#true} assume !!(main_~j~0 < main_~n~0); {3351#true} is VALID [2020-07-29 02:08:01,746 INFO L280 TraceCheckUtils]: 6: Hoare triple {3351#true} assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; {3353#(<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 02:08:01,746 INFO L280 TraceCheckUtils]: 7: Hoare triple {3353#(<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0)} 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; {3353#(<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 02:08:01,747 INFO L280 TraceCheckUtils]: 8: Hoare triple {3353#(<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0)} assume !(0 == __VERIFIER_assert_~cond); {3353#(<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 02:08:01,748 INFO L280 TraceCheckUtils]: 9: Hoare triple {3353#(<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0)} main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; {3354#(<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~j~0 1))} is VALID [2020-07-29 02:08:01,748 INFO L280 TraceCheckUtils]: 10: Hoare triple {3354#(<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~j~0 1))} assume !(main_~k~0 < main_~n~0); {3355#(<= ULTIMATE.start_main_~n~0 (+ ULTIMATE.start_main_~j~0 1))} is VALID [2020-07-29 02:08:01,749 INFO L280 TraceCheckUtils]: 11: Hoare triple {3355#(<= ULTIMATE.start_main_~n~0 (+ ULTIMATE.start_main_~j~0 1))} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {3356#(<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 02:08:01,750 INFO L280 TraceCheckUtils]: 12: Hoare triple {3356#(<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 < main_~n~0); {3352#false} is VALID [2020-07-29 02:08:01,750 INFO L280 TraceCheckUtils]: 13: Hoare triple {3352#false} assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; {3352#false} is VALID [2020-07-29 02:08:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:01,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019212180] [2020-07-29 02:08:01,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853963512] [2020-07-29 02:08:01,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 02:08:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:01,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 02:08:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:01,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:01,893 INFO L280 TraceCheckUtils]: 0: Hoare triple {3351#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {3351#true} is VALID [2020-07-29 02:08:01,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {3351#true} assume !!(main_~n~0 < 1000000); {3351#true} is VALID [2020-07-29 02:08:01,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {3351#true} assume main_~k~0 == main_~n~0; {3351#true} is VALID [2020-07-29 02:08:01,894 INFO L280 TraceCheckUtils]: 3: Hoare triple {3351#true} main_~i~0 := 0; {3351#true} is VALID [2020-07-29 02:08:01,894 INFO L280 TraceCheckUtils]: 4: Hoare triple {3351#true} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {3351#true} is VALID [2020-07-29 02:08:01,895 INFO L280 TraceCheckUtils]: 5: Hoare triple {3351#true} assume !!(main_~j~0 < main_~n~0); {3351#true} is VALID [2020-07-29 02:08:01,895 INFO L280 TraceCheckUtils]: 6: Hoare triple {3351#true} assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; {3353#(<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 02:08:01,896 INFO L280 TraceCheckUtils]: 7: Hoare triple {3353#(<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0)} 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; {3353#(<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 02:08:01,897 INFO L280 TraceCheckUtils]: 8: Hoare triple {3353#(<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0)} assume !(0 == __VERIFIER_assert_~cond); {3353#(<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 02:08:01,898 INFO L280 TraceCheckUtils]: 9: Hoare triple {3353#(<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0)} main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; {3354#(<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~j~0 1))} is VALID [2020-07-29 02:08:01,899 INFO L280 TraceCheckUtils]: 10: Hoare triple {3354#(<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~j~0 1))} assume !(main_~k~0 < main_~n~0); {3355#(<= ULTIMATE.start_main_~n~0 (+ ULTIMATE.start_main_~j~0 1))} is VALID [2020-07-29 02:08:01,899 INFO L280 TraceCheckUtils]: 11: Hoare triple {3355#(<= ULTIMATE.start_main_~n~0 (+ ULTIMATE.start_main_~j~0 1))} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {3356#(<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 02:08:01,900 INFO L280 TraceCheckUtils]: 12: Hoare triple {3356#(<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 < main_~n~0); {3352#false} is VALID [2020-07-29 02:08:01,900 INFO L280 TraceCheckUtils]: 13: Hoare triple {3352#false} assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; {3352#false} is VALID [2020-07-29 02:08:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:01,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 02:08:01,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-07-29 02:08:01,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963494399] [2020-07-29 02:08:01,902 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 02:08:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 2 times [2020-07-29 02:08:01,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:01,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581480675] [2020-07-29 02:08:01,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:01,909 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:01,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:01,913 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:01,965 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:01,966 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:01,966 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:01,966 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:01,966 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:08:01,966 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:01,966 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:01,966 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:01,966 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration6_Loop [2020-07-29 02:08:01,966 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:01,967 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:01,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:01,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:01,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:02,063 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:02,064 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:02,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:02,067 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:02,071 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:08:02,071 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:02,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:02,104 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:02,108 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:08:02,109 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:02,142 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:02,142 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:02,179 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:08:02,179 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:02,352 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:08:02,354 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:02,354 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:02,354 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:02,354 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:02,354 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:08:02,354 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:02,354 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:02,354 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:02,355 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested6.i_Iteration6_Loop [2020-07-29 02:08:02,355 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:02,355 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:02,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:02,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:02,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:02,455 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:02,455 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:02,462 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 [2020-07-29 02:08:02,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:02,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:02,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:02,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:02,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:02,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:02,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:02,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:02,501 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 [2020-07-29 02:08:02,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:02,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:02,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:02,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:02,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:02,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:02,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:02,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:02,540 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 [2020-07-29 02:08:02,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:02,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:02,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:02,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:02,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:02,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:02,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:02,549 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:08:02,552 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:08:02,552 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:02,554 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:08:02,554 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:08:02,554 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:08:02,555 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 [] [2020-07-29 02:08:02,577 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:08:02,579 INFO L393 LassoCheck]: Loop: "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;" "assume !(0 == __VERIFIER_assert_~cond);" "main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5;" [2020-07-29 02:08:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:02,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:02,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:02,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:02,620 INFO L280 TraceCheckUtils]: 0: Hoare triple {3398#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {3398#unseeded} is VALID [2020-07-29 02:08:02,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {3398#unseeded} assume !!(main_~n~0 < 1000000); {3398#unseeded} is VALID [2020-07-29 02:08:02,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {3398#unseeded} assume main_~k~0 == main_~n~0; {3398#unseeded} is VALID [2020-07-29 02:08:02,622 INFO L280 TraceCheckUtils]: 3: Hoare triple {3398#unseeded} main_~i~0 := 0; {3398#unseeded} is VALID [2020-07-29 02:08:02,622 INFO L280 TraceCheckUtils]: 4: Hoare triple {3398#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {3398#unseeded} is VALID [2020-07-29 02:08:02,623 INFO L280 TraceCheckUtils]: 5: Hoare triple {3398#unseeded} assume !!(main_~j~0 < main_~n~0); {3398#unseeded} is VALID [2020-07-29 02:08:02,623 INFO L280 TraceCheckUtils]: 6: Hoare triple {3398#unseeded} assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; {3398#unseeded} is VALID [2020-07-29 02:08:02,624 INFO L280 TraceCheckUtils]: 7: Hoare triple {3398#unseeded} 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; {3398#unseeded} is VALID [2020-07-29 02:08:02,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {3398#unseeded} assume !(0 == __VERIFIER_assert_~cond); {3398#unseeded} is VALID [2020-07-29 02:08:02,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {3398#unseeded} main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; {3398#unseeded} is VALID [2020-07-29 02:08:02,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {3398#unseeded} assume !(main_~k~0 < main_~n~0); {3398#unseeded} is VALID [2020-07-29 02:08:02,626 INFO L280 TraceCheckUtils]: 11: Hoare triple {3398#unseeded} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {3398#unseeded} is VALID [2020-07-29 02:08:02,626 INFO L280 TraceCheckUtils]: 12: Hoare triple {3398#unseeded} assume !!(main_~j~0 < main_~n~0); {3398#unseeded} is VALID [2020-07-29 02:08:02,626 INFO L280 TraceCheckUtils]: 13: Hoare triple {3398#unseeded} assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; {3398#unseeded} is VALID [2020-07-29 02:08:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:02,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:02,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:02,651 INFO L280 TraceCheckUtils]: 0: Hoare triple {3401#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~n~0))} 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; {3455#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:02,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {3455#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {3455#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:02,653 INFO L280 TraceCheckUtils]: 2: Hoare triple {3455#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; {3411#(or unseeded (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~n~0)) (>= oldRank0 0)))} is VALID [2020-07-29 02:08:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:02,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:08:02,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:02,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,661 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 [2020-07-29 02:08:02,661 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2020-07-29 02:08:02,763 INFO L75 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. [2020-07-29 02:08:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:02,763 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:02,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 75 transitions. cyclomatic complexity: 21 [2020-07-29 02:08:02,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:02,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:02,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:08:02,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:02,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:02,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:02,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 147 transitions. [2020-07-29 02:08:02,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:02,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:02,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:02,767 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 75 transitions. cyclomatic complexity: 21 [2020-07-29 02:08:02,767 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:02,767 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:08:02,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:02,768 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:02,768 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 115 states and 147 transitions. cyclomatic complexity: 45 [2020-07-29 02:08:02,769 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:02,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:02,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:02,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:02,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 115 letters. Loop has 115 letters. [2020-07-29 02:08:02,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 115 letters. Loop has 115 letters. [2020-07-29 02:08:02,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 115 letters. Loop has 115 letters. [2020-07-29 02:08:02,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 60 letters. Loop has 60 letters. [2020-07-29 02:08:02,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 60 letters. [2020-07-29 02:08:02,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 60 letters. Loop has 60 letters. [2020-07-29 02:08:02,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:02,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:02,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:02,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:02,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:02,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:02,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:02,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:02,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:02,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:02,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:02,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:02,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:02,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:02,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:02,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:02,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:02,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:02,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,782 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:08:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 02:08:02,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,784 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 02:08:02,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:02,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:02,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:02,818 INFO L280 TraceCheckUtils]: 0: Hoare triple {3398#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {3398#unseeded} is VALID [2020-07-29 02:08:02,819 INFO L280 TraceCheckUtils]: 1: Hoare triple {3398#unseeded} assume !!(main_~n~0 < 1000000); {3398#unseeded} is VALID [2020-07-29 02:08:02,819 INFO L280 TraceCheckUtils]: 2: Hoare triple {3398#unseeded} assume main_~k~0 == main_~n~0; {3398#unseeded} is VALID [2020-07-29 02:08:02,819 INFO L280 TraceCheckUtils]: 3: Hoare triple {3398#unseeded} main_~i~0 := 0; {3398#unseeded} is VALID [2020-07-29 02:08:02,820 INFO L280 TraceCheckUtils]: 4: Hoare triple {3398#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {3398#unseeded} is VALID [2020-07-29 02:08:02,821 INFO L280 TraceCheckUtils]: 5: Hoare triple {3398#unseeded} assume !!(main_~j~0 < main_~n~0); {3398#unseeded} is VALID [2020-07-29 02:08:02,821 INFO L280 TraceCheckUtils]: 6: Hoare triple {3398#unseeded} assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; {3398#unseeded} is VALID [2020-07-29 02:08:02,822 INFO L280 TraceCheckUtils]: 7: Hoare triple {3398#unseeded} 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; {3398#unseeded} is VALID [2020-07-29 02:08:02,822 INFO L280 TraceCheckUtils]: 8: Hoare triple {3398#unseeded} assume !(0 == __VERIFIER_assert_~cond); {3398#unseeded} is VALID [2020-07-29 02:08:02,823 INFO L280 TraceCheckUtils]: 9: Hoare triple {3398#unseeded} main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; {3398#unseeded} is VALID [2020-07-29 02:08:02,823 INFO L280 TraceCheckUtils]: 10: Hoare triple {3398#unseeded} assume !(main_~k~0 < main_~n~0); {3398#unseeded} is VALID [2020-07-29 02:08:02,823 INFO L280 TraceCheckUtils]: 11: Hoare triple {3398#unseeded} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {3398#unseeded} is VALID [2020-07-29 02:08:02,824 INFO L280 TraceCheckUtils]: 12: Hoare triple {3398#unseeded} assume !!(main_~j~0 < main_~n~0); {3398#unseeded} is VALID [2020-07-29 02:08:02,824 INFO L280 TraceCheckUtils]: 13: Hoare triple {3398#unseeded} assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; {3398#unseeded} is VALID [2020-07-29 02:08:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:02,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:02,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:02,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {3401#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~n~0))} 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; {3630#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:02,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {3630#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {3630#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:02,854 INFO L280 TraceCheckUtils]: 2: Hoare triple {3630#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; {3411#(or unseeded (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~n~0)) (>= oldRank0 0)))} is VALID [2020-07-29 02:08:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:02,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:08:02,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:02,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,864 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 [2020-07-29 02:08:02,864 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2020-07-29 02:08:02,945 INFO L75 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. [2020-07-29 02:08:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:02,946 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:02,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 75 transitions. cyclomatic complexity: 21 [2020-07-29 02:08:02,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:02,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:02,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:08:02,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:02,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:02,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:02,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 147 transitions. [2020-07-29 02:08:02,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:02,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:02,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:02,948 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 75 transitions. cyclomatic complexity: 21 [2020-07-29 02:08:02,949 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:02,949 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:08:02,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:02,949 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:02,949 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 115 states and 147 transitions. cyclomatic complexity: 45 [2020-07-29 02:08:02,950 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:02,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:02,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:02,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:02,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 115 letters. Loop has 115 letters. [2020-07-29 02:08:02,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 115 letters. Loop has 115 letters. [2020-07-29 02:08:02,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 115 letters. Loop has 115 letters. [2020-07-29 02:08:02,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 60 letters. Loop has 60 letters. [2020-07-29 02:08:02,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 60 letters. [2020-07-29 02:08:02,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 60 letters. Loop has 60 letters. [2020-07-29 02:08:02,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:02,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:02,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:02,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:02,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:02,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:02,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:02,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:02,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:02,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:02,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:02,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:02,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:02,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:02,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:02,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:02,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:02,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 115 states and 147 transitions. cyclomatic complexity: 45 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:02,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,961 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:08:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 02:08:02,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:02,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:02,963 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 02:08:02,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:02,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:02,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:02,997 INFO L280 TraceCheckUtils]: 0: Hoare triple {3398#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet4, main_#t~post5, main_#t~post3, main_#t~post2, 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~nondet0;havoc main_#t~nondet0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; {3398#unseeded} is VALID [2020-07-29 02:08:02,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {3398#unseeded} assume !!(main_~n~0 < 1000000); {3398#unseeded} is VALID [2020-07-29 02:08:02,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {3398#unseeded} assume main_~k~0 == main_~n~0; {3398#unseeded} is VALID [2020-07-29 02:08:02,999 INFO L280 TraceCheckUtils]: 3: Hoare triple {3398#unseeded} main_~i~0 := 0; {3398#unseeded} is VALID [2020-07-29 02:08:03,000 INFO L280 TraceCheckUtils]: 4: Hoare triple {3398#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; {3398#unseeded} is VALID [2020-07-29 02:08:03,001 INFO L280 TraceCheckUtils]: 5: Hoare triple {3398#unseeded} assume !!(main_~j~0 < main_~n~0); {3398#unseeded} is VALID [2020-07-29 02:08:03,001 INFO L280 TraceCheckUtils]: 6: Hoare triple {3398#unseeded} assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; {3398#unseeded} is VALID [2020-07-29 02:08:03,002 INFO L280 TraceCheckUtils]: 7: Hoare triple {3398#unseeded} 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; {3398#unseeded} is VALID [2020-07-29 02:08:03,002 INFO L280 TraceCheckUtils]: 8: Hoare triple {3398#unseeded} assume !(0 == __VERIFIER_assert_~cond); {3398#unseeded} is VALID [2020-07-29 02:08:03,003 INFO L280 TraceCheckUtils]: 9: Hoare triple {3398#unseeded} main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; {3398#unseeded} is VALID [2020-07-29 02:08:03,003 INFO L280 TraceCheckUtils]: 10: Hoare triple {3398#unseeded} assume !(main_~k~0 < main_~n~0); {3398#unseeded} is VALID [2020-07-29 02:08:03,003 INFO L280 TraceCheckUtils]: 11: Hoare triple {3398#unseeded} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {3398#unseeded} is VALID [2020-07-29 02:08:03,004 INFO L280 TraceCheckUtils]: 12: Hoare triple {3398#unseeded} assume !!(main_~j~0 < main_~n~0); {3398#unseeded} is VALID [2020-07-29 02:08:03,004 INFO L280 TraceCheckUtils]: 13: Hoare triple {3398#unseeded} assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := main_~j~0; {3398#unseeded} is VALID [2020-07-29 02:08:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:03,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:03,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:03,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {3401#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~n~0))} 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; {3805#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:03,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {3805#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {3805#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:03,030 INFO L280 TraceCheckUtils]: 2: Hoare triple {3805#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~k~0)) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))} main_#t~post5 := main_~k~0;main_~k~0 := 1 + main_#t~post5;havoc main_#t~post5; {3411#(or unseeded (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~n~0)) (>= oldRank0 0)))} is VALID [2020-07-29 02:08:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:03,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:08:03,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:03,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:03,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,042 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 [2020-07-29 02:08:03,042 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2020-07-29 02:08:03,131 INFO L75 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. [2020-07-29 02:08:03,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:03,132 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:03,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 75 transitions. cyclomatic complexity: 21 [2020-07-29 02:08:03,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:03,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:03,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:08:03,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:03,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:03,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:03,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 119 transitions. [2020-07-29 02:08:03,134 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:03,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:03,135 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 75 transitions. cyclomatic complexity: 21 [2020-07-29 02:08:03,135 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:03,135 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:08:03,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:03,136 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:03,136 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 94 states and 119 transitions. cyclomatic complexity: 34 [2020-07-29 02:08:03,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 119 transitions. cyclomatic complexity: 34 [2020-07-29 02:08:03,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:03,137 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 02:08:03,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:03,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:03,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 119 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:03,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:03,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:03,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 119 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:03,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 94 letters. Loop has 94 letters. [2020-07-29 02:08:03,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 94 letters. Loop has 94 letters. [2020-07-29 02:08:03,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 119 transitions. cyclomatic complexity: 34 Stem has 94 letters. Loop has 94 letters. [2020-07-29 02:08:03,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 60 letters. Loop has 60 letters. [2020-07-29 02:08:03,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 60 letters. [2020-07-29 02:08:03,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 119 transitions. cyclomatic complexity: 34 Stem has 60 letters. Loop has 60 letters. [2020-07-29 02:08:03,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:03,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:03,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 119 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:03,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:03,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:03,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 119 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 3 letters. [2020-07-29 02:08:03,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:03,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:03,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 119 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:03,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:03,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:03,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 119 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 3 letters. [2020-07-29 02:08:03,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 75 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:03,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:03,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 119 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:03,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,147 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:08:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2020-07-29 02:08:03,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2020-07-29 02:08:03,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 17 letters. Loop has 3 letters. [2020-07-29 02:08:03,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2020-07-29 02:08:03,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:03,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 119 transitions. cyclomatic complexity: 34 [2020-07-29 02:08:03,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:03,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 0 states and 0 transitions. [2020-07-29 02:08:03,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:08:03,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:08:03,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:08:03,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:08:03,153 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:03,153 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:03,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:08:03,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 02:08:03,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 02:08:03,154 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2020-07-29 02:08:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:03,154 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 02:08:03,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 02:08:03,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 02:08:03,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:03,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 02:08:03,170 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:03,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 02:08:03,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:08:03,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:08:03,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:08:03,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:08:03,170 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:03,170 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:03,170 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:03,171 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 02:08:03,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 02:08:03,171 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:03,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:03,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 02:08:03 BoogieIcfgContainer [2020-07-29 02:08:03,178 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 02:08:03,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 02:08:03,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 02:08:03,179 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 02:08:03,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:07:54" (3/4) ... [2020-07-29 02:08:03,183 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 02:08:03,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 02:08:03,186 INFO L168 Benchmark]: Toolchain (without parser) took 9185.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 962.9 MB in the beginning and 922.5 MB in the end (delta: 40.4 MB). Peak memory consumption was 347.2 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:03,187 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:08:03,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.19 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 952.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:03,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:03,189 INFO L168 Benchmark]: Boogie Preprocessor took 40.84 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. [2020-07-29 02:08:03,189 INFO L168 Benchmark]: RCFGBuilder took 409.44 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: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:03,190 INFO L168 Benchmark]: BuchiAutomizer took 8279.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 922.5 MB in the end (delta: 182.0 MB). Peak memory consumption was 353.9 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:03,190 INFO L168 Benchmark]: Witness Printer took 4.80 ms. Allocated memory is still 1.3 GB. Free memory is still 922.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:08:03,194 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.19 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 952.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.84 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 409.44 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: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8279.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 922.5 MB in the end (delta: 182.0 MB). Peak memory consumption was 353.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.80 ms. Allocated memory is still 1.3 GB. Free memory is still 922.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 8.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.1s. Construction of modules took 0.5s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.1s 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, 339 SDslu, 132 SDs, 0 SdLazy, 304 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital22 mio100 ax100 hnf98 lsp74 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq144 hnf94 smp100 dnf100 smp100 tf109 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 62ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...