./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Sunset.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-restricted-15/Sunset.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash a80d10d797b477078e6dad6d87594a2a0aea1065 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:30:53,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:30:53,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:30:53,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:30:53,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:30:53,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:30:53,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:30:53,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:30:53,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:30:53,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:30:53,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:30:53,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:30:53,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:30:53,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:30:53,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:30:53,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:30:53,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:30:53,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:30:53,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:30:53,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:30:53,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:30:53,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:30:53,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:30:53,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:30:53,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:30:53,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:30:53,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:30:53,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:30:53,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:30:53,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:30:53,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:30:53,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:30:53,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:30:53,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:30:53,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:30:53,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:30:53,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:30:53,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:30:53,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:30:53,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:30:53,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:30:53,576 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:30:53,621 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:30:53,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:30:53,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:30:53,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:30:53,626 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:30:53,626 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:30:53,626 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:30:53,626 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:30:53,627 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:30:53,628 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:30:53,628 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:30:53,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:30:53,629 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:30:53,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:30:53,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:30:53,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:30:53,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:30:53,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:30:53,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:30:53,632 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:30:53,632 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:30:53,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:30:53,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:30:53,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:30:53,634 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:30:53,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:30:53,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:30:53,635 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:30:53,635 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:30:53,636 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:30:53,637 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a80d10d797b477078e6dad6d87594a2a0aea1065 [2020-07-29 01:30:53,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:30:54,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:30:54,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:30:54,018 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:30:54,020 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:30:54,021 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Sunset.c [2020-07-29 01:30:54,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/792bda9bc/0ebd5678c37544d58158f46beffd2af6/FLAG3f14ad625 [2020-07-29 01:30:54,554 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:30:54,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Sunset.c [2020-07-29 01:30:54,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/792bda9bc/0ebd5678c37544d58158f46beffd2af6/FLAG3f14ad625 [2020-07-29 01:30:54,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/792bda9bc/0ebd5678c37544d58158f46beffd2af6 [2020-07-29 01:30:54,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:30:54,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:30:54,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:30:54,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:30:54,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:30:54,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:30:54" (1/1) ... [2020-07-29 01:30:54,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a59ad22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:54, skipping insertion in model container [2020-07-29 01:30:54,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:30:54" (1/1) ... [2020-07-29 01:30:54,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:30:54,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:30:55,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:30:55,105 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:30:55,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:30:55,135 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:30:55,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:55 WrapperNode [2020-07-29 01:30:55,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:30:55,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:30:55,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:30:55,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:30:55,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:55" (1/1) ... [2020-07-29 01:30:55,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:55" (1/1) ... [2020-07-29 01:30:55,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:30:55,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:30:55,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:30:55,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:30:55,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:55" (1/1) ... [2020-07-29 01:30:55,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:55" (1/1) ... [2020-07-29 01:30:55,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:55" (1/1) ... [2020-07-29 01:30:55,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:55" (1/1) ... [2020-07-29 01:30:55,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:55" (1/1) ... [2020-07-29 01:30:55,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:55" (1/1) ... [2020-07-29 01:30:55,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:55" (1/1) ... [2020-07-29 01:30:55,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:30:55,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:30:55,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:30:55,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:30:55,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:55" (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 01:30:55,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:30:55,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:30:55,482 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:30:55,483 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:30:55,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:30:55 BoogieIcfgContainer [2020-07-29 01:30:55,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:30:55,487 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:30:55,487 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:30:55,491 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:30:55,492 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:30:55,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:30:54" (1/3) ... [2020-07-29 01:30:55,494 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@589571e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:30:55, skipping insertion in model container [2020-07-29 01:30:55,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:30:55,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:55" (2/3) ... [2020-07-29 01:30:55,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@589571e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:30:55, skipping insertion in model container [2020-07-29 01:30:55,495 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:30:55,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:30:55" (3/3) ... [2020-07-29 01:30:55,497 INFO L371 chiAutomizerObserver]: Analyzing ICFG Sunset.c [2020-07-29 01:30:55,564 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:30:55,564 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:30:55,565 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:30:55,565 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:30:55,565 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:30:55,565 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:30:55,566 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:30:55,566 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:30:55,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:30:55,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:55,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:55,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:55,620 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:30:55,620 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:30:55,620 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:30:55,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:30:55,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:55,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:55,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:55,624 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:30:55,624 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:30:55,633 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 5#L13-1true [2020-07-29 01:30:55,634 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-1true assume !!(main_~i~0 > 10); 3#L10true assume 25 == main_~i~0;main_~i~0 := 30; 8#L10-2true assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 5#L13-1true [2020-07-29 01:30:55,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:55,641 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:30:55,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:55,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970913849] [2020-07-29 01:30:55,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:55,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:55,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:55,734 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:55,736 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 1 times [2020-07-29 01:30:55,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:55,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9825331] [2020-07-29 01:30:55,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:55,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:55,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:55,759 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:55,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:55,761 INFO L82 PathProgramCache]: Analyzing trace with hash 963344, now seen corresponding path program 1 times [2020-07-29 01:30:55,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:55,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950946526] [2020-07-29 01:30:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:55,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:55,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:55,778 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:55,899 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:55,901 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:55,901 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:55,901 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:55,901 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:55,901 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:55,901 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:55,901 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:55,902 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration1_Loop [2020-07-29 01:30:55,902 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:55,904 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:55,937 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 01:30:55,952 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 01:30:55,963 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 01:30:56,116 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:56,116 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:56,135 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:56,135 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:56,146 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:56,147 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:56,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:56,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:56,197 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:56,198 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 01:30:56,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:56,246 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /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 01:30:56,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:56,301 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:56,310 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:56,345 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:56,346 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:56,346 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:56,346 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:56,346 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:56,347 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:56,347 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:56,347 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:56,347 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration1_Loop [2020-07-29 01:30:56,347 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:56,347 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:56,358 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 01:30:56,365 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 01:30:56,375 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 01:30:56,492 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:56,498 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:30:56,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:56,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:56,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:56,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:56,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:56,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:56,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:56,522 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:56,563 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 01:30:56,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:56,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:56,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:56,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:56,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:56,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:56,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:56,574 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:56,582 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:56,583 INFO L444 ModelExtractionUtils]: 0 out of 3 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:56,589 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:56,589 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:56,590 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:56,591 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:56,631 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:56,635 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 > 10);" "assume 25 == main_~i~0;main_~i~0 := 30;" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" [2020-07-29 01:30:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:56,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:56,682 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:56,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:56,696 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {18#unseeded} is VALID [2020-07-29 01:30:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:56,703 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:56,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:56,788 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27))} assume !!(main_~i~0 > 10); {21#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27))} is VALID [2020-07-29 01:30:56,790 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27))} assume 25 == main_~i~0;main_~i~0 := 30; {39#(and (<= 30 ULTIMATE.start_main_~i~0) (<= 2 oldRank0))} is VALID [2020-07-29 01:30:56,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(and (<= 30 ULTIMATE.start_main_~i~0) (<= 2 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {31#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:56,792 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 01:30:56,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:56,815 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 01:30:56,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:56,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,828 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 01:30:56,829 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2020-07-29 01:30:56,921 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 27 states and 35 transitions. Complement of second has 6 states. [2020-07-29 01:30:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:56,922 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:56,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:30:56,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:56,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:56,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:56,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:56,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:30:56,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:56,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:56,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2020-07-29 01:30:56,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:56,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:56,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:56,934 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:30:56,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:56,937 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:56,937 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:56,939 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:30:56,939 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:56,940 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 35 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:56,941 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:56,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:56,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:56,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:56,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:56,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:56,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:56,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:56,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:56,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:56,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:30:56,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:30:56,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:30:56,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:56,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:56,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:56,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:56,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:56,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:56,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:30:56,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:30:56,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:30:56,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:56,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:56,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:56,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:56,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:56,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:56,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:56,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:56,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:56,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:56,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:56,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:56,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:56,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:56,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:56,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:56,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:56,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:56,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:56,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:56,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 35 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:56,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,966 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 01:30:56,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:56,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:56,971 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:56,996 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:56,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:57,000 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {18#unseeded} is VALID [2020-07-29 01:30:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:57,006 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:57,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:57,066 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27))} assume !!(main_~i~0 > 10); {21#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27))} is VALID [2020-07-29 01:30:57,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27))} assume 25 == main_~i~0;main_~i~0 := 30; {85#(and (<= 30 ULTIMATE.start_main_~i~0) (<= 2 oldRank0))} is VALID [2020-07-29 01:30:57,069 INFO L280 TraceCheckUtils]: 2: Hoare triple {85#(and (<= 30 ULTIMATE.start_main_~i~0) (<= 2 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {31#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:57,070 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 01:30:57,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:57,078 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 01:30:57,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,079 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 01:30:57,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2020-07-29 01:30:57,149 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 28 states and 38 transitions. Complement of second has 8 states. [2020-07-29 01:30:57,149 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 01:30:57,149 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:57,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:30:57,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:57,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:57,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:57,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:57,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:30:57,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:57,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:57,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2020-07-29 01:30:57,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:57,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:57,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:57,157 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:30:57,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:57,159 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:57,159 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:57,161 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:30:57,161 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:30:57,161 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:57,162 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:57,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:57,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:57,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:57,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:57,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:57,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:57,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:57,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:57,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:30:57,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:57,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:57,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:57,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:30:57,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:30:57,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:30:57,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:57,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:57,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:57,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:57,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:57,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:57,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:57,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:57,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:57,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:57,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:57,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:57,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:57,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:57,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 38 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:57,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,182 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-07-29 01:30:57,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:57,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:57,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:30:57,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:57,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:57,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:57,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 11 states and 17 transitions. [2020-07-29 01:30:57,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:30:57,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:30:57,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2020-07-29 01:30:57,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:57,198 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-29 01:30:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2020-07-29 01:30:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-29 01:30:57,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:57,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 17 transitions. Second operand 10 states. [2020-07-29 01:30:57,232 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 17 transitions. Second operand 10 states. [2020-07-29 01:30:57,235 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 10 states. [2020-07-29 01:30:57,240 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:57,243 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2020-07-29 01:30:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-07-29 01:30:57,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:57,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:57,246 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states and 17 transitions. [2020-07-29 01:30:57,246 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states and 17 transitions. [2020-07-29 01:30:57,246 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:57,248 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2020-07-29 01:30:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-07-29 01:30:57,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:57,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:57,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:57,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:30:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2020-07-29 01:30:57,252 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-07-29 01:30:57,252 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-07-29 01:30:57,252 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:30:57,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2020-07-29 01:30:57,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:57,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:57,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:57,254 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:30:57,254 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:30:57,254 INFO L794 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 133#L13-1 assume !!(main_~i~0 > 10); 136#L10 assume !(25 == main_~i~0); 129#L10-2 [2020-07-29 01:30:57,254 INFO L796 eck$LassoCheckResult]: Loop: 129#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 134#L13-1 assume !!(main_~i~0 > 10); 128#L10 assume 25 == main_~i~0;main_~i~0 := 30; 129#L10-2 [2020-07-29 01:30:57,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2020-07-29 01:30:57,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:57,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697424607] [2020-07-29 01:30:57,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:57,261 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:57,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:57,265 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:57,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:57,266 INFO L82 PathProgramCache]: Analyzing trace with hash 48373, now seen corresponding path program 2 times [2020-07-29 01:30:57,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:57,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137148118] [2020-07-29 01:30:57,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:57,272 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:57,276 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:57,278 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:57,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash 925833489, now seen corresponding path program 1 times [2020-07-29 01:30:57,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:57,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895747916] [2020-07-29 01:30:57,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:57,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:57,291 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:57,292 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:57,329 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:57,330 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:57,330 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:57,330 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:57,330 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:57,330 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:57,331 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:57,331 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:57,331 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration2_Loop [2020-07-29 01:30:57,331 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:57,331 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:57,339 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 01:30:57,344 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 01:30:57,350 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 01:30:57,450 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:57,450 INFO L404 LassoAnalysis]: Checking for nontermination... 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 01:30:57,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:57,454 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:57,458 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:57,459 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:57,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:57,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:57,506 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:57,506 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 01:30:57,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:57,535 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:57,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:57,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:57,582 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:57,615 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:57,615 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:57,615 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:57,615 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:57,615 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:57,615 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:57,616 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:57,616 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:57,616 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration2_Loop [2020-07-29 01:30:57,616 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:57,616 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:57,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 01:30:57,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 01:30:57,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 01:30:57,728 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:57,728 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:30:57,743 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 01:30:57,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:57,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:57,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:57,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:57,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:57,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:57,754 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:57,792 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 01:30:57,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:57,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:57,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:57,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:57,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:57,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:57,802 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:57,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:57,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:57,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:57,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:57,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:57,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:57,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:57,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:57,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:57,865 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:57,866 INFO L444 ModelExtractionUtils]: 0 out of 3 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:57,871 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:57,872 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:57,872 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:57,872 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 28 Supporting invariants [] Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:57,914 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:57,916 INFO L393 LassoCheck]: Loop: "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" "assume !!(main_~i~0 > 10);" "assume 25 == main_~i~0;main_~i~0 := 30;" [2020-07-29 01:30:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:57,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:57,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:57,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:57,957 INFO L280 TraceCheckUtils]: 0: Hoare triple {194#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {194#unseeded} is VALID [2020-07-29 01:30:57,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {194#unseeded} assume !!(main_~i~0 > 10); {194#unseeded} is VALID [2020-07-29 01:30:57,960 INFO L280 TraceCheckUtils]: 2: Hoare triple {194#unseeded} assume !(25 == main_~i~0); {194#unseeded} is VALID [2020-07-29 01:30:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:57,967 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:57,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:58,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {197#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 28))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {218#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:30:58,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {218#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {218#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:30:58,050 INFO L280 TraceCheckUtils]: 2: Hoare triple {218#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} assume 25 == main_~i~0;main_~i~0 := 30; {207#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 28))) unseeded)} is VALID [2020-07-29 01:30:58,050 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 01:30:58,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:58,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:58,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:58,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,059 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 01:30:58,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:30:58,122 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 22 states and 34 transitions. Complement of second has 5 states. [2020-07-29 01:30:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:58,122 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:58,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. cyclomatic complexity: 7 [2020-07-29 01:30:58,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:58,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:58,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:58,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:58,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:58,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:58,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 34 transitions. [2020-07-29 01:30:58,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:30:58,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:58,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:58,130 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 15 transitions. cyclomatic complexity: 7 [2020-07-29 01:30:58,130 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:58,131 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:58,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:58,132 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:58,132 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 34 transitions. cyclomatic complexity: 16 [2020-07-29 01:30:58,134 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:30:58,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:58,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:58,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:58,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:58,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:58,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:58,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:58,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:58,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:58,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:30:58,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:30:58,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:30:58,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:58,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:58,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:58,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:58,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:58,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:58,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:58,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:58,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:58,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:58,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:58,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:58,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:58,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:58,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:58,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:58,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:58,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:58,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:58,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:58,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:58,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:58,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:58,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:58,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:58,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:58,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:58,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:58,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:58,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:58,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:58,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:58,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:58,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 15 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:58,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:58,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 34 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:58,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,159 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 01:30:58,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:58,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:58,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:30:58,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 34 transitions. cyclomatic complexity: 16 [2020-07-29 01:30:58,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:30:58,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 33 transitions. [2020-07-29 01:30:58,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:30:58,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 01:30:58,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2020-07-29 01:30:58,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:58,178 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-07-29 01:30:58,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2020-07-29 01:30:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-29 01:30:58,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:58,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 33 transitions. Second operand 19 states. [2020-07-29 01:30:58,183 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 33 transitions. Second operand 19 states. [2020-07-29 01:30:58,183 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. Second operand 19 states. [2020-07-29 01:30:58,183 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:58,186 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. [2020-07-29 01:30:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2020-07-29 01:30:58,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:58,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:58,188 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states and 33 transitions. [2020-07-29 01:30:58,188 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states and 33 transitions. [2020-07-29 01:30:58,189 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:58,192 INFO L93 Difference]: Finished difference Result 21 states and 33 transitions. [2020-07-29 01:30:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2020-07-29 01:30:58,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:58,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:58,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:58,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:30:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2020-07-29 01:30:58,196 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2020-07-29 01:30:58,196 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2020-07-29 01:30:58,197 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:30:58,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 30 transitions. [2020-07-29 01:30:58,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:30:58,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:58,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:58,199 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:30:58,199 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:30:58,199 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 259#L13-1 assume !!(main_~i~0 > 10); 266#L10 assume 25 == main_~i~0;main_~i~0 := 30; 267#L10-2 assume !(main_~i~0 <= 30);main_~i~0 := 20; 260#L13-1 [2020-07-29 01:30:58,200 INFO L796 eck$LassoCheckResult]: Loop: 260#L13-1 assume !!(main_~i~0 > 10); 261#L10 assume 25 == main_~i~0;main_~i~0 := 30; 271#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 260#L13-1 [2020-07-29 01:30:58,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:58,200 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 1 times [2020-07-29 01:30:58,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:58,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390644619] [2020-07-29 01:30:58,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:58,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {358#true} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {358#true} is VALID [2020-07-29 01:30:58,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {358#true} assume !!(main_~i~0 > 10); {358#true} is VALID [2020-07-29 01:30:58,387 INFO L280 TraceCheckUtils]: 2: Hoare triple {358#true} assume 25 == main_~i~0;main_~i~0 := 30; {360#(<= ULTIMATE.start_main_~i~0 30)} is VALID [2020-07-29 01:30:58,388 INFO L280 TraceCheckUtils]: 3: Hoare triple {360#(<= ULTIMATE.start_main_~i~0 30)} assume !(main_~i~0 <= 30);main_~i~0 := 20; {359#false} is VALID [2020-07-29 01:30:58,389 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 01:30:58,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390644619] [2020-07-29 01:30:58,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:30:58,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:30:58,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374960218] [2020-07-29 01:30:58,395 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:30:58,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 3 times [2020-07-29 01:30:58,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:58,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233527204] [2020-07-29 01:30:58,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:58,408 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:58,416 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:58,417 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:58,451 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:58,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:58,451 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:58,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:58,451 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:58,452 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:58,452 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:58,452 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:58,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration3_Loop [2020-07-29 01:30:58,452 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:58,452 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:58,459 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 01:30:58,464 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 01:30:58,470 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 01:30:58,570 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:58,570 INFO L404 LassoAnalysis]: Checking for nontermination... 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 01:30:58,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:58,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:58,580 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:58,580 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:58,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:58,609 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 01:30:58,648 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:58,648 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:58,653 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:58,683 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:58,683 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:58,683 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:58,683 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:58,683 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:58,683 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:58,683 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:58,683 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:58,684 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration3_Loop [2020-07-29 01:30:58,684 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:58,684 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:58,690 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 01:30:58,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 01:30:58,700 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 01:30:58,789 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:58,789 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:30:58,795 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 01:30:58,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:58,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:58,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:58,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:58,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:58,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:58,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:58,801 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:58,804 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:58,804 INFO L444 ModelExtractionUtils]: 0 out of 3 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:58,808 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:58,808 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:58,808 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:58,808 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:58,840 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:58,843 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 > 10);" "assume 25 == main_~i~0;main_~i~0 := 30;" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" [2020-07-29 01:30:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:58,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:58,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:58,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:58,873 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {363#unseeded} is VALID [2020-07-29 01:30:58,875 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#unseeded} assume !!(main_~i~0 > 10); {363#unseeded} is VALID [2020-07-29 01:30:58,876 INFO L280 TraceCheckUtils]: 2: Hoare triple {363#unseeded} assume 25 == main_~i~0;main_~i~0 := 30; {363#unseeded} is VALID [2020-07-29 01:30:58,877 INFO L280 TraceCheckUtils]: 3: Hoare triple {363#unseeded} assume !(main_~i~0 <= 30);main_~i~0 := 20; {363#unseeded} is VALID [2020-07-29 01:30:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:58,884 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:58,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:58,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {366#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27))} assume !!(main_~i~0 > 10); {366#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27))} is VALID [2020-07-29 01:30:58,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {366#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27))} assume 25 == main_~i~0;main_~i~0 := 30; {393#(and (<= 30 ULTIMATE.start_main_~i~0) (<= 2 oldRank0))} is VALID [2020-07-29 01:30:58,960 INFO L280 TraceCheckUtils]: 2: Hoare triple {393#(and (<= 30 ULTIMATE.start_main_~i~0) (<= 2 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {376#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:58,960 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 01:30:58,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:58,970 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 01:30:58,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:58,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:58,971 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 01:30:58,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-07-29 01:30:59,019 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 42 states and 66 transitions. Complement of second has 5 states. [2020-07-29 01:30:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:59,022 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:59,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 30 transitions. cyclomatic complexity: 15 [2020-07-29 01:30:59,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:59,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:59,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:59,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:59,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:59,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:59,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 66 transitions. [2020-07-29 01:30:59,025 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 01:30:59,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:59,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:59,025 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 30 transitions. cyclomatic complexity: 15 [2020-07-29 01:30:59,031 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:30:59,031 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:59,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:59,033 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:59,033 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 66 transitions. cyclomatic complexity: 30 [2020-07-29 01:30:59,036 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 01:30:59,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:59,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:59,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:59,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:30:59,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:30:59,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:30:59,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:30:59,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:30:59,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:30:59,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:59,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:59,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:59,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:59,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:59,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:59,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:59,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:59,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:59,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:59,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:59,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:59,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:30:59,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:30:59,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:30:59,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:30:59,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:30:59,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:30:59,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:30:59,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:30:59,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 66 transitions. cyclomatic complexity: 30 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:30:59,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,060 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:30:59,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,061 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:59,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:59,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {363#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {363#unseeded} is VALID [2020-07-29 01:30:59,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#unseeded} assume !!(main_~i~0 > 10); {363#unseeded} is VALID [2020-07-29 01:30:59,088 INFO L280 TraceCheckUtils]: 2: Hoare triple {363#unseeded} assume 25 == main_~i~0;main_~i~0 := 30; {363#unseeded} is VALID [2020-07-29 01:30:59,089 INFO L280 TraceCheckUtils]: 3: Hoare triple {363#unseeded} assume !(main_~i~0 <= 30);main_~i~0 := 20; {363#unseeded} is VALID [2020-07-29 01:30:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,093 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:59,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {366#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27))} assume !!(main_~i~0 > 10); {366#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27))} is VALID [2020-07-29 01:30:59,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {366#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27))} assume 25 == main_~i~0;main_~i~0 := 30; {462#(and (<= 30 ULTIMATE.start_main_~i~0) (<= 2 oldRank0))} is VALID [2020-07-29 01:30:59,159 INFO L280 TraceCheckUtils]: 2: Hoare triple {462#(and (<= 30 ULTIMATE.start_main_~i~0) (<= 2 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {376#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 27)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:59,160 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 01:30:59,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:59,167 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 01:30:59,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,168 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 01:30:59,168 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-07-29 01:30:59,220 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 44 states and 70 transitions. Complement of second has 7 states. [2020-07-29 01:30:59,220 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 01:30:59,220 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:59,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 30 transitions. cyclomatic complexity: 15 [2020-07-29 01:30:59,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:59,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:59,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:59,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:59,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:59,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:59,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 70 transitions. [2020-07-29 01:30:59,223 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 01:30:59,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:59,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:59,224 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 30 transitions. cyclomatic complexity: 15 [2020-07-29 01:30:59,224 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:30:59,224 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:59,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:59,225 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:59,225 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states and 70 transitions. cyclomatic complexity: 34 [2020-07-29 01:30:59,227 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 01:30:59,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:59,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:59,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:59,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 44 letters. Loop has 44 letters. [2020-07-29 01:30:59,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 44 letters. Loop has 44 letters. [2020-07-29 01:30:59,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 44 letters. Loop has 44 letters. [2020-07-29 01:30:59,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:30:59,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:30:59,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:30:59,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:59,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:59,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:59,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:59,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:59,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:59,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:59,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:59,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:30:59,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:59,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:59,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:59,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:30:59,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:30:59,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:30:59,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:30:59,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:30:59,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:30:59,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 30 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 70 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,247 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-07-29 01:30:59,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:30:59,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:30:59,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 70 transitions. cyclomatic complexity: 34 [2020-07-29 01:30:59,251 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 01:30:59,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 68 transitions. [2020-07-29 01:30:59,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-07-29 01:30:59,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-07-29 01:30:59,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 68 transitions. [2020-07-29 01:30:59,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:59,254 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 68 transitions. [2020-07-29 01:30:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 68 transitions. [2020-07-29 01:30:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-29 01:30:59,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:59,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 68 transitions. Second operand 40 states. [2020-07-29 01:30:59,258 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 68 transitions. Second operand 40 states. [2020-07-29 01:30:59,258 INFO L87 Difference]: Start difference. First operand 42 states and 68 transitions. Second operand 40 states. [2020-07-29 01:30:59,259 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:59,262 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-29 01:30:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2020-07-29 01:30:59,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:59,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:59,263 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states and 68 transitions. [2020-07-29 01:30:59,263 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states and 68 transitions. [2020-07-29 01:30:59,263 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:59,267 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-29 01:30:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2020-07-29 01:30:59,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:59,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:59,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:59,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 01:30:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2020-07-29 01:30:59,270 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 63 transitions. [2020-07-29 01:30:59,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:30:59,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:30:59,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:30:59,275 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 3 states. [2020-07-29 01:30:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:30:59,304 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2020-07-29 01:30:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:30:59,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:59,309 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 01:30:59,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2020-07-29 01:30:59,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:30:59,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2020-07-29 01:30:59,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:30:59,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:30:59,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2020-07-29 01:30:59,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:59,313 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2020-07-29 01:30:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2020-07-29 01:30:59,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2020-07-29 01:30:59,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:59,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 36 transitions. Second operand 21 states. [2020-07-29 01:30:59,315 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 36 transitions. Second operand 21 states. [2020-07-29 01:30:59,315 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 21 states. [2020-07-29 01:30:59,316 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:59,317 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-29 01:30:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-29 01:30:59,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:59,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:59,318 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 26 states and 36 transitions. [2020-07-29 01:30:59,318 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 26 states and 36 transitions. [2020-07-29 01:30:59,319 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:59,320 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-29 01:30:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-29 01:30:59,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:59,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:59,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:59,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 01:30:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2020-07-29 01:30:59,323 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-07-29 01:30:59,323 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-07-29 01:30:59,323 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:30:59,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-07-29 01:30:59,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:59,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:59,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:59,324 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2020-07-29 01:30:59,324 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:30:59,324 INFO L794 eck$LassoCheckResult]: Stem: 748#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 749#L13-1 assume !!(main_~i~0 > 10); 760#L10 assume !(25 == main_~i~0); 764#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 756#L13-1 assume !!(main_~i~0 > 10); 744#L10 assume !(25 == main_~i~0); 745#L10-2 [2020-07-29 01:30:59,324 INFO L796 eck$LassoCheckResult]: Loop: 745#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 750#L13-1 assume !!(main_~i~0 > 10); 751#L10 assume 25 == main_~i~0;main_~i~0 := 30; 745#L10-2 [2020-07-29 01:30:59,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:59,325 INFO L82 PathProgramCache]: Analyzing trace with hash 925833491, now seen corresponding path program 1 times [2020-07-29 01:30:59,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:59,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579468712] [2020-07-29 01:30:59,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:59,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:59,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:59,335 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:59,335 INFO L82 PathProgramCache]: Analyzing trace with hash 48373, now seen corresponding path program 4 times [2020-07-29 01:30:59,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:59,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553051767] [2020-07-29 01:30:59,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:59,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:59,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:59,343 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash -774425949, now seen corresponding path program 2 times [2020-07-29 01:30:59,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:59,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661077374] [2020-07-29 01:30:59,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:59,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:59,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:59,367 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:59,392 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:59,392 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:59,392 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:59,392 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:59,392 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:59,392 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:59,393 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:59,393 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:59,393 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration4_Loop [2020-07-29 01:30:59,393 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:59,393 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:59,403 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 01:30:59,409 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 01:30:59,416 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 01:30:59,506 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:59,507 INFO L404 LassoAnalysis]: Checking for nontermination... 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 01:30:59,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:59,517 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:59,548 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:59,548 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:59,553 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:59,575 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:59,575 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:59,575 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:59,575 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:59,575 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:59,576 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:59,576 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:59,576 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:59,576 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration4_Loop [2020-07-29 01:30:59,576 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:59,576 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:59,582 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 01:30:59,589 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 01:30:59,594 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 01:30:59,683 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:59,684 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:59,688 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 01:30:59,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:59,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:59,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:59,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:59,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:59,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:59,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:59,694 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:59,700 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:59,701 INFO L444 ModelExtractionUtils]: 0 out of 3 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:59,708 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:59,708 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:59,708 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:59,708 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 28 Supporting invariants [] Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:59,746 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:59,748 INFO L393 LassoCheck]: Loop: "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" "assume !!(main_~i~0 > 10);" "assume 25 == main_~i~0;main_~i~0 := 30;" [2020-07-29 01:30:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:59,776 INFO L280 TraceCheckUtils]: 0: Hoare triple {873#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {873#unseeded} is VALID [2020-07-29 01:30:59,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {873#unseeded} assume !!(main_~i~0 > 10); {873#unseeded} is VALID [2020-07-29 01:30:59,778 INFO L280 TraceCheckUtils]: 2: Hoare triple {873#unseeded} assume !(25 == main_~i~0); {873#unseeded} is VALID [2020-07-29 01:30:59,778 INFO L280 TraceCheckUtils]: 3: Hoare triple {873#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {873#unseeded} is VALID [2020-07-29 01:30:59,779 INFO L280 TraceCheckUtils]: 4: Hoare triple {873#unseeded} assume !!(main_~i~0 > 10); {873#unseeded} is VALID [2020-07-29 01:30:59,780 INFO L280 TraceCheckUtils]: 5: Hoare triple {873#unseeded} assume !(25 == main_~i~0); {873#unseeded} is VALID [2020-07-29 01:30:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,784 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:59,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {876#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 28))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {906#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:30:59,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {906#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {906#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:30:59,830 INFO L280 TraceCheckUtils]: 2: Hoare triple {906#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} assume 25 == main_~i~0;main_~i~0 := 30; {886#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 28))) unseeded)} is VALID [2020-07-29 01:30:59,831 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 01:30:59,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:59,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:59,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,846 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 01:30:59,846 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 01:30:59,897 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 41 transitions. Complement of second has 5 states. [2020-07-29 01:30:59,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:59,898 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:59,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:30:59,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:59,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:59,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:30:59,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:59,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:59,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:59,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 41 transitions. [2020-07-29 01:30:59,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:59,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:59,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:59,901 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:30:59,901 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:59,901 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:30:59,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:30:59,902 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:59,902 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 41 transitions. cyclomatic complexity: 17 [2020-07-29 01:30:59,903 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:30:59,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:59,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:59,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:59,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:59,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:59,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:30:59,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:59,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:59,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:30:59,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:59,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:59,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:59,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:59,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:59,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:30:59,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:30:59,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:30:59,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,914 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:30:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:30:59,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:30:59,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:59,916 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:59,940 INFO L280 TraceCheckUtils]: 0: Hoare triple {873#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {873#unseeded} is VALID [2020-07-29 01:30:59,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {873#unseeded} assume !!(main_~i~0 > 10); {873#unseeded} is VALID [2020-07-29 01:30:59,941 INFO L280 TraceCheckUtils]: 2: Hoare triple {873#unseeded} assume !(25 == main_~i~0); {873#unseeded} is VALID [2020-07-29 01:30:59,942 INFO L280 TraceCheckUtils]: 3: Hoare triple {873#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {873#unseeded} is VALID [2020-07-29 01:30:59,942 INFO L280 TraceCheckUtils]: 4: Hoare triple {873#unseeded} assume !!(main_~i~0 > 10); {873#unseeded} is VALID [2020-07-29 01:30:59,943 INFO L280 TraceCheckUtils]: 5: Hoare triple {873#unseeded} assume !(25 == main_~i~0); {873#unseeded} is VALID [2020-07-29 01:30:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,948 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:59,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:00,001 INFO L280 TraceCheckUtils]: 0: Hoare triple {876#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 28))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {967#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:00,002 INFO L280 TraceCheckUtils]: 1: Hoare triple {967#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {967#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:00,006 INFO L280 TraceCheckUtils]: 2: Hoare triple {967#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} assume 25 == main_~i~0;main_~i~0 := 30; {886#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 28))) unseeded)} is VALID [2020-07-29 01:31:00,006 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 01:31:00,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:31:00,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:00,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,015 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 01:31:00,015 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 01:31:00,047 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 41 transitions. Complement of second has 5 states. [2020-07-29 01:31:00,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:00,048 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:00,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:31:00,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:00,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:00,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:31:00,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:00,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:00,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:00,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 41 transitions. [2020-07-29 01:31:00,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:00,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:00,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:00,050 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:31:00,050 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:00,050 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:31:00,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:00,051 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:00,051 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 41 transitions. cyclomatic complexity: 17 [2020-07-29 01:31:00,051 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:00,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:31:00,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:31:00,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:31:00,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:31:00,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:31:00,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:31:00,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:00,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:00,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:00,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:00,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:00,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:00,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:00,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:00,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:00,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:00,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:00,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:00,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:00,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:00,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 41 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:00,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,062 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:31:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:31:00,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,063 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:00,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:00,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:00,097 INFO L280 TraceCheckUtils]: 0: Hoare triple {873#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {873#unseeded} is VALID [2020-07-29 01:31:00,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {873#unseeded} assume !!(main_~i~0 > 10); {873#unseeded} is VALID [2020-07-29 01:31:00,103 INFO L280 TraceCheckUtils]: 2: Hoare triple {873#unseeded} assume !(25 == main_~i~0); {873#unseeded} is VALID [2020-07-29 01:31:00,104 INFO L280 TraceCheckUtils]: 3: Hoare triple {873#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {873#unseeded} is VALID [2020-07-29 01:31:00,105 INFO L280 TraceCheckUtils]: 4: Hoare triple {873#unseeded} assume !!(main_~i~0 > 10); {873#unseeded} is VALID [2020-07-29 01:31:00,105 INFO L280 TraceCheckUtils]: 5: Hoare triple {873#unseeded} assume !(25 == main_~i~0); {873#unseeded} is VALID [2020-07-29 01:31:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:00,111 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:31:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:00,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:00,159 INFO L280 TraceCheckUtils]: 0: Hoare triple {876#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 28))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1028#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:00,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {1028#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {1028#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:00,161 INFO L280 TraceCheckUtils]: 2: Hoare triple {1028#(<= 27 (+ oldRank0 ULTIMATE.start_main_~i~0))} assume 25 == main_~i~0;main_~i~0 := 30; {886#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 28))) unseeded)} is VALID [2020-07-29 01:31:00,161 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 01:31:00,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:31:00,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:00,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,169 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 01:31:00,169 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 01:31:00,218 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 31 states and 47 transitions. Complement of second has 6 states. [2020-07-29 01:31:00,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:00,218 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:00,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:31:00,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:00,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:00,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:31:00,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:00,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:00,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:00,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 47 transitions. [2020-07-29 01:31:00,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:31:00,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:00,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:00,221 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:31:00,221 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:00,221 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:31:00,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:00,222 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:00,222 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 47 transitions. cyclomatic complexity: 20 [2020-07-29 01:31:00,223 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:31:00,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 47 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 47 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 47 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:00,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:00,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 47 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:00,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:31:00,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:31:00,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 47 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:31:00,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:00,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:00,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 47 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:00,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 47 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:00,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:00,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 47 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:00,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:00,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:00,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 47 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:00,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 47 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:00,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:00,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 47 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:00,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 47 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,239 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:00,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:31:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-07-29 01:31:00,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:00,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:31:00,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 47 transitions. cyclomatic complexity: 20 [2020-07-29 01:31:00,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:31:00,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 37 transitions. [2020-07-29 01:31:00,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:31:00,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:31:00,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2020-07-29 01:31:00,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:00,245 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-07-29 01:31:00,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2020-07-29 01:31:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 13. [2020-07-29 01:31:00,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:00,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 37 transitions. Second operand 13 states. [2020-07-29 01:31:00,251 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 37 transitions. Second operand 13 states. [2020-07-29 01:31:00,251 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 13 states. [2020-07-29 01:31:00,252 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:00,253 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2020-07-29 01:31:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2020-07-29 01:31:00,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:00,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:00,254 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 26 states and 37 transitions. [2020-07-29 01:31:00,255 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 26 states and 37 transitions. [2020-07-29 01:31:00,255 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:00,257 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2020-07-29 01:31:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2020-07-29 01:31:00,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:00,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:00,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:00,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:31:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-07-29 01:31:00,259 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 01:31:00,259 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 01:31:00,260 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:31:00,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2020-07-29 01:31:00,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:31:00,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:00,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:00,261 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:31:00,261 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:31:00,262 INFO L794 eck$LassoCheckResult]: Stem: 1078#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 1079#L13-1 assume !!(main_~i~0 > 10); 1085#L10 assume !(25 == main_~i~0); 1086#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1080#L13-1 [2020-07-29 01:31:00,262 INFO L796 eck$LassoCheckResult]: Loop: 1080#L13-1 assume !!(main_~i~0 > 10); 1074#L10 assume !(25 == main_~i~0); 1075#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1080#L13-1 [2020-07-29 01:31:00,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:00,262 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 2 times [2020-07-29 01:31:00,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:00,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606030258] [2020-07-29 01:31:00,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:00,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:00,271 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:00,272 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:00,273 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 1 times [2020-07-29 01:31:00,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:00,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565381631] [2020-07-29 01:31:00,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:00,278 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:00,281 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:00,282 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:00,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:00,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1363932832, now seen corresponding path program 3 times [2020-07-29 01:31:00,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:00,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644539717] [2020-07-29 01:31:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:00,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:00,293 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:00,294 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:00,316 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:00,316 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:00,316 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:00,316 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:00,316 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:00,317 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:00,317 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:00,317 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:00,317 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration5_Loop [2020-07-29 01:31:00,317 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:00,317 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:00,323 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 01:31:00,335 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 01:31:00,339 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 01:31:00,474 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:00,474 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:00,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:00,478 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:00,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:00,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:00,535 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:00,537 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:00,537 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:00,537 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:00,537 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:00,537 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:00,538 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:00,538 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:00,538 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:00,538 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration5_Loop [2020-07-29 01:31:00,538 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:00,538 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:00,546 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 01:31:00,551 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 01:31:00,561 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 01:31:00,705 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:00,706 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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:00,714 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 01:31:00,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:00,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:00,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:00,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:00,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:00,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:00,726 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:00,778 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 01:31:00,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:00,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:00,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:00,780 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:31:00,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:00,782 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:31:00,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:00,787 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:00,799 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:31:00,800 INFO L444 ModelExtractionUtils]: 0 out of 3 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:00,815 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:00,815 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:00,815 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:00,815 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:00,847 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:00,850 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 > 10);" "assume !(25 == main_~i~0);" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" [2020-07-29 01:31:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:00,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:00,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:00,875 INFO L280 TraceCheckUtils]: 0: Hoare triple {1189#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {1189#unseeded} is VALID [2020-07-29 01:31:00,875 INFO L280 TraceCheckUtils]: 1: Hoare triple {1189#unseeded} assume !!(main_~i~0 > 10); {1189#unseeded} is VALID [2020-07-29 01:31:00,878 INFO L280 TraceCheckUtils]: 2: Hoare triple {1189#unseeded} assume !(25 == main_~i~0); {1189#unseeded} is VALID [2020-07-29 01:31:00,878 INFO L280 TraceCheckUtils]: 3: Hoare triple {1189#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1189#unseeded} is VALID [2020-07-29 01:31:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:00,882 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:00,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:00,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {1192#(>= oldRank0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 > 10); {1216#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} is VALID [2020-07-29 01:31:00,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {1216#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} assume !(25 == main_~i~0); {1216#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} is VALID [2020-07-29 01:31:00,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {1216#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1202#(or (and (> oldRank0 ULTIMATE.start_main_~i~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:31:00,909 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 01:31:00,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:31:00,916 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 01:31:00,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:31:00,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,917 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 01:31:00,917 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 01:31:00,965 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 5 states. [2020-07-29 01:31:00,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:00,966 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:00,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. cyclomatic complexity: 8 [2020-07-29 01:31:00,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:00,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:00,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:31:00,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:00,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:00,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:00,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2020-07-29 01:31:00,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:31:00,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:00,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:00,970 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 19 transitions. cyclomatic complexity: 8 [2020-07-29 01:31:00,970 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:00,970 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:31:00,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:00,971 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:00,971 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 47 transitions. cyclomatic complexity: 15 [2020-07-29 01:31:00,972 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:00,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:31:00,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:31:00,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:31:00,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:00,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:00,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:00,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:00,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:31:00,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:31:00,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:31:00,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:00,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:00,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:00,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:00,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:00,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:00,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:31:00,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:31:00,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:31:00,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:00,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:00,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:31:01,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:31:01,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:31:01,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:31:01,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,006 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:31:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:31:01,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:31:01,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:01,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. cyclomatic complexity: 15 [2020-07-29 01:31:01,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:31:01,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 39 transitions. [2020-07-29 01:31:01,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:31:01,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:31:01,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2020-07-29 01:31:01,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:01,011 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2020-07-29 01:31:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2020-07-29 01:31:01,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2020-07-29 01:31:01,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:01,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 39 transitions. Second operand 24 states. [2020-07-29 01:31:01,014 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 39 transitions. Second operand 24 states. [2020-07-29 01:31:01,014 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 24 states. [2020-07-29 01:31:01,015 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:01,016 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2020-07-29 01:31:01,016 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2020-07-29 01:31:01,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:01,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:01,021 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 29 states and 39 transitions. [2020-07-29 01:31:01,021 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 29 states and 39 transitions. [2020-07-29 01:31:01,021 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:01,024 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-29 01:31:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2020-07-29 01:31:01,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:01,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:01,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:01,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:31:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2020-07-29 01:31:01,028 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2020-07-29 01:31:01,028 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2020-07-29 01:31:01,028 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:31:01,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2020-07-29 01:31:01,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:31:01,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:01,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:01,029 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-07-29 01:31:01,029 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:31:01,030 INFO L794 eck$LassoCheckResult]: Stem: 1269#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 1270#L13-1 assume !!(main_~i~0 > 10); 1286#L10 assume !(25 == main_~i~0); 1287#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1273#L13-1 assume !!(main_~i~0 > 10); 1274#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1277#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1271#L13-1 [2020-07-29 01:31:01,030 INFO L796 eck$LassoCheckResult]: Loop: 1271#L13-1 assume !!(main_~i~0 > 10); 1272#L10 assume !(25 == main_~i~0); 1288#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1271#L13-1 [2020-07-29 01:31:01,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1363932894, now seen corresponding path program 3 times [2020-07-29 01:31:01,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:01,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424492250] [2020-07-29 01:31:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:01,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:01,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:01,068 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:01,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:01,069 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 2 times [2020-07-29 01:31:01,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:01,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470148910] [2020-07-29 01:31:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:01,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:01,090 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:01,098 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:01,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1760752396, now seen corresponding path program 4 times [2020-07-29 01:31:01,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:01,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541194462] [2020-07-29 01:31:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:01,120 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:01,124 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:01,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:01,169 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:01,170 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:01,170 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:01,170 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:01,170 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:01,170 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:01,170 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:01,171 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:01,171 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration6_Loop [2020-07-29 01:31:01,171 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:01,171 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:01,182 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 01:31:01,192 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 01:31:01,197 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 01:31:01,314 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:01,314 INFO L404 LassoAnalysis]: Checking for nontermination... 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 01:31:01,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:01,317 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:01,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:01,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:01,387 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:01,389 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:01,389 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:01,389 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:01,389 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:01,389 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:01,389 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:01,389 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:01,389 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:01,389 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration6_Loop [2020-07-29 01:31:01,389 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:01,390 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:01,402 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 01:31:01,411 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 01:31:01,415 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 01:31:01,538 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:01,539 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:01,542 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 01:31:01,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:01,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:01,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:01,544 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:31:01,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:01,547 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:31:01,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:01,550 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:01,561 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:31:01,561 INFO L444 ModelExtractionUtils]: 1 out of 3 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:01,564 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:01,564 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:01,564 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:01,564 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:01,587 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:01,589 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 > 10);" "assume !(25 == main_~i~0);" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" [2020-07-29 01:31:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:01,617 INFO L280 TraceCheckUtils]: 0: Hoare triple {1412#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {1412#unseeded} is VALID [2020-07-29 01:31:01,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {1412#unseeded} assume !!(main_~i~0 > 10); {1412#unseeded} is VALID [2020-07-29 01:31:01,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {1412#unseeded} assume !(25 == main_~i~0); {1412#unseeded} is VALID [2020-07-29 01:31:01,619 INFO L280 TraceCheckUtils]: 3: Hoare triple {1412#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1412#unseeded} is VALID [2020-07-29 01:31:01,620 INFO L280 TraceCheckUtils]: 4: Hoare triple {1412#unseeded} assume !!(main_~i~0 > 10); {1412#unseeded} is VALID [2020-07-29 01:31:01,624 INFO L280 TraceCheckUtils]: 5: Hoare triple {1412#unseeded} assume 25 == main_~i~0;main_~i~0 := 30; {1412#unseeded} is VALID [2020-07-29 01:31:01,626 INFO L280 TraceCheckUtils]: 6: Hoare triple {1412#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1412#unseeded} is VALID [2020-07-29 01:31:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,634 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:01,651 INFO L280 TraceCheckUtils]: 0: Hoare triple {1415#(>= oldRank0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 > 10); {1448#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} is VALID [2020-07-29 01:31:01,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {1448#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} assume !(25 == main_~i~0); {1448#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} is VALID [2020-07-29 01:31:01,653 INFO L280 TraceCheckUtils]: 2: Hoare triple {1448#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1425#(or (and (> oldRank0 ULTIMATE.start_main_~i~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:31:01,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 01:31:01,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:31:01,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:01,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,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 01:31:01,661 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 01:31:01,688 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 5 states. [2020-07-29 01:31:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:01,688 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:01,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 01:31:01,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:01,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:01,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:31:01,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:01,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:01,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:01,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2020-07-29 01:31:01,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:31:01,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:01,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:01,690 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 01:31:01,691 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:01,691 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:31:01,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:01,692 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:01,692 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 47 transitions. cyclomatic complexity: 15 [2020-07-29 01:31:01,692 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:01,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:31:01,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:31:01,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:31:01,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:31:01,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:31:01,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:31:01,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:01,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:01,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:01,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,700 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:31:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:31:01,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,702 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:01,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:01,738 INFO L280 TraceCheckUtils]: 0: Hoare triple {1412#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {1412#unseeded} is VALID [2020-07-29 01:31:01,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {1412#unseeded} assume !!(main_~i~0 > 10); {1412#unseeded} is VALID [2020-07-29 01:31:01,739 INFO L280 TraceCheckUtils]: 2: Hoare triple {1412#unseeded} assume !(25 == main_~i~0); {1412#unseeded} is VALID [2020-07-29 01:31:01,740 INFO L280 TraceCheckUtils]: 3: Hoare triple {1412#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1412#unseeded} is VALID [2020-07-29 01:31:01,741 INFO L280 TraceCheckUtils]: 4: Hoare triple {1412#unseeded} assume !!(main_~i~0 > 10); {1412#unseeded} is VALID [2020-07-29 01:31:01,741 INFO L280 TraceCheckUtils]: 5: Hoare triple {1412#unseeded} assume 25 == main_~i~0;main_~i~0 := 30; {1412#unseeded} is VALID [2020-07-29 01:31:01,742 INFO L280 TraceCheckUtils]: 6: Hoare triple {1412#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1412#unseeded} is VALID [2020-07-29 01:31:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,745 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:01,776 INFO L280 TraceCheckUtils]: 0: Hoare triple {1415#(>= oldRank0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 > 10); {1519#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} is VALID [2020-07-29 01:31:01,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {1519#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} assume !(25 == main_~i~0); {1519#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} is VALID [2020-07-29 01:31:01,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {1519#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1425#(or (and (> oldRank0 ULTIMATE.start_main_~i~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:31:01,780 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 01:31:01,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:31:01,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:01,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,788 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 01:31:01,788 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 01:31:01,811 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 5 states. [2020-07-29 01:31:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:01,812 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:01,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 01:31:01,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:01,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:01,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:31:01,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:01,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:01,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:01,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2020-07-29 01:31:01,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:31:01,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:01,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:01,814 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 01:31:01,814 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:01,815 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:31:01,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:01,816 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:01,816 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 47 transitions. cyclomatic complexity: 15 [2020-07-29 01:31:01,816 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:01,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:31:01,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:31:01,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:31:01,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:31:01,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:31:01,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:31:01,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:01,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:01,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:01,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,827 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:31:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:31:01,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,827 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:01,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:01,854 INFO L280 TraceCheckUtils]: 0: Hoare triple {1412#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {1412#unseeded} is VALID [2020-07-29 01:31:01,855 INFO L280 TraceCheckUtils]: 1: Hoare triple {1412#unseeded} assume !!(main_~i~0 > 10); {1412#unseeded} is VALID [2020-07-29 01:31:01,856 INFO L280 TraceCheckUtils]: 2: Hoare triple {1412#unseeded} assume !(25 == main_~i~0); {1412#unseeded} is VALID [2020-07-29 01:31:01,857 INFO L280 TraceCheckUtils]: 3: Hoare triple {1412#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1412#unseeded} is VALID [2020-07-29 01:31:01,861 INFO L280 TraceCheckUtils]: 4: Hoare triple {1412#unseeded} assume !!(main_~i~0 > 10); {1412#unseeded} is VALID [2020-07-29 01:31:01,861 INFO L280 TraceCheckUtils]: 5: Hoare triple {1412#unseeded} assume 25 == main_~i~0;main_~i~0 := 30; {1412#unseeded} is VALID [2020-07-29 01:31:01,862 INFO L280 TraceCheckUtils]: 6: Hoare triple {1412#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1412#unseeded} is VALID [2020-07-29 01:31:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,872 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:01,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:01,895 INFO L280 TraceCheckUtils]: 0: Hoare triple {1415#(>= oldRank0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 > 10); {1590#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} is VALID [2020-07-29 01:31:01,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {1590#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} assume !(25 == main_~i~0); {1590#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} is VALID [2020-07-29 01:31:01,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {1590#(and (< 10 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1425#(or (and (> oldRank0 ULTIMATE.start_main_~i~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:31:01,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 01:31:01,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:31:01,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:01,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,905 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 01:31:01,905 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 01:31:01,937 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 37 states and 52 transitions. Complement of second has 4 states. [2020-07-29 01:31:01,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:01,937 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:01,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 01:31:01,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:01,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:01,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:31:01,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:01,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:01,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:01,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 52 transitions. [2020-07-29 01:31:01,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:31:01,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:01,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:01,940 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 34 transitions. cyclomatic complexity: 13 [2020-07-29 01:31:01,940 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:01,941 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:31:01,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:01,941 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:01,941 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 52 transitions. cyclomatic complexity: 18 [2020-07-29 01:31:01,942 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:01,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 52 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 52 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:31:01,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:31:01,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 52 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:31:01,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:31:01,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:31:01,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 52 transitions. cyclomatic complexity: 18 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:31:01,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:31:01,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:31:01,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 52 transitions. cyclomatic complexity: 18 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:31:01,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:01,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:01,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 52 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:01,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 52 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 52 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:31:01,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 52 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:31:01,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 52 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:01,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 34 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:31:01,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:31:01,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 52 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:31:01,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,954 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:31:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 01:31:01,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:31:01,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:31:01,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:31:01,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:01,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 52 transitions. cyclomatic complexity: 18 [2020-07-29 01:31:01,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:31:01,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 28 states and 38 transitions. [2020-07-29 01:31:01,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:31:01,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:31:01,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2020-07-29 01:31:01,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:01,959 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-29 01:31:01,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2020-07-29 01:31:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2020-07-29 01:31:01,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:01,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 38 transitions. Second operand 18 states. [2020-07-29 01:31:01,961 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 38 transitions. Second operand 18 states. [2020-07-29 01:31:01,962 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 18 states. [2020-07-29 01:31:01,962 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:01,966 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2020-07-29 01:31:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2020-07-29 01:31:01,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:01,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:01,967 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 28 states and 38 transitions. [2020-07-29 01:31:01,967 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 28 states and 38 transitions. [2020-07-29 01:31:01,968 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:01,969 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2020-07-29 01:31:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-29 01:31:01,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:01,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:01,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:01,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:31:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2020-07-29 01:31:01,972 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 01:31:01,972 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 01:31:01,972 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:31:01,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2020-07-29 01:31:01,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:31:01,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:01,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:01,974 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:31:01,974 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2020-07-29 01:31:01,974 INFO L794 eck$LassoCheckResult]: Stem: 1643#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 1644#L13-1 assume !!(main_~i~0 > 10); 1656#L10 assume !(25 == main_~i~0); 1657#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1645#L13-1 [2020-07-29 01:31:01,974 INFO L796 eck$LassoCheckResult]: Loop: 1645#L13-1 assume !!(main_~i~0 > 10); 1642#L10 assume !(25 == main_~i~0); 1641#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1648#L13-1 assume !!(main_~i~0 > 10); 1651#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1650#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1645#L13-1 [2020-07-29 01:31:01,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:01,975 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 4 times [2020-07-29 01:31:01,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:01,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521414693] [2020-07-29 01:31:01,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:01,980 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:01,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:01,984 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:01,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1188224067, now seen corresponding path program 1 times [2020-07-29 01:31:01,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:01,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037824774] [2020-07-29 01:31:01,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:01,989 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:01,992 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:01,994 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:01,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:01,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1762599376, now seen corresponding path program 5 times [2020-07-29 01:31:01,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:01,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629981662] [2020-07-29 01:31:01,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:02,000 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:02,004 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:02,006 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:02,038 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:02,038 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:02,038 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:02,038 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:02,038 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:02,039 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:02,039 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:02,039 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:02,039 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration7_Loop [2020-07-29 01:31:02,039 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:02,039 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:02,045 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 01:31:02,054 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 01:31:02,058 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 01:31:02,139 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:02,139 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:02,143 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:02,143 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:02,171 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:02,171 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:02,175 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:02,196 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:02,196 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:02,196 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:02,196 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:02,196 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:02,196 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:02,196 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:02,197 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:02,197 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration7_Loop [2020-07-29 01:31:02,197 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:02,197 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:02,202 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 01:31:02,209 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 01:31:02,214 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 01:31:02,302 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:02,302 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:02,304 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 01:31:02,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:02,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:02,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:02,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:02,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:02,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:02,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:02,310 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:02,314 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:31:02,314 INFO L444 ModelExtractionUtils]: 0 out of 3 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 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:02,317 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:02,317 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:02,317 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:02,317 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 55 Supporting invariants [] [2020-07-29 01:31:02,339 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:02,342 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 > 10);" "assume !(25 == main_~i~0);" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" "assume !!(main_~i~0 > 10);" "assume 25 == main_~i~0;main_~i~0 := 30;" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" [2020-07-29 01:31:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:02,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:02,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:02,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:02,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {1779#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {1779#unseeded} is VALID [2020-07-29 01:31:02,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {1779#unseeded} assume !!(main_~i~0 > 10); {1779#unseeded} is VALID [2020-07-29 01:31:02,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {1779#unseeded} assume !(25 == main_~i~0); {1779#unseeded} is VALID [2020-07-29 01:31:02,372 INFO L280 TraceCheckUtils]: 3: Hoare triple {1779#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1779#unseeded} is VALID [2020-07-29 01:31:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:02,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:31:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:02,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:02,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {1782#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume !!(main_~i~0 > 10); {1782#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} is VALID [2020-07-29 01:31:02,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {1782#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume !(25 == main_~i~0); {1782#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} is VALID [2020-07-29 01:31:02,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {1782#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1812#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:31:02,472 INFO L280 TraceCheckUtils]: 3: Hoare triple {1812#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} assume !!(main_~i~0 > 10); {1812#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:31:02,473 INFO L280 TraceCheckUtils]: 4: Hoare triple {1812#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} assume 25 == main_~i~0;main_~i~0 := 30; {1819#(and (<= (div (+ oldRank0 (- 55)) (- 2)) 26) (<= 30 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:02,474 INFO L280 TraceCheckUtils]: 5: Hoare triple {1819#(and (<= (div (+ oldRank0 (- 55)) (- 2)) 26) (<= 30 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1792#(or unseeded (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55)) (>= oldRank0 0)))} is VALID [2020-07-29 01:31:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:02,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:31:02,487 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 01:31:02,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,488 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:31:02,488 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-07-29 01:31:02,536 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 74 transitions. Complement of second has 7 states. [2020-07-29 01:31:02,536 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 01:31:02,536 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:02,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. cyclomatic complexity: 10 [2020-07-29 01:31:02,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:02,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:02,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:31:02,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:02,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:02,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:02,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 74 transitions. [2020-07-29 01:31:02,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:31:02,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:02,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:02,539 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 26 transitions. cyclomatic complexity: 10 [2020-07-29 01:31:02,540 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:02,540 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:31:02,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:02,541 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:02,541 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 74 transitions. cyclomatic complexity: 23 [2020-07-29 01:31:02,541 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:02,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:02,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:02,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:02,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:02,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:02,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:02,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 55 letters. Loop has 55 letters. [2020-07-29 01:31:02,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 55 letters. Loop has 55 letters. [2020-07-29 01:31:02,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 55 letters. Loop has 55 letters. [2020-07-29 01:31:02,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:31:02,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:31:02,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:31:02,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:02,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:02,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:02,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:02,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:02,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:02,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:02,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:02,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:02,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,551 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:31:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:31:02,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,553 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:02,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:02,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:02,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:02,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {1779#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {1779#unseeded} is VALID [2020-07-29 01:31:02,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {1779#unseeded} assume !!(main_~i~0 > 10); {1779#unseeded} is VALID [2020-07-29 01:31:02,583 INFO L280 TraceCheckUtils]: 2: Hoare triple {1779#unseeded} assume !(25 == main_~i~0); {1779#unseeded} is VALID [2020-07-29 01:31:02,584 INFO L280 TraceCheckUtils]: 3: Hoare triple {1779#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1779#unseeded} is VALID [2020-07-29 01:31:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:02,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:31:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:02,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:02,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {1782#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume !!(main_~i~0 > 10); {1782#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} is VALID [2020-07-29 01:31:02,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {1782#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume !(25 == main_~i~0); {1782#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} is VALID [2020-07-29 01:31:02,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {1782#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1907#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:31:02,682 INFO L280 TraceCheckUtils]: 3: Hoare triple {1907#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} assume !!(main_~i~0 > 10); {1907#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:31:02,683 INFO L280 TraceCheckUtils]: 4: Hoare triple {1907#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} assume 25 == main_~i~0;main_~i~0 := 30; {1914#(and (<= (div (+ oldRank0 (- 55)) (- 2)) 26) (<= 30 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:02,684 INFO L280 TraceCheckUtils]: 5: Hoare triple {1914#(and (<= (div (+ oldRank0 (- 55)) (- 2)) 26) (<= 30 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {1792#(or unseeded (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55)) (>= oldRank0 0)))} is VALID [2020-07-29 01:31:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:02,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:31:02,702 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 01:31:02,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,702 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:31:02,703 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-07-29 01:31:02,758 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 48 states and 64 transitions. Complement of second has 9 states. [2020-07-29 01:31:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:02,758 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:02,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. cyclomatic complexity: 10 [2020-07-29 01:31:02,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:02,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:02,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:31:02,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:31:02,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:02,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:02,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 64 transitions. [2020-07-29 01:31:02,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:31:02,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:02,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:02,760 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 26 transitions. cyclomatic complexity: 10 [2020-07-29 01:31:02,760 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:02,760 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:31:02,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:31:02,761 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:02,761 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 64 transitions. cyclomatic complexity: 20 [2020-07-29 01:31:02,761 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:02,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:02,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:02,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:02,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:02,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:02,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:02,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:31:02,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:31:02,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 20 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:31:02,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:31:02,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:31:02,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:31:02,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:02,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:02,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:02,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:02,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:02,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:02,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 26 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:02,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:02,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 64 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:02,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,766 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:31:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-07-29 01:31:02,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 01:31:02,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:31:02,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:02,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:02,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. cyclomatic complexity: 20 [2020-07-29 01:31:02,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:31:02,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 52 transitions. [2020-07-29 01:31:02,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:31:02,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:31:02,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 52 transitions. [2020-07-29 01:31:02,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:02,770 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 52 transitions. [2020-07-29 01:31:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 52 transitions. [2020-07-29 01:31:02,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-29 01:31:02,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:02,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 52 transitions. Second operand 31 states. [2020-07-29 01:31:02,772 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 52 transitions. Second operand 31 states. [2020-07-29 01:31:02,773 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand 31 states. [2020-07-29 01:31:02,773 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:02,774 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2020-07-29 01:31:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2020-07-29 01:31:02,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:02,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:02,775 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 38 states and 52 transitions. [2020-07-29 01:31:02,775 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 38 states and 52 transitions. [2020-07-29 01:31:02,775 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:02,776 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2020-07-29 01:31:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2020-07-29 01:31:02,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:02,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:02,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:02,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 01:31:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2020-07-29 01:31:02,778 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-07-29 01:31:02,778 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-07-29 01:31:02,778 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:31:02,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2020-07-29 01:31:02,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:31:02,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:02,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:02,779 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1] [2020-07-29 01:31:02,779 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2020-07-29 01:31:02,779 INFO L794 eck$LassoCheckResult]: Stem: 1983#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 1984#L13-1 assume !!(main_~i~0 > 10); 1991#L10 assume !(25 == main_~i~0); 1992#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1985#L13-1 assume !!(main_~i~0 > 10); 1987#L10 assume !(25 == main_~i~0); 2008#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2004#L13-1 assume !!(main_~i~0 > 10); 2005#L10 assume !(25 == main_~i~0); 2003#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1994#L13-1 assume !!(main_~i~0 > 10); 2002#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1993#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1995#L13-1 [2020-07-29 01:31:02,779 INFO L796 eck$LassoCheckResult]: Loop: 1995#L13-1 assume !!(main_~i~0 > 10); 2005#L10 assume !(25 == main_~i~0); 2003#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1994#L13-1 assume !!(main_~i~0 > 10); 2002#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1993#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1995#L13-1 [2020-07-29 01:31:02,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:02,780 INFO L82 PathProgramCache]: Analyzing trace with hash -670293406, now seen corresponding path program 6 times [2020-07-29 01:31:02,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:02,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418701048] [2020-07-29 01:31:02,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:02,786 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:02,791 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:02,792 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:02,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:02,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1188224067, now seen corresponding path program 2 times [2020-07-29 01:31:02,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:02,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232631112] [2020-07-29 01:31:02,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:02,797 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:02,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:02,801 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:02,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2063994396, now seen corresponding path program 7 times [2020-07-29 01:31:02,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:02,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002873866] [2020-07-29 01:31:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:02,846 INFO L280 TraceCheckUtils]: 0: Hoare triple {2159#true} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {2159#true} is VALID [2020-07-29 01:31:02,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {2159#true} assume !!(main_~i~0 > 10); {2159#true} is VALID [2020-07-29 01:31:02,847 INFO L280 TraceCheckUtils]: 2: Hoare triple {2159#true} assume !(25 == main_~i~0); {2159#true} is VALID [2020-07-29 01:31:02,847 INFO L280 TraceCheckUtils]: 3: Hoare triple {2159#true} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2159#true} is VALID [2020-07-29 01:31:02,847 INFO L280 TraceCheckUtils]: 4: Hoare triple {2159#true} assume !!(main_~i~0 > 10); {2159#true} is VALID [2020-07-29 01:31:02,847 INFO L280 TraceCheckUtils]: 5: Hoare triple {2159#true} assume !(25 == main_~i~0); {2159#true} is VALID [2020-07-29 01:31:02,847 INFO L280 TraceCheckUtils]: 6: Hoare triple {2159#true} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2159#true} is VALID [2020-07-29 01:31:02,848 INFO L280 TraceCheckUtils]: 7: Hoare triple {2159#true} assume !!(main_~i~0 > 10); {2159#true} is VALID [2020-07-29 01:31:02,848 INFO L280 TraceCheckUtils]: 8: Hoare triple {2159#true} assume !(25 == main_~i~0); {2159#true} is VALID [2020-07-29 01:31:02,848 INFO L280 TraceCheckUtils]: 9: Hoare triple {2159#true} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2159#true} is VALID [2020-07-29 01:31:02,848 INFO L280 TraceCheckUtils]: 10: Hoare triple {2159#true} assume !!(main_~i~0 > 10); {2159#true} is VALID [2020-07-29 01:31:02,855 INFO L280 TraceCheckUtils]: 11: Hoare triple {2159#true} assume 25 == main_~i~0;main_~i~0 := 30; {2161#(<= 30 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:31:02,856 INFO L280 TraceCheckUtils]: 12: Hoare triple {2161#(<= 30 ULTIMATE.start_main_~i~0)} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2162#(<= 29 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:31:02,860 INFO L280 TraceCheckUtils]: 13: Hoare triple {2162#(<= 29 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 > 10); {2162#(<= 29 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:31:02,861 INFO L280 TraceCheckUtils]: 14: Hoare triple {2162#(<= 29 ULTIMATE.start_main_~i~0)} assume !(25 == main_~i~0); {2162#(<= 29 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:31:02,862 INFO L280 TraceCheckUtils]: 15: Hoare triple {2162#(<= 29 ULTIMATE.start_main_~i~0)} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2163#(<= 28 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:31:02,863 INFO L280 TraceCheckUtils]: 16: Hoare triple {2163#(<= 28 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 > 10); {2163#(<= 28 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:31:02,863 INFO L280 TraceCheckUtils]: 17: Hoare triple {2163#(<= 28 ULTIMATE.start_main_~i~0)} assume 25 == main_~i~0;main_~i~0 := 30; {2160#false} is VALID [2020-07-29 01:31:02,864 INFO L280 TraceCheckUtils]: 18: Hoare triple {2160#false} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2160#false} is VALID [2020-07-29 01:31:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-29 01:31:02,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002873866] [2020-07-29 01:31:02,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506748417] [2020-07-29 01:31:02,866 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:31:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:02,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:02,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:02,984 INFO L280 TraceCheckUtils]: 0: Hoare triple {2159#true} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {2159#true} is VALID [2020-07-29 01:31:02,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {2159#true} assume !!(main_~i~0 > 10); {2159#true} is VALID [2020-07-29 01:31:02,985 INFO L280 TraceCheckUtils]: 2: Hoare triple {2159#true} assume !(25 == main_~i~0); {2159#true} is VALID [2020-07-29 01:31:02,985 INFO L280 TraceCheckUtils]: 3: Hoare triple {2159#true} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2159#true} is VALID [2020-07-29 01:31:02,986 INFO L280 TraceCheckUtils]: 4: Hoare triple {2159#true} assume !!(main_~i~0 > 10); {2159#true} is VALID [2020-07-29 01:31:02,986 INFO L280 TraceCheckUtils]: 5: Hoare triple {2159#true} assume !(25 == main_~i~0); {2159#true} is VALID [2020-07-29 01:31:02,986 INFO L280 TraceCheckUtils]: 6: Hoare triple {2159#true} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2159#true} is VALID [2020-07-29 01:31:02,987 INFO L280 TraceCheckUtils]: 7: Hoare triple {2159#true} assume !!(main_~i~0 > 10); {2159#true} is VALID [2020-07-29 01:31:02,987 INFO L280 TraceCheckUtils]: 8: Hoare triple {2159#true} assume !(25 == main_~i~0); {2159#true} is VALID [2020-07-29 01:31:02,987 INFO L280 TraceCheckUtils]: 9: Hoare triple {2159#true} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2159#true} is VALID [2020-07-29 01:31:02,987 INFO L280 TraceCheckUtils]: 10: Hoare triple {2159#true} assume !!(main_~i~0 > 10); {2159#true} is VALID [2020-07-29 01:31:02,989 INFO L280 TraceCheckUtils]: 11: Hoare triple {2159#true} assume 25 == main_~i~0;main_~i~0 := 30; {2161#(<= 30 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:31:02,990 INFO L280 TraceCheckUtils]: 12: Hoare triple {2161#(<= 30 ULTIMATE.start_main_~i~0)} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2162#(<= 29 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:31:02,991 INFO L280 TraceCheckUtils]: 13: Hoare triple {2162#(<= 29 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 > 10); {2162#(<= 29 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:31:02,991 INFO L280 TraceCheckUtils]: 14: Hoare triple {2162#(<= 29 ULTIMATE.start_main_~i~0)} assume !(25 == main_~i~0); {2162#(<= 29 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:31:02,992 INFO L280 TraceCheckUtils]: 15: Hoare triple {2162#(<= 29 ULTIMATE.start_main_~i~0)} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2163#(<= 28 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:31:02,993 INFO L280 TraceCheckUtils]: 16: Hoare triple {2163#(<= 28 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 > 10); {2163#(<= 28 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:31:02,994 INFO L280 TraceCheckUtils]: 17: Hoare triple {2163#(<= 28 ULTIMATE.start_main_~i~0)} assume 25 == main_~i~0;main_~i~0 := 30; {2160#false} is VALID [2020-07-29 01:31:02,994 INFO L280 TraceCheckUtils]: 18: Hoare triple {2160#false} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2160#false} is VALID [2020-07-29 01:31:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-29 01:31:02,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:31:02,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-29 01:31:02,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889090305] [2020-07-29 01:31:03,035 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:03,035 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:03,035 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:03,035 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:03,036 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:03,036 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:03,036 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:03,036 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:03,036 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration8_Loop [2020-07-29 01:31:03,036 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:03,036 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:03,042 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 01:31:03,046 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 01:31:03,053 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 01:31:03,124 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:03,124 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:03,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:03,128 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:03,131 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:03,132 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:03,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:03,158 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:03,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:03,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:03,199 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:03,225 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:03,225 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:03,225 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:03,225 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:03,225 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:03,225 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:03,226 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:03,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:03,226 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration8_Loop [2020-07-29 01:31:03,226 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:03,226 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:03,231 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 01:31:03,235 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 01:31:03,243 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 01:31:03,322 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:03,322 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:03,326 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 01:31:03,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:03,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:03,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:03,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:03,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:03,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:03,334 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:03,358 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 01:31:03,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:03,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:03,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:03,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:03,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:03,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:03,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:03,362 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:03,364 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:31:03,364 INFO L444 ModelExtractionUtils]: 0 out of 3 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:03,367 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:03,367 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:03,368 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:03,368 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 55 Supporting invariants [] [2020-07-29 01:31:03,389 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:03,391 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 > 10);" "assume !(25 == main_~i~0);" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" "assume !!(main_~i~0 > 10);" "assume 25 == main_~i~0;main_~i~0 := 30;" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" [2020-07-29 01:31:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:03,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:03,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:03,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:03,435 INFO L280 TraceCheckUtils]: 0: Hoare triple {2218#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {2218#unseeded} is VALID [2020-07-29 01:31:03,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:03,438 INFO L280 TraceCheckUtils]: 2: Hoare triple {2218#unseeded} assume !(25 == main_~i~0); {2218#unseeded} is VALID [2020-07-29 01:31:03,440 INFO L280 TraceCheckUtils]: 3: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:03,444 INFO L280 TraceCheckUtils]: 4: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:03,445 INFO L280 TraceCheckUtils]: 5: Hoare triple {2218#unseeded} assume !(25 == main_~i~0); {2218#unseeded} is VALID [2020-07-29 01:31:03,446 INFO L280 TraceCheckUtils]: 6: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:03,448 INFO L280 TraceCheckUtils]: 7: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:03,452 INFO L280 TraceCheckUtils]: 8: Hoare triple {2218#unseeded} assume !(25 == main_~i~0); {2218#unseeded} is VALID [2020-07-29 01:31:03,452 INFO L280 TraceCheckUtils]: 9: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:03,453 INFO L280 TraceCheckUtils]: 10: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:03,453 INFO L280 TraceCheckUtils]: 11: Hoare triple {2218#unseeded} assume 25 == main_~i~0;main_~i~0 := 30; {2218#unseeded} is VALID [2020-07-29 01:31:03,454 INFO L280 TraceCheckUtils]: 12: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:03,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:31:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:03,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:03,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume !!(main_~i~0 > 10); {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} is VALID [2020-07-29 01:31:03,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume !(25 == main_~i~0); {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} is VALID [2020-07-29 01:31:03,564 INFO L280 TraceCheckUtils]: 2: Hoare triple {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2278#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:31:03,565 INFO L280 TraceCheckUtils]: 3: Hoare triple {2278#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} assume !!(main_~i~0 > 10); {2278#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:31:03,565 INFO L280 TraceCheckUtils]: 4: Hoare triple {2278#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} assume 25 == main_~i~0;main_~i~0 := 30; {2285#(and (<= (div (+ oldRank0 (- 55)) (- 2)) 26) (<= 30 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:03,566 INFO L280 TraceCheckUtils]: 5: Hoare triple {2285#(and (<= (div (+ oldRank0 (- 55)) (- 2)) 26) (<= 30 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2231#(or unseeded (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55)) (>= oldRank0 0)))} is VALID [2020-07-29 01:31:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:03,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:31:03,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:03,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,580 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:31:03,580 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-07-29 01:31:03,636 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 81 states and 107 transitions. Complement of second has 7 states. [2020-07-29 01:31:03,636 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 01:31:03,636 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:03,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2020-07-29 01:31:03,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:03,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:03,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:31:03,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:03,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:03,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:03,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 107 transitions. [2020-07-29 01:31:03,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:31:03,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:03,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:03,639 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2020-07-29 01:31:03,639 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:03,639 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:31:03,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:03,640 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:03,640 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 81 states and 107 transitions. cyclomatic complexity: 31 [2020-07-29 01:31:03,641 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:03,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:03,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:03,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:03,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 81 letters. Loop has 81 letters. [2020-07-29 01:31:03,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 81 letters. Loop has 81 letters. [2020-07-29 01:31:03,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 31 Stem has 81 letters. Loop has 81 letters. [2020-07-29 01:31:03,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:03,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:03,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 31 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:03,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:03,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:03,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:03,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:03,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:03,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:03,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 81 states and 107 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,648 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:31:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:31:03,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,650 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:03,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:03,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:03,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:03,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {2218#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {2218#unseeded} is VALID [2020-07-29 01:31:03,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:03,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {2218#unseeded} assume !(25 == main_~i~0); {2218#unseeded} is VALID [2020-07-29 01:31:03,691 INFO L280 TraceCheckUtils]: 3: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:03,691 INFO L280 TraceCheckUtils]: 4: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:03,692 INFO L280 TraceCheckUtils]: 5: Hoare triple {2218#unseeded} assume !(25 == main_~i~0); {2218#unseeded} is VALID [2020-07-29 01:31:03,692 INFO L280 TraceCheckUtils]: 6: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:03,693 INFO L280 TraceCheckUtils]: 7: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:03,693 INFO L280 TraceCheckUtils]: 8: Hoare triple {2218#unseeded} assume !(25 == main_~i~0); {2218#unseeded} is VALID [2020-07-29 01:31:03,694 INFO L280 TraceCheckUtils]: 9: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:03,695 INFO L280 TraceCheckUtils]: 10: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:03,695 INFO L280 TraceCheckUtils]: 11: Hoare triple {2218#unseeded} assume 25 == main_~i~0;main_~i~0 := 30; {2218#unseeded} is VALID [2020-07-29 01:31:03,696 INFO L280 TraceCheckUtils]: 12: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:03,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:31:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:03,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:03,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume !!(main_~i~0 > 10); {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} is VALID [2020-07-29 01:31:03,790 INFO L280 TraceCheckUtils]: 1: Hoare triple {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume !(25 == main_~i~0); {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} is VALID [2020-07-29 01:31:03,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2426#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:31:03,792 INFO L280 TraceCheckUtils]: 3: Hoare triple {2426#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} assume !!(main_~i~0 > 10); {2426#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:31:03,793 INFO L280 TraceCheckUtils]: 4: Hoare triple {2426#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} assume 25 == main_~i~0;main_~i~0 := 30; {2433#(and (<= (div (+ oldRank0 (- 55)) (- 2)) 26) (<= 30 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:03,795 INFO L280 TraceCheckUtils]: 5: Hoare triple {2433#(and (<= (div (+ oldRank0 (- 55)) (- 2)) 26) (<= 30 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2231#(or unseeded (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55)) (>= oldRank0 0)))} is VALID [2020-07-29 01:31:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:03,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:31:03,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:03,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,807 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:31:03,807 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-07-29 01:31:03,950 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 55 states and 74 transitions. Complement of second has 9 states. [2020-07-29 01:31:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:03,950 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:03,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2020-07-29 01:31:03,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:03,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:03,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:31:03,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:31:03,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:03,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:03,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 74 transitions. [2020-07-29 01:31:03,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:31:03,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:03,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:03,954 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2020-07-29 01:31:03,954 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:03,954 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:31:03,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:31:03,955 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:03,955 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 74 transitions. cyclomatic complexity: 23 [2020-07-29 01:31:03,955 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:03,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:03,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 55 letters. Loop has 55 letters. [2020-07-29 01:31:03,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 55 letters. Loop has 55 letters. [2020-07-29 01:31:03,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 55 letters. Loop has 55 letters. [2020-07-29 01:31:03,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:03,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:03,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:03,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:03,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:03,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:03,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:03,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:03,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:03,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 74 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,965 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:31:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-07-29 01:31:03,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:03,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:03,967 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:03,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:03,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:03,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:04,008 INFO L280 TraceCheckUtils]: 0: Hoare triple {2218#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {2218#unseeded} is VALID [2020-07-29 01:31:04,009 INFO L280 TraceCheckUtils]: 1: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:04,009 INFO L280 TraceCheckUtils]: 2: Hoare triple {2218#unseeded} assume !(25 == main_~i~0); {2218#unseeded} is VALID [2020-07-29 01:31:04,010 INFO L280 TraceCheckUtils]: 3: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:04,010 INFO L280 TraceCheckUtils]: 4: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:04,011 INFO L280 TraceCheckUtils]: 5: Hoare triple {2218#unseeded} assume !(25 == main_~i~0); {2218#unseeded} is VALID [2020-07-29 01:31:04,012 INFO L280 TraceCheckUtils]: 6: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:04,013 INFO L280 TraceCheckUtils]: 7: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:04,014 INFO L280 TraceCheckUtils]: 8: Hoare triple {2218#unseeded} assume !(25 == main_~i~0); {2218#unseeded} is VALID [2020-07-29 01:31:04,016 INFO L280 TraceCheckUtils]: 9: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:04,018 INFO L280 TraceCheckUtils]: 10: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:04,020 INFO L280 TraceCheckUtils]: 11: Hoare triple {2218#unseeded} assume 25 == main_~i~0;main_~i~0 := 30; {2218#unseeded} is VALID [2020-07-29 01:31:04,021 INFO L280 TraceCheckUtils]: 12: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:04,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:31:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:04,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:04,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume !!(main_~i~0 > 10); {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} is VALID [2020-07-29 01:31:04,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume !(25 == main_~i~0); {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} is VALID [2020-07-29 01:31:04,112 INFO L280 TraceCheckUtils]: 2: Hoare triple {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2551#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:31:04,112 INFO L280 TraceCheckUtils]: 3: Hoare triple {2551#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} assume !!(main_~i~0 > 10); {2551#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:31:04,113 INFO L280 TraceCheckUtils]: 4: Hoare triple {2551#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} assume 25 == main_~i~0;main_~i~0 := 30; {2558#(and (<= (div (+ oldRank0 (- 55)) (- 2)) 26) (<= 30 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:04,114 INFO L280 TraceCheckUtils]: 5: Hoare triple {2558#(and (<= (div (+ oldRank0 (- 55)) (- 2)) 26) (<= 30 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2231#(or unseeded (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55)) (>= oldRank0 0)))} is VALID [2020-07-29 01:31:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:04,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:31:04,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:04,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,127 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 3 loop predicates [2020-07-29 01:31:04,127 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-07-29 01:31:04,174 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 101 states and 141 transitions. Complement of second has 10 states. [2020-07-29 01:31:04,175 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 01:31:04,175 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:04,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2020-07-29 01:31:04,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:04,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:04,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:31:04,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:04,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:04,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:04,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 141 transitions. [2020-07-29 01:31:04,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:31:04,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:04,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:04,181 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2020-07-29 01:31:04,181 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:04,181 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:31:04,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:04,181 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:04,182 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 101 states and 141 transitions. cyclomatic complexity: 45 [2020-07-29 01:31:04,182 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:04,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 141 transitions. cyclomatic complexity: 45 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:04,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:04,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 141 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:04,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 141 transitions. cyclomatic complexity: 45 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 101 letters. Loop has 101 letters. [2020-07-29 01:31:04,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 101 letters. Loop has 101 letters. [2020-07-29 01:31:04,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 141 transitions. cyclomatic complexity: 45 Stem has 101 letters. Loop has 101 letters. [2020-07-29 01:31:04,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:04,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:04,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 141 transitions. cyclomatic complexity: 45 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:04,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:04,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:04,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 141 transitions. cyclomatic complexity: 45 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:04,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 141 transitions. cyclomatic complexity: 45 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:04,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:04,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 141 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:04,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 141 transitions. cyclomatic complexity: 45 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,189 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:31:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 01:31:04,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,190 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:04,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:04,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:04,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:04,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {2218#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {2218#unseeded} is VALID [2020-07-29 01:31:04,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:04,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {2218#unseeded} assume !(25 == main_~i~0); {2218#unseeded} is VALID [2020-07-29 01:31:04,221 INFO L280 TraceCheckUtils]: 3: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:04,221 INFO L280 TraceCheckUtils]: 4: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:04,222 INFO L280 TraceCheckUtils]: 5: Hoare triple {2218#unseeded} assume !(25 == main_~i~0); {2218#unseeded} is VALID [2020-07-29 01:31:04,223 INFO L280 TraceCheckUtils]: 6: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:04,223 INFO L280 TraceCheckUtils]: 7: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:04,224 INFO L280 TraceCheckUtils]: 8: Hoare triple {2218#unseeded} assume !(25 == main_~i~0); {2218#unseeded} is VALID [2020-07-29 01:31:04,224 INFO L280 TraceCheckUtils]: 9: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:04,225 INFO L280 TraceCheckUtils]: 10: Hoare triple {2218#unseeded} assume !!(main_~i~0 > 10); {2218#unseeded} is VALID [2020-07-29 01:31:04,225 INFO L280 TraceCheckUtils]: 11: Hoare triple {2218#unseeded} assume 25 == main_~i~0;main_~i~0 := 30; {2218#unseeded} is VALID [2020-07-29 01:31:04,226 INFO L280 TraceCheckUtils]: 12: Hoare triple {2218#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2218#unseeded} is VALID [2020-07-29 01:31:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:04,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:31:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:04,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:04,312 INFO L280 TraceCheckUtils]: 0: Hoare triple {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume !!(main_~i~0 > 10); {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} is VALID [2020-07-29 01:31:04,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume !(25 == main_~i~0); {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} is VALID [2020-07-29 01:31:04,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {2221#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2722#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:31:04,314 INFO L280 TraceCheckUtils]: 3: Hoare triple {2722#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} assume !!(main_~i~0 > 10); {2722#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:31:04,315 INFO L280 TraceCheckUtils]: 4: Hoare triple {2722#(<= (div (+ oldRank0 (- 55)) (- 2)) (+ ULTIMATE.start_main_~i~0 1))} assume 25 == main_~i~0;main_~i~0 := 30; {2729#(and (<= (div (+ oldRank0 (- 55)) (- 2)) 26) (<= 30 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:04,316 INFO L280 TraceCheckUtils]: 5: Hoare triple {2729#(and (<= (div (+ oldRank0 (- 55)) (- 2)) 26) (<= 30 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {2231#(or unseeded (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 55)) (>= oldRank0 0)))} is VALID [2020-07-29 01:31:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:04,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:31:04,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:04,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,333 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:31:04,334 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-07-29 01:31:04,412 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 76 states and 101 transitions. Complement of second has 11 states. [2020-07-29 01:31:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:04,412 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:04,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2020-07-29 01:31:04,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:04,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:04,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:31:04,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:31:04,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:04,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:04,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 101 transitions. [2020-07-29 01:31:04,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-07-29 01:31:04,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:04,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:04,415 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2020-07-29 01:31:04,415 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:04,415 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:31:04,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:31:04,416 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:04,416 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 76 states and 101 transitions. cyclomatic complexity: 29 [2020-07-29 01:31:04,416 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:04,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 101 transitions. cyclomatic complexity: 29 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:04,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:04,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 101 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:04,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:04,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:04,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 101 transitions. cyclomatic complexity: 29 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:04,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 76 letters. Loop has 76 letters. [2020-07-29 01:31:04,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 76 letters. Loop has 76 letters. [2020-07-29 01:31:04,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 101 transitions. cyclomatic complexity: 29 Stem has 76 letters. Loop has 76 letters. [2020-07-29 01:31:04,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:04,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:04,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 101 transitions. cyclomatic complexity: 29 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:04,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:04,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:04,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 101 transitions. cyclomatic complexity: 29 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:04,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 101 transitions. cyclomatic complexity: 29 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:04,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:04,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 101 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:04,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:04,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:04,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 101 transitions. cyclomatic complexity: 29 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:04,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,424 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:31:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2020-07-29 01:31:04,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:31:04,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 19 letters. Loop has 6 letters. [2020-07-29 01:31:04,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 12 letters. [2020-07-29 01:31:04,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:04,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. cyclomatic complexity: 29 [2020-07-29 01:31:04,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-07-29 01:31:04,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 49 states and 65 transitions. [2020-07-29 01:31:04,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:31:04,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:31:04,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 65 transitions. [2020-07-29 01:31:04,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:04,435 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2020-07-29 01:31:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 65 transitions. [2020-07-29 01:31:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2020-07-29 01:31:04,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:04,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states and 65 transitions. Second operand 27 states. [2020-07-29 01:31:04,440 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states and 65 transitions. Second operand 27 states. [2020-07-29 01:31:04,440 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand 27 states. [2020-07-29 01:31:04,441 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:04,443 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2020-07-29 01:31:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2020-07-29 01:31:04,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:04,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:04,443 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 49 states and 65 transitions. [2020-07-29 01:31:04,443 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 49 states and 65 transitions. [2020-07-29 01:31:04,444 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:04,446 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2020-07-29 01:31:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2020-07-29 01:31:04,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:04,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:04,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:04,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:31:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2020-07-29 01:31:04,448 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2020-07-29 01:31:04,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:04,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:31:04,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:31:04,450 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 5 states. [2020-07-29 01:31:04,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:04,506 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2020-07-29 01:31:04,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:31:04,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:31:04,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:04,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. [2020-07-29 01:31:04,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-07-29 01:31:04,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 34 states and 42 transitions. [2020-07-29 01:31:04,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:31:04,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 01:31:04,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2020-07-29 01:31:04,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:04,522 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-07-29 01:31:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2020-07-29 01:31:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2020-07-29 01:31:04,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:04,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 42 transitions. Second operand 27 states. [2020-07-29 01:31:04,524 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 42 transitions. Second operand 27 states. [2020-07-29 01:31:04,524 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 27 states. [2020-07-29 01:31:04,525 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:04,526 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2020-07-29 01:31:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2020-07-29 01:31:04,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:04,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:04,526 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 34 states and 42 transitions. [2020-07-29 01:31:04,526 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 34 states and 42 transitions. [2020-07-29 01:31:04,527 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:04,528 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2020-07-29 01:31:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2020-07-29 01:31:04,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:04,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:04,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:04,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:31:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-07-29 01:31:04,529 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-29 01:31:04,529 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-29 01:31:04,529 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:31:04,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2020-07-29 01:31:04,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:31:04,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:04,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:04,530 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:31:04,530 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2020-07-29 01:31:04,531 INFO L794 eck$LassoCheckResult]: Stem: 3080#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 3081#L13-1 assume !!(main_~i~0 > 10); 3096#L10 assume !(25 == main_~i~0); 3098#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 3082#L13-1 [2020-07-29 01:31:04,531 INFO L796 eck$LassoCheckResult]: Loop: 3082#L13-1 assume !!(main_~i~0 > 10); 3076#L10 assume 25 == main_~i~0;main_~i~0 := 30; 3077#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 3084#L13-1 assume !!(main_~i~0 > 10); 3078#L10 assume !(25 == main_~i~0); 3079#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 3085#L13-1 assume !!(main_~i~0 > 10); 3102#L10 assume !(25 == main_~i~0); 3101#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 3082#L13-1 [2020-07-29 01:31:04,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:04,531 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 5 times [2020-07-29 01:31:04,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:04,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265847989] [2020-07-29 01:31:04,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:04,535 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:04,537 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:04,538 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:04,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:04,539 INFO L82 PathProgramCache]: Analyzing trace with hash 73930127, now seen corresponding path program 3 times [2020-07-29 01:31:04,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:04,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675131444] [2020-07-29 01:31:04,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:04,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:04,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:04,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:04,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:04,555 INFO L82 PathProgramCache]: Analyzing trace with hash 139053282, now seen corresponding path program 8 times [2020-07-29 01:31:04,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:04,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094596153] [2020-07-29 01:31:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:04,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:04,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:04,567 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:04,613 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:04,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:04,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:04,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:04,614 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:04,614 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:04,614 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:04,614 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:04,614 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration9_Loop [2020-07-29 01:31:04,614 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:04,615 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:04,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 01:31:04,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 01:31:04,636 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 01:31:04,709 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:04,709 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:04,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:04,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:04,718 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:04,719 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:04,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:04,758 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 47 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:04,803 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:04,804 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:04,809 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:04,844 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:04,844 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:04,844 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:04,844 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:04,844 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:04,844 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:04,845 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:04,845 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:04,845 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration9_Loop [2020-07-29 01:31:04,845 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:04,845 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:04,851 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 01:31:04,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 01:31:04,868 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 01:31:04,936 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:04,936 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:04,944 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 01:31:04,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:04,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:04,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:04,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:04,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:04,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:04,952 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 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:04,975 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 01:31:04,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:04,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:04,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:04,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:04,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:04,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:04,982 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:05,007 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 01:31:05,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:05,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:05,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:05,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:05,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:05,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:05,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:05,011 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:05,013 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:31:05,014 INFO L444 ModelExtractionUtils]: 0 out of 3 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 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:05,018 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:05,018 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:05,018 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:05,018 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 26 Supporting invariants [] [2020-07-29 01:31:05,041 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:05,043 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 > 10);" "assume 25 == main_~i~0;main_~i~0 := 30;" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" "assume !!(main_~i~0 > 10);" "assume !(25 == main_~i~0);" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" "assume !!(main_~i~0 > 10);" "assume !(25 == main_~i~0);" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" [2020-07-29 01:31:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:05,066 INFO L280 TraceCheckUtils]: 0: Hoare triple {3257#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {3257#unseeded} is VALID [2020-07-29 01:31:05,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {3257#unseeded} assume !!(main_~i~0 > 10); {3257#unseeded} is VALID [2020-07-29 01:31:05,068 INFO L280 TraceCheckUtils]: 2: Hoare triple {3257#unseeded} assume !(25 == main_~i~0); {3257#unseeded} is VALID [2020-07-29 01:31:05,068 INFO L280 TraceCheckUtils]: 3: Hoare triple {3257#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3257#unseeded} is VALID [2020-07-29 01:31:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:31:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:05,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} assume !!(main_~i~0 > 10); {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} is VALID [2020-07-29 01:31:05,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} assume 25 == main_~i~0;main_~i~0 := 30; {3287#(and (<= 1 oldRank0) (<= 30 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {3287#(and (<= 1 oldRank0) (<= 30 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3291#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:05,198 INFO L280 TraceCheckUtils]: 3: Hoare triple {3291#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume !!(main_~i~0 > 10); {3291#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:05,199 INFO L280 TraceCheckUtils]: 4: Hoare triple {3291#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume !(25 == main_~i~0); {3291#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:05,200 INFO L280 TraceCheckUtils]: 5: Hoare triple {3291#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3301#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {3301#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {3301#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {3301#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume !(25 == main_~i~0); {3301#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,201 INFO L280 TraceCheckUtils]: 8: Hoare triple {3301#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3270#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))) unseeded)} is VALID [2020-07-29 01:31:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:05,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:31:05,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:05,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,215 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:31:05,215 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-07-29 01:31:05,240 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 39 states and 47 transitions. Complement of second has 5 states. [2020-07-29 01:31:05,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:05,241 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:05,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. cyclomatic complexity: 8 [2020-07-29 01:31:05,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:05,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:05,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:31:05,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:05,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:05,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:05,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 47 transitions. [2020-07-29 01:31:05,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:31:05,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:05,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:05,243 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 34 transitions. cyclomatic complexity: 8 [2020-07-29 01:31:05,244 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:31:05,244 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:31:05,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:05,244 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:05,244 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 47 transitions. cyclomatic complexity: 9 [2020-07-29 01:31:05,245 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:31:05,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:05,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:05,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:31:05,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:31:05,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:31:05,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:05,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:05,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:05,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:05,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:05,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:05,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:05,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:05,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:31:05,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:31:05,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:31:05,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:31:05,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:31:05,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:31:05,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:31:05,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:31:05,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:31:05,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:05,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:05,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 47 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:05,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,258 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:31:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:31:05,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,259 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:05,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:05,282 INFO L280 TraceCheckUtils]: 0: Hoare triple {3257#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {3257#unseeded} is VALID [2020-07-29 01:31:05,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {3257#unseeded} assume !!(main_~i~0 > 10); {3257#unseeded} is VALID [2020-07-29 01:31:05,283 INFO L280 TraceCheckUtils]: 2: Hoare triple {3257#unseeded} assume !(25 == main_~i~0); {3257#unseeded} is VALID [2020-07-29 01:31:05,284 INFO L280 TraceCheckUtils]: 3: Hoare triple {3257#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3257#unseeded} is VALID [2020-07-29 01:31:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:31:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:05,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} assume !!(main_~i~0 > 10); {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} is VALID [2020-07-29 01:31:05,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} assume 25 == main_~i~0;main_~i~0 := 30; {3373#(and (<= 1 oldRank0) (<= 30 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {3373#(and (<= 1 oldRank0) (<= 30 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3377#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:05,403 INFO L280 TraceCheckUtils]: 3: Hoare triple {3377#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume !!(main_~i~0 > 10); {3377#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:05,406 INFO L280 TraceCheckUtils]: 4: Hoare triple {3377#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume !(25 == main_~i~0); {3377#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:05,416 INFO L280 TraceCheckUtils]: 5: Hoare triple {3377#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3387#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,418 INFO L280 TraceCheckUtils]: 6: Hoare triple {3387#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {3387#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,419 INFO L280 TraceCheckUtils]: 7: Hoare triple {3387#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume !(25 == main_~i~0); {3387#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,420 INFO L280 TraceCheckUtils]: 8: Hoare triple {3387#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3270#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))) unseeded)} is VALID [2020-07-29 01:31:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:05,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:31:05,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:05,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,432 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:31:05,433 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-07-29 01:31:05,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 40 states and 49 transitions. Complement of second has 7 states. [2020-07-29 01:31:05,471 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 01:31:05,471 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:05,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. cyclomatic complexity: 8 [2020-07-29 01:31:05,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:05,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:05,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:31:05,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:05,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:05,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:05,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2020-07-29 01:31:05,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:31:05,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:05,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:05,474 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 34 transitions. cyclomatic complexity: 8 [2020-07-29 01:31:05,474 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:31:05,474 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:31:05,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:05,474 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:05,474 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 49 transitions. cyclomatic complexity: 10 [2020-07-29 01:31:05,475 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:31:05,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:05,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:05,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:05,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:31:05,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:31:05,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:31:05,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:05,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:05,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:05,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:05,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:05,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:05,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:05,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:05,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:05,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:05,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:05,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:05,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:05,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:05,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:05,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:05,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:05,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:05,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:31:05,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:31:05,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:31:05,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:31:05,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:31:05,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:31:05,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:31:05,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:31:05,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:31:05,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:05,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:05,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:05,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,489 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:31:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-07-29 01:31:05,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,490 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:05,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:05,526 INFO L280 TraceCheckUtils]: 0: Hoare triple {3257#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {3257#unseeded} is VALID [2020-07-29 01:31:05,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {3257#unseeded} assume !!(main_~i~0 > 10); {3257#unseeded} is VALID [2020-07-29 01:31:05,528 INFO L280 TraceCheckUtils]: 2: Hoare triple {3257#unseeded} assume !(25 == main_~i~0); {3257#unseeded} is VALID [2020-07-29 01:31:05,529 INFO L280 TraceCheckUtils]: 3: Hoare triple {3257#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3257#unseeded} is VALID [2020-07-29 01:31:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:31:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:05,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} assume !!(main_~i~0 > 10); {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} is VALID [2020-07-29 01:31:05,660 INFO L280 TraceCheckUtils]: 1: Hoare triple {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} assume 25 == main_~i~0;main_~i~0 := 30; {3463#(and (<= 1 oldRank0) (<= 30 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,662 INFO L280 TraceCheckUtils]: 2: Hoare triple {3463#(and (<= 1 oldRank0) (<= 30 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3467#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:05,662 INFO L280 TraceCheckUtils]: 3: Hoare triple {3467#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume !!(main_~i~0 > 10); {3467#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:05,663 INFO L280 TraceCheckUtils]: 4: Hoare triple {3467#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume !(25 == main_~i~0); {3467#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:05,665 INFO L280 TraceCheckUtils]: 5: Hoare triple {3467#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3477#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,665 INFO L280 TraceCheckUtils]: 6: Hoare triple {3477#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {3477#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,666 INFO L280 TraceCheckUtils]: 7: Hoare triple {3477#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume !(25 == main_~i~0); {3477#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,668 INFO L280 TraceCheckUtils]: 8: Hoare triple {3477#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3270#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))) unseeded)} is VALID [2020-07-29 01:31:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:05,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:31:05,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:05,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,683 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 4 loop predicates [2020-07-29 01:31:05,683 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-07-29 01:31:05,708 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 39 states and 49 transitions. Complement of second has 5 states. [2020-07-29 01:31:05,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:05,708 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:05,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. cyclomatic complexity: 8 [2020-07-29 01:31:05,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:05,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:05,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:31:05,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:05,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:05,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:05,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 49 transitions. [2020-07-29 01:31:05,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:31:05,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:05,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:05,710 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 34 transitions. cyclomatic complexity: 8 [2020-07-29 01:31:05,711 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:31:05,711 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:31:05,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:05,712 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:05,712 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 49 transitions. cyclomatic complexity: 11 [2020-07-29 01:31:05,712 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:05,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:05,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:05,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:05,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:31:05,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:31:05,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:31:05,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:05,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:05,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:05,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:05,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:05,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:05,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:05,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:05,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:05,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:05,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:05,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:05,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:05,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:05,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:05,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:05,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:05,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:05,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 49 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,732 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:31:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 01:31:05,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,733 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:05,755 INFO L280 TraceCheckUtils]: 0: Hoare triple {3257#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {3257#unseeded} is VALID [2020-07-29 01:31:05,756 INFO L280 TraceCheckUtils]: 1: Hoare triple {3257#unseeded} assume !!(main_~i~0 > 10); {3257#unseeded} is VALID [2020-07-29 01:31:05,756 INFO L280 TraceCheckUtils]: 2: Hoare triple {3257#unseeded} assume !(25 == main_~i~0); {3257#unseeded} is VALID [2020-07-29 01:31:05,757 INFO L280 TraceCheckUtils]: 3: Hoare triple {3257#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3257#unseeded} is VALID [2020-07-29 01:31:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:31:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:05,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} assume !!(main_~i~0 > 10); {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} is VALID [2020-07-29 01:31:05,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} assume 25 == main_~i~0;main_~i~0 := 30; {3549#(and (<= 1 oldRank0) (<= 30 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,881 INFO L280 TraceCheckUtils]: 2: Hoare triple {3549#(and (<= 1 oldRank0) (<= 30 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3553#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:05,882 INFO L280 TraceCheckUtils]: 3: Hoare triple {3553#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume !!(main_~i~0 > 10); {3553#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:05,882 INFO L280 TraceCheckUtils]: 4: Hoare triple {3553#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume !(25 == main_~i~0); {3553#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:05,884 INFO L280 TraceCheckUtils]: 5: Hoare triple {3553#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3563#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,885 INFO L280 TraceCheckUtils]: 6: Hoare triple {3563#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {3563#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,886 INFO L280 TraceCheckUtils]: 7: Hoare triple {3563#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume !(25 == main_~i~0); {3563#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:05,887 INFO L280 TraceCheckUtils]: 8: Hoare triple {3563#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3270#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))) unseeded)} is VALID [2020-07-29 01:31:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:05,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:31:05,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:05,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,902 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:31:05,902 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-07-29 01:31:05,942 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2020-07-29 01:31:05,942 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 01:31:05,942 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:05,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. cyclomatic complexity: 8 [2020-07-29 01:31:05,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:05,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:05,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:31:05,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:05,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:05,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:05,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2020-07-29 01:31:05,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 01:31:05,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:05,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:05,944 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 34 transitions. cyclomatic complexity: 8 [2020-07-29 01:31:05,944 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:31:05,944 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:31:05,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:05,945 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:05,945 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 11 [2020-07-29 01:31:05,945 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:05,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:05,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:05,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:05,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:31:05,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:31:05,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:31:05,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:05,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:05,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:05,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:05,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:05,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:05,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:05,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:05,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:05,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:05,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,957 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:31:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-29 01:31:05,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:05,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:05,958 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:05,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:05,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {3257#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {3257#unseeded} is VALID [2020-07-29 01:31:05,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {3257#unseeded} assume !!(main_~i~0 > 10); {3257#unseeded} is VALID [2020-07-29 01:31:05,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {3257#unseeded} assume !(25 == main_~i~0); {3257#unseeded} is VALID [2020-07-29 01:31:05,984 INFO L280 TraceCheckUtils]: 3: Hoare triple {3257#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3257#unseeded} is VALID [2020-07-29 01:31:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:31:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:05,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:06,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} assume !!(main_~i~0 > 10); {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} is VALID [2020-07-29 01:31:06,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {3260#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))} assume 25 == main_~i~0;main_~i~0 := 30; {3639#(and (<= 1 oldRank0) (<= 30 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:06,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {3639#(and (<= 1 oldRank0) (<= 30 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3643#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:06,129 INFO L280 TraceCheckUtils]: 3: Hoare triple {3643#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume !!(main_~i~0 > 10); {3643#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:06,130 INFO L280 TraceCheckUtils]: 4: Hoare triple {3643#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume !(25 == main_~i~0); {3643#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} is VALID [2020-07-29 01:31:06,131 INFO L280 TraceCheckUtils]: 5: Hoare triple {3643#(and (<= 29 ULTIMATE.start_main_~i~0) (<= 1 oldRank0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3653#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:06,131 INFO L280 TraceCheckUtils]: 6: Hoare triple {3653#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {3653#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:06,132 INFO L280 TraceCheckUtils]: 7: Hoare triple {3653#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume !(25 == main_~i~0); {3653#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:06,133 INFO L280 TraceCheckUtils]: 8: Hoare triple {3653#(and (<= 1 oldRank0) (<= 28 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {3270#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) 26))) unseeded)} is VALID [2020-07-29 01:31:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:06,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:31:06,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:06,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:06,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,145 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:31:06,146 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-07-29 01:31:06,291 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. Result 210 states and 292 transitions. Complement of second has 48 states 9 powerset states39 rank states. The highest rank that occured is 5 [2020-07-29 01:31:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:06,291 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceFKV [2020-07-29 01:31:06,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. cyclomatic complexity: 8 [2020-07-29 01:31:06,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:06,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:06,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:31:06,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:31:06,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:06,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:06,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 292 transitions. [2020-07-29 01:31:06,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-07-29 01:31:06,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:06,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:06,294 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 34 transitions. cyclomatic complexity: 8 [2020-07-29 01:31:06,295 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:31:06,295 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:31:06,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:31:06,295 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:06,295 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 210 states and 292 transitions. cyclomatic complexity: 84 [2020-07-29 01:31:06,296 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:31:06,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:06,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:06,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:06,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:06,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:06,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:06,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:06,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:06,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:06,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 210 letters. Loop has 210 letters. [2020-07-29 01:31:06,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 210 letters. Loop has 210 letters. [2020-07-29 01:31:06,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 210 letters. Loop has 210 letters. [2020-07-29 01:31:06,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:06,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:06,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:31:06,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:31:06,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:31:06,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:31:06,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:06,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:06,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 5 letters. Loop has 9 letters. [2020-07-29 01:31:06,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:06,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:06,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 6 letters. Loop has 9 letters. [2020-07-29 01:31:06,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:06,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:06,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:06,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:06,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:06,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 7 letters. Loop has 9 letters. [2020-07-29 01:31:06,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:06,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:06,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:06,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:06,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:06,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:31:06,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:06,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:06,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:06,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:06,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:06,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:06,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 15 letters. [2020-07-29 01:31:06,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 15 letters. [2020-07-29 01:31:06,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 210 states and 292 transitions. cyclomatic complexity: 84 Stem has 8 letters. Loop has 15 letters. [2020-07-29 01:31:06,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,315 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceFKV [2020-07-29 01:31:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:31:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2020-07-29 01:31:06,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:31:06,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:31:06,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 18 letters. [2020-07-29 01:31:06,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 292 transitions. cyclomatic complexity: 84 [2020-07-29 01:31:06,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-07-29 01:31:06,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 98 states and 131 transitions. [2020-07-29 01:31:06,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:31:06,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:31:06,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 131 transitions. [2020-07-29 01:31:06,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:06,326 INFO L688 BuchiCegarLoop]: Abstraction has 98 states and 131 transitions. [2020-07-29 01:31:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 131 transitions. [2020-07-29 01:31:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 58. [2020-07-29 01:31:06,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:06,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states and 131 transitions. Second operand 58 states. [2020-07-29 01:31:06,330 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states and 131 transitions. Second operand 58 states. [2020-07-29 01:31:06,330 INFO L87 Difference]: Start difference. First operand 98 states and 131 transitions. Second operand 58 states. [2020-07-29 01:31:06,330 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:06,333 INFO L93 Difference]: Finished difference Result 138 states and 178 transitions. [2020-07-29 01:31:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 178 transitions. [2020-07-29 01:31:06,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:06,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:06,333 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 98 states and 131 transitions. [2020-07-29 01:31:06,334 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 98 states and 131 transitions. [2020-07-29 01:31:06,334 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:06,337 INFO L93 Difference]: Finished difference Result 141 states and 181 transitions. [2020-07-29 01:31:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 181 transitions. [2020-07-29 01:31:06,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:06,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:06,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:06,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-29 01:31:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2020-07-29 01:31:06,339 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2020-07-29 01:31:06,339 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2020-07-29 01:31:06,339 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:31:06,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. [2020-07-29 01:31:06,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-07-29 01:31:06,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:06,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:06,340 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:31:06,340 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2020-07-29 01:31:06,341 INFO L794 eck$LassoCheckResult]: Stem: 3930#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 3932#L13-1 assume !!(main_~i~0 > 10); 3946#L10 assume !(25 == main_~i~0); 3942#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 3933#L13-1 [2020-07-29 01:31:06,341 INFO L796 eck$LassoCheckResult]: Loop: 3933#L13-1 assume !!(main_~i~0 > 10); 3934#L10 assume 25 == main_~i~0;main_~i~0 := 30; 3982#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 3980#L13-1 assume !!(main_~i~0 > 10); 3975#L10 assume !(25 == main_~i~0); 3973#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 3968#L13-1 assume !!(main_~i~0 > 10); 3955#L10 assume !(25 == main_~i~0); 3967#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 3966#L13-1 assume !!(main_~i~0 > 10); 3939#L10 assume !(25 == main_~i~0); 3937#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 3933#L13-1 [2020-07-29 01:31:06,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:06,341 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 6 times [2020-07-29 01:31:06,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:06,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807746885] [2020-07-29 01:31:06,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:06,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:06,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:06,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash -865799297, now seen corresponding path program 4 times [2020-07-29 01:31:06,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:06,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881597911] [2020-07-29 01:31:06,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:06,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:06,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:06,359 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:06,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:06,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2107106484, now seen corresponding path program 9 times [2020-07-29 01:31:06,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:06,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674717931] [2020-07-29 01:31:06,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:06,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:06,370 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:06,371 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:06,427 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:06,427 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:06,427 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:06,427 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:06,427 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:06,428 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:06,428 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:06,428 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:06,428 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration10_Loop [2020-07-29 01:31:06,428 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:06,428 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:06,434 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 01:31:06,442 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 01:31:06,445 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 01:31:06,518 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:06,518 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:06,521 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:06,522 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:06,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:06,564 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:06,568 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:06,594 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:06,594 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:06,594 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:06,594 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:06,594 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:06,594 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:06,594 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:06,594 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:06,594 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration10_Loop [2020-07-29 01:31:06,594 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:06,594 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:06,600 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 01:31:06,606 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 01:31:06,610 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 01:31:06,682 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:06,683 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:06,685 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 01:31:06,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:06,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:06,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:06,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:06,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:06,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:06,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:06,691 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:06,694 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:31:06,694 INFO L444 ModelExtractionUtils]: 0 out of 3 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:06,697 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:06,697 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:06,697 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:06,697 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 51 Supporting invariants [] [2020-07-29 01:31:06,718 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:06,721 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 > 10);" "assume 25 == main_~i~0;main_~i~0 := 30;" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" "assume !!(main_~i~0 > 10);" "assume !(25 == main_~i~0);" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" "assume !!(main_~i~0 > 10);" "assume !(25 == main_~i~0);" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" "assume !!(main_~i~0 > 10);" "assume !(25 == main_~i~0);" "assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1;" [2020-07-29 01:31:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:06,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:06,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:06,746 INFO L280 TraceCheckUtils]: 0: Hoare triple {4346#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {4346#unseeded} is VALID [2020-07-29 01:31:06,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {4346#unseeded} assume !!(main_~i~0 > 10); {4346#unseeded} is VALID [2020-07-29 01:31:06,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {4346#unseeded} assume !(25 == main_~i~0); {4346#unseeded} is VALID [2020-07-29 01:31:06,748 INFO L280 TraceCheckUtils]: 3: Hoare triple {4346#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4346#unseeded} is VALID [2020-07-29 01:31:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:06,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:31:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:06,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:06,950 INFO L280 TraceCheckUtils]: 0: Hoare triple {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} assume !!(main_~i~0 > 10); {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} is VALID [2020-07-29 01:31:06,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} assume 25 == main_~i~0;main_~i~0 := 30; {4376#(and (<= 30 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:06,952 INFO L280 TraceCheckUtils]: 2: Hoare triple {4376#(and (<= 30 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4380#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:06,953 INFO L280 TraceCheckUtils]: 3: Hoare triple {4380#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !!(main_~i~0 > 10); {4380#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:06,953 INFO L280 TraceCheckUtils]: 4: Hoare triple {4380#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !(25 == main_~i~0); {4380#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:06,954 INFO L280 TraceCheckUtils]: 5: Hoare triple {4380#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4390#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:06,955 INFO L280 TraceCheckUtils]: 6: Hoare triple {4390#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {4390#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:06,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {4390#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume !(25 == main_~i~0); {4390#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:06,956 INFO L280 TraceCheckUtils]: 8: Hoare triple {4390#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4400#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:06,958 INFO L280 TraceCheckUtils]: 9: Hoare triple {4400#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !!(main_~i~0 > 10); {4400#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:06,959 INFO L280 TraceCheckUtils]: 10: Hoare triple {4400#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !(25 == main_~i~0); {4400#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:06,960 INFO L280 TraceCheckUtils]: 11: Hoare triple {4400#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4359#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:31:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:06,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:31:06,983 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 01:31:06,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:06,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:06,984 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:31:06,984 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2020-07-29 01:31:07,012 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 101 states and 129 transitions. Complement of second has 5 states. [2020-07-29 01:31:07,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:07,014 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:07,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. cyclomatic complexity: 27 [2020-07-29 01:31:07,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:31:07,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:07,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 129 transitions. [2020-07-29 01:31:07,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-07-29 01:31:07,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,016 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 83 transitions. cyclomatic complexity: 27 [2020-07-29 01:31:07,017 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:31:07,017 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:31:07,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:07,018 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:07,018 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 101 states and 129 transitions. cyclomatic complexity: 30 [2020-07-29 01:31:07,019 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:31:07,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:07,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:07,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:07,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 101 letters. Loop has 101 letters. [2020-07-29 01:31:07,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 101 letters. Loop has 101 letters. [2020-07-29 01:31:07,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 101 letters. Loop has 101 letters. [2020-07-29 01:31:07,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:07,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:07,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:07,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:07,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:07,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:07,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:07,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:07,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:07,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:07,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:07,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:07,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 12 letters. [2020-07-29 01:31:07,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 12 letters. [2020-07-29 01:31:07,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 11 letters. Loop has 12 letters. [2020-07-29 01:31:07,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:31:07,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:31:07,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 129 transitions. cyclomatic complexity: 30 Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:31:07,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,031 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:31:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:31:07,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,032 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:07,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:07,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {4346#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {4346#unseeded} is VALID [2020-07-29 01:31:07,055 INFO L280 TraceCheckUtils]: 1: Hoare triple {4346#unseeded} assume !!(main_~i~0 > 10); {4346#unseeded} is VALID [2020-07-29 01:31:07,056 INFO L280 TraceCheckUtils]: 2: Hoare triple {4346#unseeded} assume !(25 == main_~i~0); {4346#unseeded} is VALID [2020-07-29 01:31:07,056 INFO L280 TraceCheckUtils]: 3: Hoare triple {4346#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4346#unseeded} is VALID [2020-07-29 01:31:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:31:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:07,263 INFO L280 TraceCheckUtils]: 0: Hoare triple {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} assume !!(main_~i~0 > 10); {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} is VALID [2020-07-29 01:31:07,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} assume 25 == main_~i~0;main_~i~0 := 30; {4534#(and (<= 30 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,265 INFO L280 TraceCheckUtils]: 2: Hoare triple {4534#(and (<= 30 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4538#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,265 INFO L280 TraceCheckUtils]: 3: Hoare triple {4538#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !!(main_~i~0 > 10); {4538#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,266 INFO L280 TraceCheckUtils]: 4: Hoare triple {4538#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !(25 == main_~i~0); {4538#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,267 INFO L280 TraceCheckUtils]: 5: Hoare triple {4538#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4548#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:07,267 INFO L280 TraceCheckUtils]: 6: Hoare triple {4548#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {4548#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:07,268 INFO L280 TraceCheckUtils]: 7: Hoare triple {4548#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume !(25 == main_~i~0); {4548#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:07,269 INFO L280 TraceCheckUtils]: 8: Hoare triple {4548#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4558#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,270 INFO L280 TraceCheckUtils]: 9: Hoare triple {4558#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !!(main_~i~0 > 10); {4558#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,270 INFO L280 TraceCheckUtils]: 10: Hoare triple {4558#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !(25 == main_~i~0); {4558#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,271 INFO L280 TraceCheckUtils]: 11: Hoare triple {4558#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4359#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:31:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:07,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:31:07,290 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 01:31:07,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,291 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:31:07,291 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2020-07-29 01:31:07,334 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 106 states and 135 transitions. Complement of second has 7 states. [2020-07-29 01:31:07,334 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 01:31:07,334 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:07,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. cyclomatic complexity: 27 [2020-07-29 01:31:07,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:31:07,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:07,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 135 transitions. [2020-07-29 01:31:07,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-07-29 01:31:07,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,336 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 83 transitions. cyclomatic complexity: 27 [2020-07-29 01:31:07,336 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:31:07,337 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:31:07,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:07,337 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:07,337 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 106 states and 135 transitions. cyclomatic complexity: 31 [2020-07-29 01:31:07,337 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:31:07,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:07,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:07,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:07,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 106 letters. Loop has 106 letters. [2020-07-29 01:31:07,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 106 letters. Loop has 106 letters. [2020-07-29 01:31:07,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 106 letters. Loop has 106 letters. [2020-07-29 01:31:07,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:07,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:07,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:07,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:07,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:07,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:07,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:07,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:07,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:07,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:07,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:07,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:07,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 12 letters. [2020-07-29 01:31:07,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 12 letters. [2020-07-29 01:31:07,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 12 letters. [2020-07-29 01:31:07,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:31:07,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:31:07,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 135 transitions. cyclomatic complexity: 31 Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:31:07,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,347 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:31:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-07-29 01:31:07,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,348 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:07,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:07,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {4346#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {4346#unseeded} is VALID [2020-07-29 01:31:07,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {4346#unseeded} assume !!(main_~i~0 > 10); {4346#unseeded} is VALID [2020-07-29 01:31:07,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {4346#unseeded} assume !(25 == main_~i~0); {4346#unseeded} is VALID [2020-07-29 01:31:07,372 INFO L280 TraceCheckUtils]: 3: Hoare triple {4346#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4346#unseeded} is VALID [2020-07-29 01:31:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:31:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:07,561 INFO L280 TraceCheckUtils]: 0: Hoare triple {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} assume !!(main_~i~0 > 10); {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} is VALID [2020-07-29 01:31:07,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} assume 25 == main_~i~0;main_~i~0 := 30; {4700#(and (<= 30 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,563 INFO L280 TraceCheckUtils]: 2: Hoare triple {4700#(and (<= 30 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4704#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,564 INFO L280 TraceCheckUtils]: 3: Hoare triple {4704#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !!(main_~i~0 > 10); {4704#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,564 INFO L280 TraceCheckUtils]: 4: Hoare triple {4704#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !(25 == main_~i~0); {4704#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,566 INFO L280 TraceCheckUtils]: 5: Hoare triple {4704#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4714#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:07,566 INFO L280 TraceCheckUtils]: 6: Hoare triple {4714#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {4714#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:07,567 INFO L280 TraceCheckUtils]: 7: Hoare triple {4714#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume !(25 == main_~i~0); {4714#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:07,568 INFO L280 TraceCheckUtils]: 8: Hoare triple {4714#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4724#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,569 INFO L280 TraceCheckUtils]: 9: Hoare triple {4724#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !!(main_~i~0 > 10); {4724#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,570 INFO L280 TraceCheckUtils]: 10: Hoare triple {4724#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !(25 == main_~i~0); {4724#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,571 INFO L280 TraceCheckUtils]: 11: Hoare triple {4724#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4359#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:31:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:07,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:31:07,592 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 01:31:07,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,593 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 5 loop predicates [2020-07-29 01:31:07,593 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2020-07-29 01:31:07,622 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 95 states and 126 transitions. Complement of second has 5 states. [2020-07-29 01:31:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:07,622 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:07,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. cyclomatic complexity: 27 [2020-07-29 01:31:07,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:31:07,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:07,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 126 transitions. [2020-07-29 01:31:07,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-07-29 01:31:07,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,624 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 83 transitions. cyclomatic complexity: 27 [2020-07-29 01:31:07,624 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:31:07,625 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:31:07,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:07,625 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:07,625 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 95 states and 126 transitions. cyclomatic complexity: 33 [2020-07-29 01:31:07,626 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:07,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:07,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:07,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:07,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 95 letters. Loop has 95 letters. [2020-07-29 01:31:07,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 95 letters. Loop has 95 letters. [2020-07-29 01:31:07,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 95 letters. Loop has 95 letters. [2020-07-29 01:31:07,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:07,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:07,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:07,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:07,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:07,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:07,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:07,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:07,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:07,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:07,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:07,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:07,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 95 states and 126 transitions. cyclomatic complexity: 33 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,638 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:31:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 01:31:07,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,639 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:07,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:07,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {4346#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {4346#unseeded} is VALID [2020-07-29 01:31:07,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {4346#unseeded} assume !!(main_~i~0 > 10); {4346#unseeded} is VALID [2020-07-29 01:31:07,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {4346#unseeded} assume !(25 == main_~i~0); {4346#unseeded} is VALID [2020-07-29 01:31:07,660 INFO L280 TraceCheckUtils]: 3: Hoare triple {4346#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4346#unseeded} is VALID [2020-07-29 01:31:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:31:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:07,843 INFO L280 TraceCheckUtils]: 0: Hoare triple {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} assume !!(main_~i~0 > 10); {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} is VALID [2020-07-29 01:31:07,844 INFO L280 TraceCheckUtils]: 1: Hoare triple {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} assume 25 == main_~i~0;main_~i~0 := 30; {4852#(and (<= 30 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,845 INFO L280 TraceCheckUtils]: 2: Hoare triple {4852#(and (<= 30 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4856#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,846 INFO L280 TraceCheckUtils]: 3: Hoare triple {4856#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !!(main_~i~0 > 10); {4856#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,846 INFO L280 TraceCheckUtils]: 4: Hoare triple {4856#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !(25 == main_~i~0); {4856#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,847 INFO L280 TraceCheckUtils]: 5: Hoare triple {4856#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4866#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:07,848 INFO L280 TraceCheckUtils]: 6: Hoare triple {4866#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {4866#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:07,849 INFO L280 TraceCheckUtils]: 7: Hoare triple {4866#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume !(25 == main_~i~0); {4866#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:07,853 INFO L280 TraceCheckUtils]: 8: Hoare triple {4866#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4876#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,854 INFO L280 TraceCheckUtils]: 9: Hoare triple {4876#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !!(main_~i~0 > 10); {4876#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,855 INFO L280 TraceCheckUtils]: 10: Hoare triple {4876#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !(25 == main_~i~0); {4876#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:07,860 INFO L280 TraceCheckUtils]: 11: Hoare triple {4876#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4359#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:31:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:07,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:31:07,878 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 01:31:07,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,879 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:31:07,879 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2020-07-29 01:31:07,934 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 99 states and 128 transitions. Complement of second has 6 states. [2020-07-29 01:31:07,935 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 01:31:07,935 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:07,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. cyclomatic complexity: 27 [2020-07-29 01:31:07,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:31:07,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:07,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 128 transitions. [2020-07-29 01:31:07,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-07-29 01:31:07,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,937 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 83 transitions. cyclomatic complexity: 27 [2020-07-29 01:31:07,937 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:31:07,937 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:31:07,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:07,938 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:07,938 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 99 states and 128 transitions. cyclomatic complexity: 31 [2020-07-29 01:31:07,938 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:07,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:07,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:07,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:07,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 99 letters. Loop has 99 letters. [2020-07-29 01:31:07,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 99 letters. Loop has 99 letters. [2020-07-29 01:31:07,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 99 letters. Loop has 99 letters. [2020-07-29 01:31:07,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:07,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:07,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:07,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:07,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:07,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:07,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:07,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:07,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:07,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:07,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:07,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:07,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:07,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:07,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 128 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,951 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:31:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-29 01:31:07,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:07,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:07,952 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:07,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:07,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {4346#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {4346#unseeded} is VALID [2020-07-29 01:31:07,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {4346#unseeded} assume !!(main_~i~0 > 10); {4346#unseeded} is VALID [2020-07-29 01:31:07,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {4346#unseeded} assume !(25 == main_~i~0); {4346#unseeded} is VALID [2020-07-29 01:31:07,976 INFO L280 TraceCheckUtils]: 3: Hoare triple {4346#unseeded} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4346#unseeded} is VALID [2020-07-29 01:31:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:31:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:08,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} assume !!(main_~i~0 > 10); {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} is VALID [2020-07-29 01:31:08,166 INFO L280 TraceCheckUtils]: 1: Hoare triple {4349#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51))} assume 25 == main_~i~0;main_~i~0 := 30; {5010#(and (<= 30 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:08,167 INFO L280 TraceCheckUtils]: 2: Hoare triple {5010#(and (<= 30 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {5014#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:08,168 INFO L280 TraceCheckUtils]: 3: Hoare triple {5014#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !!(main_~i~0 > 10); {5014#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:08,169 INFO L280 TraceCheckUtils]: 4: Hoare triple {5014#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !(25 == main_~i~0); {5014#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:08,170 INFO L280 TraceCheckUtils]: 5: Hoare triple {5014#(and (<= 29 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {5024#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:08,170 INFO L280 TraceCheckUtils]: 6: Hoare triple {5024#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 > 10); {5024#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:08,171 INFO L280 TraceCheckUtils]: 7: Hoare triple {5024#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume !(25 == main_~i~0); {5024#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:31:08,172 INFO L280 TraceCheckUtils]: 8: Hoare triple {5024#(and (<= (div (+ oldRank0 (- 51)) (- 2)) 25) (<= 28 ULTIMATE.start_main_~i~0))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {5034#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:08,172 INFO L280 TraceCheckUtils]: 9: Hoare triple {5034#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !!(main_~i~0 > 10); {5034#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:08,173 INFO L280 TraceCheckUtils]: 10: Hoare triple {5034#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume !(25 == main_~i~0); {5034#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} is VALID [2020-07-29 01:31:08,174 INFO L280 TraceCheckUtils]: 11: Hoare triple {5034#(and (<= 27 ULTIMATE.start_main_~i~0) (<= (div (+ oldRank0 (- 51)) (- 2)) 25))} assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; {4359#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 51)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:31:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:08,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:31:08,192 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 01:31:08,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:08,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,193 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:31:08,193 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2020-07-29 01:31:08,507 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. Result 1058 states and 1452 transitions. Complement of second has 131 states 20 powerset states111 rank states. The highest rank that occured is 5 [2020-07-29 01:31:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:08,508 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceFKV [2020-07-29 01:31:08,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. cyclomatic complexity: 27 [2020-07-29 01:31:08,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:08,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:08,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:31:08,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:31:08,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:08,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:08,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1058 states and 1452 transitions. [2020-07-29 01:31:08,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-07-29 01:31:08,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:08,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:08,521 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 83 transitions. cyclomatic complexity: 27 [2020-07-29 01:31:08,521 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:31:08,521 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:31:08,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:31:08,522 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:31:08,522 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 [2020-07-29 01:31:08,527 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:31:08,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:08,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:08,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:08,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:08,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:08,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:08,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 15 letters. [2020-07-29 01:31:08,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 15 letters. [2020-07-29 01:31:08,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 5 letters. Loop has 15 letters. [2020-07-29 01:31:08,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 1058 letters. Loop has 1058 letters. [2020-07-29 01:31:08,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1058 letters. Loop has 1058 letters. [2020-07-29 01:31:08,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 1058 letters. Loop has 1058 letters. [2020-07-29 01:31:08,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:31:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:08,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:08,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:08,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:08,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:08,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:08,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:08,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:08,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:08,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:08,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:08,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:08,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:08,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:08,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:08,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:08,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:08,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:08,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:08,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:31:08,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:31:08,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:31:08,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 83 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 15 letters. [2020-07-29 01:31:08,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 15 letters. [2020-07-29 01:31:08,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 Stem has 5 letters. Loop has 15 letters. [2020-07-29 01:31:08,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,619 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceFKV [2020-07-29 01:31:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:31:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2020-07-29 01:31:08,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:08,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 16 letters. Loop has 12 letters. [2020-07-29 01:31:08,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 24 letters. [2020-07-29 01:31:08,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:08,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1058 states and 1452 transitions. cyclomatic complexity: 410 [2020-07-29 01:31:08,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2020-07-29 01:31:08,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1058 states to 212 states and 312 transitions. [2020-07-29 01:31:08,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:31:08,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:31:08,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 312 transitions. [2020-07-29 01:31:08,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:08,695 INFO L688 BuchiCegarLoop]: Abstraction has 212 states and 312 transitions. [2020-07-29 01:31:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 312 transitions. [2020-07-29 01:31:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 126. [2020-07-29 01:31:08,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:08,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states and 312 transitions. Second operand 126 states. [2020-07-29 01:31:08,716 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states and 312 transitions. Second operand 126 states. [2020-07-29 01:31:08,718 INFO L87 Difference]: Start difference. First operand 212 states and 312 transitions. Second operand 126 states. [2020-07-29 01:31:08,718 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:08,728 INFO L93 Difference]: Finished difference Result 375 states and 510 transitions. [2020-07-29 01:31:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 510 transitions. [2020-07-29 01:31:08,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:08,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:08,729 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 212 states and 312 transitions. [2020-07-29 01:31:08,730 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 212 states and 312 transitions. [2020-07-29 01:31:08,730 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:08,740 INFO L93 Difference]: Finished difference Result 351 states and 479 transitions. [2020-07-29 01:31:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 479 transitions. [2020-07-29 01:31:08,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:08,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:08,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:08,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-29 01:31:08,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 200 transitions. [2020-07-29 01:31:08,743 INFO L711 BuchiCegarLoop]: Abstraction has 126 states and 200 transitions. [2020-07-29 01:31:08,743 INFO L591 BuchiCegarLoop]: Abstraction has 126 states and 200 transitions. [2020-07-29 01:31:08,743 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 01:31:08,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 200 transitions. [2020-07-29 01:31:08,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-07-29 01:31:08,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:08,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:08,745 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:31:08,745 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1] [2020-07-29 01:31:08,745 INFO L794 eck$LassoCheckResult]: Stem: 6243#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 6247#L13-1 assume !!(main_~i~0 > 10); 6259#L10 assume !(25 == main_~i~0); 6257#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 6248#L13-1 [2020-07-29 01:31:08,745 INFO L796 eck$LassoCheckResult]: Loop: 6248#L13-1 assume !!(main_~i~0 > 10); 6249#L10 assume 25 == main_~i~0;main_~i~0 := 30; 6363#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 6361#L13-1 assume !!(main_~i~0 > 10); 6359#L10 assume !(25 == main_~i~0); 6357#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 6353#L13-1 assume !!(main_~i~0 > 10); 6350#L10 assume !(25 == main_~i~0); 6348#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 6343#L13-1 assume !!(main_~i~0 > 10); 6262#L10 assume !(25 == main_~i~0); 6291#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 6289#L13-1 assume !!(main_~i~0 > 10); 6254#L10 assume !(25 == main_~i~0); 6252#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 6248#L13-1 [2020-07-29 01:31:08,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:08,745 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 7 times [2020-07-29 01:31:08,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:08,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612578534] [2020-07-29 01:31:08,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:08,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:08,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:08,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:08,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:08,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1748234353, now seen corresponding path program 5 times [2020-07-29 01:31:08,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:08,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844252413] [2020-07-29 01:31:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:08,774 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:08,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:08,786 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:08,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1862223710, now seen corresponding path program 10 times [2020-07-29 01:31:08,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:08,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787038085] [2020-07-29 01:31:08,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:08,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:08,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:08,812 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:08,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:31:08 BoogieIcfgContainer [2020-07-29 01:31:08,944 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:31:08,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:31:08,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:31:08,945 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:31:08,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:30:55" (3/4) ... [2020-07-29 01:31:08,948 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 01:31:08,993 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:31:08,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:31:08,999 INFO L168 Benchmark]: Toolchain (without parser) took 14076.27 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.5 MB). Free memory was 960.2 MB in the beginning and 944.5 MB in the end (delta: 15.7 MB). Peak memory consumption was 383.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:08,999 INFO L168 Benchmark]: CDTParser took 0.31 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 01:31:09,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.70 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:09,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.11 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:31:09,001 INFO L168 Benchmark]: Boogie Preprocessor took 71.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:09,001 INFO L168 Benchmark]: RCFGBuilder took 244.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:09,002 INFO L168 Benchmark]: BuchiAutomizer took 13457.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.3 MB). Free memory was 1.1 GB in the beginning and 944.5 MB in the end (delta: 168.7 MB). Peak memory consumption was 401.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:09,002 INFO L168 Benchmark]: Witness Printer took 48.15 ms. Allocated memory is still 1.4 GB. Free memory is still 944.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:31:09,005 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.31 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 214.70 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 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 33.11 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 244.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13457.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.3 MB). Free memory was 1.1 GB in the beginning and 944.5 MB in the end (delta: 168.7 MB). Peak memory consumption was 401.0 MB. Max. memory is 11.5 GB. * Witness Printer took 48.15 ms. Allocated memory is still 1.4 GB. Free memory is still 944.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 12 terminating modules (2 trivial, 5 deterministic, 5 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + 27 and consists of 5 locations. One deterministic module has affine ranking function -1 * i + 28 and consists of 3 locations. One deterministic module has affine ranking function -1 * i + 27 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 55 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + 28 and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 55 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + 26 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * i + 51 and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 126 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.3s and 11 iterations. TraceHistogramMax:5. Analysis of lassos took 5.9s. Construction of modules took 0.6s. Büchi inclusion checks took 6.2s. Highest rank in rank-based complementation 5. Minimization of det autom 0. Minimization of nondet autom 12. Automata minimization 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 200 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 126 states and ocurred in iteration 10. Nontrivial modules had stage [2, 3, 2, 1, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/33 HoareTripleCheckerStatistics: 174 SDtfs, 298 SDslu, 6 SDs, 0 SdLazy, 349 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax214 hnf93 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq191 hnf89 smp100 dnf113 smp97 tf112 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 9]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7549d630=0, \result=0, i=25} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 Loop: [L9] COND TRUE i > 10 [L10] COND TRUE i == 25 [L11] i = 30 [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...