./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_1b.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/openssl-simplified/s3_srvr_1b.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 153b6d90c91de27e09ed3c918b0b1be779b258e790f6fc392e7d5f390719c2db --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:38:50,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:38:50,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:38:50,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:38:50,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:38:50,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:38:50,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:38:50,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:38:50,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:38:50,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:38:50,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:38:50,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:38:50,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:38:50,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:38:50,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:38:50,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:38:50,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:38:50,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:38:50,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:38:50,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:38:50,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:38:50,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:38:50,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:38:50,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:38:50,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:38:50,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:38:50,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:38:50,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:38:50,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:38:50,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:38:50,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:38:50,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:38:50,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:38:50,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:38:50,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:38:50,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:38:50,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:38:50,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:38:50,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:38:50,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:38:50,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:38:50,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:38:50,165 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:38:50,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:38:50,165 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:38:50,166 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:38:50,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:38:50,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:38:50,167 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:38:50,168 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:38:50,168 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:38:50,168 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:38:50,169 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:38:50,169 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:38:50,169 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:38:50,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:38:50,169 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:38:50,169 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:38:50,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:38:50,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:38:50,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:38:50,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:38:50,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:38:50,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:38:50,170 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:38:50,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:38:50,171 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:38:50,171 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:38:50,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:38:50,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:38:50,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:38:50,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:38:50,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:38:50,172 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:38:50,173 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 153b6d90c91de27e09ed3c918b0b1be779b258e790f6fc392e7d5f390719c2db [2022-02-21 03:38:50,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:38:50,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:38:50,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:38:50,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:38:50,409 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:38:50,410 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1b.cil.c [2022-02-21 03:38:50,458 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f552ced/a4a2a28498ab4bb899999fe642bcec16/FLAGfa165f5b3 [2022-02-21 03:38:50,824 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:38:50,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1b.cil.c [2022-02-21 03:38:50,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f552ced/a4a2a28498ab4bb899999fe642bcec16/FLAGfa165f5b3 [2022-02-21 03:38:50,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f552ced/a4a2a28498ab4bb899999fe642bcec16 [2022-02-21 03:38:50,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:38:50,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:38:50,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:38:50,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:38:50,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:38:50,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:38:50" (1/1) ... [2022-02-21 03:38:50,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d0e288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:50, skipping insertion in model container [2022-02-21 03:38:50,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:38:50" (1/1) ... [2022-02-21 03:38:50,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:38:50,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:38:51,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1b.cil.c[8244,8257] [2022-02-21 03:38:51,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:38:51,067 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:38:51,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1b.cil.c[8244,8257] [2022-02-21 03:38:51,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:38:51,105 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:38:51,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:51 WrapperNode [2022-02-21 03:38:51,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:38:51,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:38:51,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:38:51,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:38:51,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:51" (1/1) ... [2022-02-21 03:38:51,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:51" (1/1) ... [2022-02-21 03:38:51,136 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 73 [2022-02-21 03:38:51,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:38:51,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:38:51,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:38:51,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:38:51,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:51" (1/1) ... [2022-02-21 03:38:51,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:51" (1/1) ... [2022-02-21 03:38:51,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:51" (1/1) ... [2022-02-21 03:38:51,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:51" (1/1) ... [2022-02-21 03:38:51,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:51" (1/1) ... [2022-02-21 03:38:51,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:51" (1/1) ... [2022-02-21 03:38:51,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:51" (1/1) ... [2022-02-21 03:38:51,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:38:51,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:38:51,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:38:51,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:38:51,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:51" (1/1) ... [2022-02-21 03:38:51,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:51,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:51,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:51,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:38:51,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:38:51,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:38:51,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:38:51,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:38:51,290 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:38:51,291 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:38:51,401 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:38:51,405 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:38:51,405 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:38:51,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:38:51 BoogieIcfgContainer [2022-02-21 03:38:51,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:38:51,407 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:38:51,421 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:38:51,423 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:38:51,424 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:38:51,424 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:38:50" (1/3) ... [2022-02-21 03:38:51,424 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@352a19b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:38:51, skipping insertion in model container [2022-02-21 03:38:51,424 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:38:51,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:38:51" (2/3) ... [2022-02-21 03:38:51,425 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@352a19b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:38:51, skipping insertion in model container [2022-02-21 03:38:51,425 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:38:51,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:38:51" (3/3) ... [2022-02-21 03:38:51,426 INFO L388 chiAutomizerObserver]: Analyzing ICFG s3_srvr_1b.cil.c [2022-02-21 03:38:51,463 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:38:51,463 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:38:51,463 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:38:51,464 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:38:51,464 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:38:51,464 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:38:51,464 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:38:51,464 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:38:51,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:51,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:38:51,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:51,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:51,494 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:38:51,494 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:38:51,494 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:38:51,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:51,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:38:51,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:51,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:51,498 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:38:51,498 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:38:51,503 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 7#L111true [2022-02-21 03:38:51,504 INFO L793 eck$LassoCheckResult]: Loop: 7#L111true assume !false; 5#L30true assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 13#L36true assume 8466 == main_~s__state~0#1; 15#L37true assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 18#L69-1true assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; 7#L111true [2022-02-21 03:38:51,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:38:51,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:51,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824921591] [2022-02-21 03:38:51,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:51,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:51,592 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:51,619 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash 39284085, now seen corresponding path program 1 times [2022-02-21 03:38:51,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:51,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704289567] [2022-02-21 03:38:51,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:51,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:51,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:51,654 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:51,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:51,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723571, now seen corresponding path program 1 times [2022-02-21 03:38:51,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:51,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892333396] [2022-02-21 03:38:51,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:51,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:51,674 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:51,687 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:51,797 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:38:51,811 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:38:51,812 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:38:51,812 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:38:51,812 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:38:51,812 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:51,812 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:38:51,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:38:51,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration1_Loop [2022-02-21 03:38:51,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:38:51,813 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:38:51,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:51,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:51,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:51,967 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:38:51,968 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:38:51,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:51,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:51,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:51,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:38:51,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:51,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:38:52,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:52,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:52,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:52,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:52,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:38:52,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:38:52,020 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:52,042 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:38:52,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:52,062 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:38:52,062 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:38:52,062 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:38:52,062 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:38:52,063 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:38:52,063 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:52,063 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:38:52,063 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:38:52,063 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration1_Loop [2022-02-21 03:38:52,063 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:38:52,063 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:38:52,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:52,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:52,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:52,184 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:38:52,188 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:38:52,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:52,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:52,192 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:52,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:38:52,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:38:52,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:38:52,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:38:52,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:38:52,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:38:52,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:38:52,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:38:52,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:38:52,220 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:38:52,225 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:38:52,225 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:38:52,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:52,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:52,228 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:52,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:38:52,286 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:38:52,286 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:38:52,287 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:38:52,287 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~blastFlag~0#1) = -1*ULTIMATE.start_main_~blastFlag~0#1 + 1 Supporting invariants [] [2022-02-21 03:38:52,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:52,314 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:38:52,318 INFO L390 LassoCheck]: Loop: "assume !false;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2;" "assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512;" [2022-02-21 03:38:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:52,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:52,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:38:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:52,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:38:52,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33#unseeded} is VALID [2022-02-21 03:38:52,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {33#unseeded} is VALID [2022-02-21 03:38:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:52,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:38:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:52,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:38:52,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 1))} assume !false; {36#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 1))} is VALID [2022-02-21 03:38:52,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 1))} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {36#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 1))} is VALID [2022-02-21 03:38:52,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 1))} assume 8466 == main_~s__state~0#1; {36#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 1))} is VALID [2022-02-21 03:38:52,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 1))} assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; {63#(and (<= 2 |ULTIMATE.start_main_~blastFlag~0#1|) (<= 1 oldRank0))} is VALID [2022-02-21 03:38:52,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {63#(and (<= 2 |ULTIMATE.start_main_~blastFlag~0#1|) (<= 1 oldRank0))} assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; {46#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~blastFlag~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:38:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:52,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:52,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:52,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:38:52,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,509 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 [2022-02-21 03:38:52,511 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:52,597 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 52 states and 84 transitions. Complement of second has 5 states. [2022-02-21 03:38:52,597 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 [2022-02-21 03:38:52,598 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:38:52,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:52,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:38:52,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:52,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:52,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:52,602 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:38:52,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:52,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:52,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 84 transitions. [2022-02-21 03:38:52,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:38:52,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:52,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:52,606 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:52,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:38:52,610 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:38:52,610 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:52,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:38:52,612 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:38:52,612 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 52 states and 84 transitions. cyclomatic complexity: 34 [2022-02-21 03:38:52,614 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:38:52,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:38:52,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:38:52,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:38:52,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:38:52,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:38:52,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:38:52,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:38:52,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:38:52,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:38:52,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 52 letters. [2022-02-21 03:38:52,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 52 letters. [2022-02-21 03:38:52,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 52 letters. Loop has 52 letters. [2022-02-21 03:38:52,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:38:52,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:38:52,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:38:52,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:38:52,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:38:52,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:38:52,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:38:52,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:38:52,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:38:52,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:38:52,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:38:52,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:38:52,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:38:52,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:38:52,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:38:52,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:52,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:52,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:52,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:52,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:52,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:52,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 9 letters. [2022-02-21 03:38:52,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 9 letters. [2022-02-21 03:38:52,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 9 letters. [2022-02-21 03:38:52,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:38:52,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:38:52,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:38:52,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:38:52,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:38:52,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:38:52,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:38:52,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:38:52,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:38:52,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:52,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:52,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:52,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 9 letters. [2022-02-21 03:38:52,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 9 letters. [2022-02-21 03:38:52,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 9 letters. [2022-02-21 03:38:52,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:38:52,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:38:52,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:38:52,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:52,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:52,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:52,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:38:52,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:38:52,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:38:52,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 9 letters. [2022-02-21 03:38:52,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 9 letters. [2022-02-21 03:38:52,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 9 letters. [2022-02-21 03:38:52,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:38:52,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:38:52,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:38:52,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:38:52,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:38:52,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:38:52,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:38:52,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:38:52,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:38:52,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:52,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:52,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:52,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:38:52,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:38:52,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:38:52,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:38:52,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:38:52,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:38:52,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:52,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:52,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:52,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:38:52,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:38:52,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:38:52,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 9 letters. [2022-02-21 03:38:52,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 9 letters. [2022-02-21 03:38:52,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 9 letters. [2022-02-21 03:38:52,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:38:52,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:38:52,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:38:52,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:38:52,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:38:52,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:38:52,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 9 letters. [2022-02-21 03:38:52,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 9 letters. [2022-02-21 03:38:52,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 9 letters. [2022-02-21 03:38:52,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:38:52,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:38:52,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:38:52,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:38:52,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:38:52,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:38:52,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:52,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:52,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:52,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:52,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:52,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:52,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:38:52,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:38:52,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:38:52,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 9 letters. [2022-02-21 03:38:52,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 9 letters. [2022-02-21 03:38:52,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 9 letters. [2022-02-21 03:38:52,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:38:52,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:38:52,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 84 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:38:52,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,675 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:38:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-02-21 03:38:52,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:38:52,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:38:52,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 10 letters. [2022-02-21 03:38:52,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:52,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 84 transitions. cyclomatic complexity: 34 [2022-02-21 03:38:52,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:38:52,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 38 states and 59 transitions. [2022-02-21 03:38:52,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-02-21 03:38:52,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-02-21 03:38:52,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 59 transitions. [2022-02-21 03:38:52,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:52,703 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 59 transitions. [2022-02-21 03:38:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 59 transitions. [2022-02-21 03:38:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-02-21 03:38:52,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:52,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 59 transitions. Second operand has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:52,721 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 59 transitions. Second operand has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:52,722 INFO L87 Difference]: Start difference. First operand 38 states and 59 transitions. Second operand has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:52,724 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:52,726 INFO L93 Difference]: Finished difference Result 38 states and 59 transitions. [2022-02-21 03:38:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 59 transitions. [2022-02-21 03:38:52,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:52,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:52,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states and 59 transitions. [2022-02-21 03:38:52,727 INFO L87 Difference]: Start difference. First operand has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states and 59 transitions. [2022-02-21 03:38:52,727 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:52,729 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2022-02-21 03:38:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2022-02-21 03:38:52,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:52,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:52,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:52,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 57 transitions. [2022-02-21 03:38:52,731 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 57 transitions. [2022-02-21 03:38:52,731 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 57 transitions. [2022-02-21 03:38:52,731 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:38:52,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 57 transitions. [2022-02-21 03:38:52,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:38:52,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:52,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:52,732 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:38:52,733 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:38:52,733 INFO L791 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); 127#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 150#L111 assume !false; 128#L30 [2022-02-21 03:38:52,733 INFO L793 eck$LassoCheckResult]: Loop: 128#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 129#L36 assume 8466 == main_~s__state~0#1; 151#L37 assume !(0 == main_~blastFlag~0#1); 157#L69-1 assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; 136#L111 assume !false; 128#L30 [2022-02-21 03:38:52,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-02-21 03:38:52,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:52,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875913629] [2022-02-21 03:38:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:52,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:52,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:52,742 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:52,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash 44013377, now seen corresponding path program 1 times [2022-02-21 03:38:52,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:52,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619778299] [2022-02-21 03:38:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:52,747 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:52,749 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:52,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:52,749 INFO L85 PathProgramCache]: Analyzing trace with hash 297857786, now seen corresponding path program 1 times [2022-02-21 03:38:52,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:52,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386660303] [2022-02-21 03:38:52,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:52,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:52,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {299#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {299#true} is VALID [2022-02-21 03:38:52,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {299#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {301#(= |ULTIMATE.start_main_~blastFlag~0#1| 0)} is VALID [2022-02-21 03:38:52,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#(= |ULTIMATE.start_main_~blastFlag~0#1| 0)} assume !false; {301#(= |ULTIMATE.start_main_~blastFlag~0#1| 0)} is VALID [2022-02-21 03:38:52,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {301#(= |ULTIMATE.start_main_~blastFlag~0#1| 0)} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {301#(= |ULTIMATE.start_main_~blastFlag~0#1| 0)} is VALID [2022-02-21 03:38:52,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {301#(= |ULTIMATE.start_main_~blastFlag~0#1| 0)} assume 8466 == main_~s__state~0#1; {301#(= |ULTIMATE.start_main_~blastFlag~0#1| 0)} is VALID [2022-02-21 03:38:52,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#(= |ULTIMATE.start_main_~blastFlag~0#1| 0)} assume !(0 == main_~blastFlag~0#1); {300#false} is VALID [2022-02-21 03:38:52,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {300#false} assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; {300#false} is VALID [2022-02-21 03:38:52,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#false} assume !false; {300#false} is VALID [2022-02-21 03:38:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:52,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:38:52,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386660303] [2022-02-21 03:38:52,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386660303] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:38:52,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:38:52,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:38:52,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766817991] [2022-02-21 03:38:52,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:38:52,810 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:38:52,810 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:38:52,810 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:38:52,810 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:38:52,810 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:38:52,810 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:52,810 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:38:52,810 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:38:52,811 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration2_Loop [2022-02-21 03:38:52,811 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:38:52,811 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:38:52,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:52,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:52,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:52,865 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:38:52,865 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:38:52,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:52,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:52,879 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:52,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:38:52,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:38:52,882 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:52,908 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:38:52,908 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~blastFlag~0#1=-1} Honda state: {ULTIMATE.start_main_~blastFlag~0#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:38:52,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:52,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:52,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:52,927 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:52,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:38:52,935 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:52,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:38:52,956 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:38:52,956 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__hit~0#1=0} Honda state: {ULTIMATE.start_main_~s__hit~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:38:52,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:52,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:52,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:52,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:52,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:38:53,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:38:53,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:53,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:38:53,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:53,052 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:53,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:38:53,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:38:53,055 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:53,064 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:38:53,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:53,081 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:38:53,081 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:38:53,082 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:38:53,082 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:38:53,082 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:38:53,082 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,082 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:38:53,082 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:38:53,082 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration2_Loop [2022-02-21 03:38:53,082 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:38:53,082 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:38:53,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:53,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:53,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:53,146 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:38:53,146 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:38:53,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:53,148 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:53,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:38:53,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:38:53,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:38:53,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:38:53,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:38:53,199 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:38:53,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:38:53,199 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:38:53,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:38:53,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:38:53,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:53,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:53,222 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:53,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:38:53,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:38:53,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:38:53,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:38:53,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:38:53,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:38:53,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:38:53,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:38:53,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:38:53,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:38:53,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:53,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:53,282 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:53,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:38:53,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:38:53,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:38:53,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:38:53,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:38:53,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:38:53,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:38:53,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:38:53,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:38:53,307 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:38:53,320 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:38:53,320 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:38:53,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:53,326 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:53,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:38:53,328 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:38:53,328 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:38:53,328 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:38:53,328 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0#1) = -1*ULTIMATE.start_main_~s__state~0#1 + 8489 Supporting invariants [] [2022-02-21 03:38:53,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:53,351 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:38:53,354 INFO L390 LassoCheck]: Loop: "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume 8466 == main_~s__state~0#1;" "assume !(0 == main_~blastFlag~0#1);" "assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512;" "assume !false;" [2022-02-21 03:38:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:53,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:53,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:38:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:53,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:38:53,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {302#unseeded} is VALID [2022-02-21 03:38:53,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {302#unseeded} is VALID [2022-02-21 03:38:53,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#unseeded} assume !false; {302#unseeded} is VALID [2022-02-21 03:38:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:53,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:38:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:53,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:38:53,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {305#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~s__state~0#1|) 8489))} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {305#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~s__state~0#1|) 8489))} is VALID [2022-02-21 03:38:53,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~s__state~0#1|) 8489))} assume 8466 == main_~s__state~0#1; {329#(<= 23 oldRank0)} is VALID [2022-02-21 03:38:53,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {329#(<= 23 oldRank0)} assume !(0 == main_~blastFlag~0#1); {329#(<= 23 oldRank0)} is VALID [2022-02-21 03:38:53,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {329#(<= 23 oldRank0)} assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; {336#(and (<= 23 oldRank0) (<= 8512 |ULTIMATE.start_main_~s__state~0#1|))} is VALID [2022-02-21 03:38:53,460 INFO L290 TraceCheckUtils]: 4: Hoare triple {336#(and (<= 23 oldRank0) (<= 8512 |ULTIMATE.start_main_~s__state~0#1|))} assume !false; {315#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~s__state~0#1|) 8489))))} is VALID [2022-02-21 03:38:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:53,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:53,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:38:53,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,464 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 [2022-02-21 03:38:53,465 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 57 transitions. cyclomatic complexity: 23 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:53,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:53,546 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 57 transitions. cyclomatic complexity: 23. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 104 states and 155 transitions. Complement of second has 7 states. [2022-02-21 03:38:53,546 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 [2022-02-21 03:38:53,546 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:38:53,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 57 transitions. cyclomatic complexity: 23 [2022-02-21 03:38:53,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:53,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:53,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:38:53,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:53,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:53,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 155 transitions. [2022-02-21 03:38:53,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:38:53,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:53,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:53,549 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 57 transitions. cyclomatic complexity: 23 [2022-02-21 03:38:53,550 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:38:53,550 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:38:53,551 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:38:53,551 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 104 states and 155 transitions. cyclomatic complexity: 55 [2022-02-21 03:38:53,552 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:38:53,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:38:53,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:38:53,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:38:53,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:53,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:53,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:53,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:38:53,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:38:53,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:38:53,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 104 letters. Loop has 104 letters. [2022-02-21 03:38:53,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 104 letters. [2022-02-21 03:38:53,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 104 letters. Loop has 104 letters. [2022-02-21 03:38:53,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:38:53,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:38:53,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:38:53,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:38:53,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:38:53,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:38:53,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:38:53,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:38:53,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:38:53,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:38:53,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:38:53,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:38:53,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:38:53,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:38:53,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:38:53,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 9 letters. [2022-02-21 03:38:53,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 9 letters. [2022-02-21 03:38:53,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 7 letters. Loop has 9 letters. [2022-02-21 03:38:53,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 9 letters. [2022-02-21 03:38:53,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 9 letters. [2022-02-21 03:38:53,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 8 letters. Loop has 9 letters. [2022-02-21 03:38:53,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:38:53,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:38:53,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:38:53,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:38:53,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:38:53,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:38:53,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:38:53,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:38:53,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:38:53,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:38:53,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:38:53,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:38:53,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:53,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:53,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:53,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 9 letters. [2022-02-21 03:38:53,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 9 letters. [2022-02-21 03:38:53,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 10 letters. Loop has 9 letters. [2022-02-21 03:38:53,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:53,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:53,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:53,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:53,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:53,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:53,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:38:53,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:38:53,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:38:53,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:53,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:53,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:53,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:38:53,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:38:53,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:38:53,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:53,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:53,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:53,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:53,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:53,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:53,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:53,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:53,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:53,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 16 letters. Loop has 9 letters. [2022-02-21 03:38:53,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 9 letters. [2022-02-21 03:38:53,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 16 letters. Loop has 9 letters. [2022-02-21 03:38:53,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:38:53,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:38:53,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:38:53,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:38:53,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:38:53,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:38:53,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:53,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:53,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:53,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:38:53,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:38:53,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:38:53,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:38:53,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:38:53,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:38:53,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:38:53,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:38:53,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:38:53,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:53,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:53,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:53,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:38:53,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:38:53,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:38:53,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:53,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:53,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:53,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:38:53,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:38:53,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:38:53,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:38:53,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:38:53,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:38:53,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:38:53,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:38:53,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:38:53,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 57 transitions. cyclomatic complexity: 23 Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:53,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:53,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 155 transitions. cyclomatic complexity: 55 Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:53,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,567 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:38:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-02-21 03:38:53,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:38:53,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:38:53,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 3 letters. Loop has 10 letters. [2022-02-21 03:38:53,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:53,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 155 transitions. cyclomatic complexity: 55 [2022-02-21 03:38:53,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:38:53,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 77 states and 121 transitions. [2022-02-21 03:38:53,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-02-21 03:38:53,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-02-21 03:38:53,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 121 transitions. [2022-02-21 03:38:53,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:53,573 INFO L681 BuchiCegarLoop]: Abstraction has 77 states and 121 transitions. [2022-02-21 03:38:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 121 transitions. [2022-02-21 03:38:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2022-02-21 03:38:53,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:53,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states and 121 transitions. Second operand has 54 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 53 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,575 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states and 121 transitions. Second operand has 54 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 53 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,576 INFO L87 Difference]: Start difference. First operand 77 states and 121 transitions. Second operand has 54 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 53 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,576 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:53,578 INFO L93 Difference]: Finished difference Result 78 states and 123 transitions. [2022-02-21 03:38:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2022-02-21 03:38:53,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:53,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:53,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 53 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states and 121 transitions. [2022-02-21 03:38:53,579 INFO L87 Difference]: Start difference. First operand has 54 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 53 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states and 121 transitions. [2022-02-21 03:38:53,579 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:53,582 INFO L93 Difference]: Finished difference Result 81 states and 126 transitions. [2022-02-21 03:38:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2022-02-21 03:38:53,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:53,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:53,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:53,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 53 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 86 transitions. [2022-02-21 03:38:53,584 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 86 transitions. [2022-02-21 03:38:53,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:38:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:38:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:38:53,588 INFO L87 Difference]: Start difference. First operand 54 states and 86 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:38:53,631 INFO L93 Difference]: Finished difference Result 90 states and 128 transitions. [2022-02-21 03:38:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:38:53,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:53,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 128 transitions. [2022-02-21 03:38:53,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2022-02-21 03:38:53,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 87 states and 125 transitions. [2022-02-21 03:38:53,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-02-21 03:38:53,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-02-21 03:38:53,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 125 transitions. [2022-02-21 03:38:53,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:53,647 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 125 transitions. [2022-02-21 03:38:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 125 transitions. [2022-02-21 03:38:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-02-21 03:38:53,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:53,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states and 125 transitions. Second operand has 85 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 84 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,651 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states and 125 transitions. Second operand has 85 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 84 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,651 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 85 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 84 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,651 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:53,653 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2022-02-21 03:38:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2022-02-21 03:38:53,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:53,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:53,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 84 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states and 125 transitions. [2022-02-21 03:38:53,654 INFO L87 Difference]: Start difference. First operand has 85 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 84 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states and 125 transitions. [2022-02-21 03:38:53,654 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:53,657 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2022-02-21 03:38:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2022-02-21 03:38:53,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:53,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:53,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:53,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 84 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2022-02-21 03:38:53,659 INFO L704 BuchiCegarLoop]: Abstraction has 85 states and 123 transitions. [2022-02-21 03:38:53,659 INFO L587 BuchiCegarLoop]: Abstraction has 85 states and 123 transitions. [2022-02-21 03:38:53,659 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:38:53,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 123 transitions. [2022-02-21 03:38:53,659 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2022-02-21 03:38:53,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:53,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:53,660 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:38:53,660 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:38:53,660 INFO L791 eck$LassoCheckResult]: Stem: 842#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); 843#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 864#L111 assume !false; 838#L30 [2022-02-21 03:38:53,660 INFO L793 eck$LassoCheckResult]: Loop: 838#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 839#L36 assume !(8466 == main_~s__state~0#1); 861#L41 assume 8512 == main_~s__state~0#1; 865#L42 main_~tmp___1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 859#L81 assume 0 != main_~tmp___1~0#1;main_~s__state~0#1 := 8466; 848#L111 assume !false; 838#L30 [2022-02-21 03:38:53,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:53,660 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 2 times [2022-02-21 03:38:53,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:53,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791992400] [2022-02-21 03:38:53,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:53,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:53,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:53,668 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:53,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:53,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1365729718, now seen corresponding path program 1 times [2022-02-21 03:38:53,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:53,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078282781] [2022-02-21 03:38:53,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:53,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:53,672 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:53,674 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash 644971805, now seen corresponding path program 1 times [2022-02-21 03:38:53,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:53,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734355210] [2022-02-21 03:38:53,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:53,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {1206#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1206#true} is VALID [2022-02-21 03:38:53,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {1208#(= (+ (- 8466) |ULTIMATE.start_main_~s__state~0#1|) 0)} is VALID [2022-02-21 03:38:53,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1208#(= (+ (- 8466) |ULTIMATE.start_main_~s__state~0#1|) 0)} assume !false; {1208#(= (+ (- 8466) |ULTIMATE.start_main_~s__state~0#1|) 0)} is VALID [2022-02-21 03:38:53,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {1208#(= (+ (- 8466) |ULTIMATE.start_main_~s__state~0#1|) 0)} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {1208#(= (+ (- 8466) |ULTIMATE.start_main_~s__state~0#1|) 0)} is VALID [2022-02-21 03:38:53,692 INFO L290 TraceCheckUtils]: 4: Hoare triple {1208#(= (+ (- 8466) |ULTIMATE.start_main_~s__state~0#1|) 0)} assume !(8466 == main_~s__state~0#1); {1207#false} is VALID [2022-02-21 03:38:53,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {1207#false} assume 8512 == main_~s__state~0#1; {1207#false} is VALID [2022-02-21 03:38:53,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {1207#false} main_~tmp___1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1207#false} is VALID [2022-02-21 03:38:53,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {1207#false} assume 0 != main_~tmp___1~0#1;main_~s__state~0#1 := 8466; {1207#false} is VALID [2022-02-21 03:38:53,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {1207#false} assume !false; {1207#false} is VALID [2022-02-21 03:38:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:53,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:38:53,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734355210] [2022-02-21 03:38:53,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734355210] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:38:53,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:38:53,693 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:38:53,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621356052] [2022-02-21 03:38:53,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:38:53,719 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:38:53,719 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:38:53,719 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:38:53,720 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:38:53,720 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:38:53,720 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,720 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:38:53,720 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:38:53,720 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration3_Loop [2022-02-21 03:38:53,720 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:38:53,720 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:38:53,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:53,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:53,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:53,766 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:38:53,766 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:38:53,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:53,767 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:53,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:38:53,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:53,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:38:53,828 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:38:53,828 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~blastFlag~0#1=2} Honda state: {ULTIMATE.start_main_~blastFlag~0#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:38:53,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:53,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:53,845 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:53,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:38:53,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:38:53,847 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:53,860 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:38:53,860 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=5, ULTIMATE.start_main_~tmp___1~0#1=5} Honda state: {ULTIMATE.start_main_#t~nondet5#1=5, ULTIMATE.start_main_~tmp___1~0#1=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:38:53,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:53,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:53,881 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:53,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:38:53,884 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:38:53,884 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:53,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:53,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:53,922 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:53,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:38:53,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:38:53,924 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:53,931 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:38:53,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:53,947 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:38:53,947 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:38:53,947 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:38:53,947 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:38:53,947 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:38:53,947 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,947 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:38:53,947 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:38:53,947 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration3_Loop [2022-02-21 03:38:53,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:38:53,947 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:38:53,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:53,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:53,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:53,997 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:38:53,997 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:38:53,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:53,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:54,012 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:54,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:38:54,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:38:54,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:38:54,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:38:54,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:38:54,021 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:38:54,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:38:54,022 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:38:54,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:38:54,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:38:54,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:54,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:54,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:54,057 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:54,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:38:54,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:38:54,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:38:54,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:38:54,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:38:54,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:38:54,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:38:54,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:38:54,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:38:54,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:38:54,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:54,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:54,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:54,097 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:54,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:38:54,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:38:54,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:38:54,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:38:54,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:38:54,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:38:54,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:38:54,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:38:54,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:38:54,125 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:38:54,127 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:38:54,127 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:38:54,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:54,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:54,128 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:54,134 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:38:54,134 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:38:54,134 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:38:54,134 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0#1) = 1*ULTIMATE.start_main_~s__state~0#1 Supporting invariants [] [2022-02-21 03:38:54,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:38:54,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:54,156 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:38:54,159 INFO L390 LassoCheck]: Loop: "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" "assume 8512 == main_~s__state~0#1;" "main_~tmp___1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume 0 != main_~tmp___1~0#1;main_~s__state~0#1 := 8466;" "assume !false;" [2022-02-21 03:38:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:54,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:54,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:38:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:54,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:38:54,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {1209#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1209#unseeded} is VALID [2022-02-21 03:38:54,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {1209#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {1209#unseeded} is VALID [2022-02-21 03:38:54,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {1209#unseeded} assume !false; {1209#unseeded} is VALID [2022-02-21 03:38:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:54,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:38:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:54,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:38:54,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {1212#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {1212#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:54,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {1212#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} assume !(8466 == main_~s__state~0#1); {1212#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:54,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {1212#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} assume 8512 == main_~s__state~0#1; {1239#(<= 8512 oldRank0)} is VALID [2022-02-21 03:38:54,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {1239#(<= 8512 oldRank0)} main_~tmp___1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1239#(<= 8512 oldRank0)} is VALID [2022-02-21 03:38:54,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {1239#(<= 8512 oldRank0)} assume 0 != main_~tmp___1~0#1;main_~s__state~0#1 := 8466; {1246#(and (<= 8512 oldRank0) (<= |ULTIMATE.start_main_~s__state~0#1| 8466))} is VALID [2022-02-21 03:38:54,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {1246#(and (<= 8512 oldRank0) (<= |ULTIMATE.start_main_~s__state~0#1| 8466))} assume !false; {1222#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~s__state~0#1|)) unseeded)} is VALID [2022-02-21 03:38:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:54,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:54,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:38:54,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,241 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 [2022-02-21 03:38:54,241 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 123 transitions. cyclomatic complexity: 44 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 123 transitions. cyclomatic complexity: 44. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 170 states and 232 transitions. Complement of second has 9 states. [2022-02-21 03:38:54,341 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 [2022-02-21 03:38:54,341 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:38:54,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 123 transitions. cyclomatic complexity: 44 [2022-02-21 03:38:54,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:54,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:54,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:38:54,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:54,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:54,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 232 transitions. [2022-02-21 03:38:54,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2022-02-21 03:38:54,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:54,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:54,343 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 85 states and 123 transitions. cyclomatic complexity: 44 [2022-02-21 03:38:54,344 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 30 examples of accepted words. [2022-02-21 03:38:54,344 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:38:54,345 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:38:54,345 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 170 states and 232 transitions. cyclomatic complexity: 70 [2022-02-21 03:38:54,346 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 30 examples of accepted words. [2022-02-21 03:38:54,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:38:54,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:38:54,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:38:54,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:54,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:54,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:54,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:54,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:54,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:54,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 170 letters. Loop has 170 letters. [2022-02-21 03:38:54,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 170 letters. Loop has 170 letters. [2022-02-21 03:38:54,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 170 letters. Loop has 170 letters. [2022-02-21 03:38:54,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 85 letters. Loop has 85 letters. [2022-02-21 03:38:54,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 85 letters. [2022-02-21 03:38:54,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 85 letters. Loop has 85 letters. [2022-02-21 03:38:54,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:54,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:54,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:54,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:54,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:54,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:54,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:38:54,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:38:54,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:38:54,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:38:54,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:38:54,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:38:54,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:38:54,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:38:54,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:38:54,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:38:54,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:38:54,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 6 letters. Loop has 7 letters. [2022-02-21 03:38:54,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:38:54,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:38:54,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:38:54,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 8 letters. Loop has 10 letters. [2022-02-21 03:38:54,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 10 letters. [2022-02-21 03:38:54,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 8 letters. Loop has 10 letters. [2022-02-21 03:38:54,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:38:54,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:38:54,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:38:54,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:38:54,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:38:54,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:38:54,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:38:54,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:38:54,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:38:54,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 9 letters. Loop has 10 letters. [2022-02-21 03:38:54,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 10 letters. [2022-02-21 03:38:54,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 9 letters. Loop has 10 letters. [2022-02-21 03:38:54,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:54,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:54,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:54,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:54,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:54,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:54,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:38:54,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:38:54,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:38:54,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:54,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:54,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:54,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:54,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:54,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:54,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:38:54,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:38:54,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:38:54,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:38:54,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:38:54,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:38:54,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:54,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:54,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:54,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:38:54,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:38:54,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:38:54,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:54,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:54,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:54,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:38:54,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:38:54,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:38:54,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:54,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:54,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:54,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:54,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:54,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:54,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:54,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:54,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:54,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:54,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:54,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:54,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:54,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:54,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:54,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:38:54,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:38:54,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:38:54,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:38:54,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:38:54,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:38:54,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:38:54,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:38:54,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:38:54,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:54,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:54,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:54,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:38:54,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:38:54,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:38:54,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:54,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:54,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:54,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:54,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:54,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:38:54,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:54,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:54,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:54,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:54,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:54,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:54,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:38:54,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:38:54,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:38:54,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:54,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:54,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:54,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:54,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:54,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:54,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:54,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:54,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:38:54,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:54,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:54,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:54,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:38:54,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:38:54,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:38:54,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:54,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:54,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:54,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:38:54,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:38:54,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:38:54,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:54,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:54,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:54,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:38:54,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:38:54,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:38:54,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:54,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:54,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:54,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:38:54,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:38:54,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:38:54,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:38:54,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:38:54,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:38:54,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:54,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:54,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:38:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:38:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:38:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:54,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:54,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:54,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:54,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:54,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:54,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:38:54,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:38:54,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:38:54,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:54,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:54,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:54,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:38:54,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:38:54,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:38:54,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:54,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:54,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:54,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:38:54,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:38:54,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:38:54,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:54,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:54,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:54,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 123 transitions. cyclomatic complexity: 44 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:54,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:54,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 170 states and 232 transitions. cyclomatic complexity: 70 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:54,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,397 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:38:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-02-21 03:38:54,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:38:54,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:38:54,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 3 letters. Loop has 12 letters. [2022-02-21 03:38:54,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 232 transitions. cyclomatic complexity: 70 [2022-02-21 03:38:54,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2022-02-21 03:38:54,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 141 states and 196 transitions. [2022-02-21 03:38:54,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2022-02-21 03:38:54,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2022-02-21 03:38:54,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 196 transitions. [2022-02-21 03:38:54,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:54,405 INFO L681 BuchiCegarLoop]: Abstraction has 141 states and 196 transitions. [2022-02-21 03:38:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 196 transitions. [2022-02-21 03:38:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2022-02-21 03:38:54,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:54,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states and 196 transitions. Second operand has 105 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 104 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,409 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states and 196 transitions. Second operand has 105 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 104 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,409 INFO L87 Difference]: Start difference. First operand 141 states and 196 transitions. Second operand has 105 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 104 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,409 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:54,412 INFO L93 Difference]: Finished difference Result 143 states and 199 transitions. [2022-02-21 03:38:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 199 transitions. [2022-02-21 03:38:54,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:54,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:54,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 104 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 141 states and 196 transitions. [2022-02-21 03:38:54,413 INFO L87 Difference]: Start difference. First operand has 105 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 104 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 141 states and 196 transitions. [2022-02-21 03:38:54,414 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:54,417 INFO L93 Difference]: Finished difference Result 143 states and 199 transitions. [2022-02-21 03:38:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 199 transitions. [2022-02-21 03:38:54,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:54,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:54,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:54,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 104 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2022-02-21 03:38:54,420 INFO L704 BuchiCegarLoop]: Abstraction has 105 states and 148 transitions. [2022-02-21 03:38:54,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:38:54,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:38:54,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:38:54,420 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:38:54,445 INFO L93 Difference]: Finished difference Result 65 states and 94 transitions. [2022-02-21 03:38:54,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:38:54,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:54,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 94 transitions. [2022-02-21 03:38:54,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2022-02-21 03:38:54,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 61 states and 90 transitions. [2022-02-21 03:38:54,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-02-21 03:38:54,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-02-21 03:38:54,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 90 transitions. [2022-02-21 03:38:54,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:54,454 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 90 transitions. [2022-02-21 03:38:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 90 transitions. [2022-02-21 03:38:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-02-21 03:38:54,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:54,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states and 90 transitions. Second operand has 61 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 60 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,456 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states and 90 transitions. Second operand has 61 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 60 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,456 INFO L87 Difference]: Start difference. First operand 61 states and 90 transitions. Second operand has 61 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 60 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,456 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:54,458 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2022-02-21 03:38:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2022-02-21 03:38:54,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:54,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:54,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 60 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 61 states and 90 transitions. [2022-02-21 03:38:54,458 INFO L87 Difference]: Start difference. First operand has 61 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 60 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 61 states and 90 transitions. [2022-02-21 03:38:54,458 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:54,460 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2022-02-21 03:38:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2022-02-21 03:38:54,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:54,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:54,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:54,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 60 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2022-02-21 03:38:54,461 INFO L704 BuchiCegarLoop]: Abstraction has 61 states and 90 transitions. [2022-02-21 03:38:54,461 INFO L587 BuchiCegarLoop]: Abstraction has 61 states and 90 transitions. [2022-02-21 03:38:54,461 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:38:54,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 90 transitions. [2022-02-21 03:38:54,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2022-02-21 03:38:54,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:54,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:54,462 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:54,462 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:38:54,462 INFO L791 eck$LassoCheckResult]: Stem: 2010#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); 2011#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 2020#L111 assume !false; 2014#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2015#L36 assume 8466 == main_~s__state~0#1; 2040#L37 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 2044#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 2057#L111 assume !false; 2012#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2013#L36 assume !(8466 == main_~s__state~0#1); 2045#L41 [2022-02-21 03:38:54,462 INFO L793 eck$LassoCheckResult]: Loop: 2045#L41 assume 8512 == main_~s__state~0#1; 2041#L42 main_~tmp___1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2033#L81 assume !(0 != main_~tmp___1~0#1);main_~s__state~0#1 := 8640; 2035#L111 assume !false; 2052#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2051#L36 assume !(8466 == main_~s__state~0#1); 2045#L41 [2022-02-21 03:38:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:54,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1523382593, now seen corresponding path program 1 times [2022-02-21 03:38:54,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:54,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956809725] [2022-02-21 03:38:54,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:54,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:54,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:54,473 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:54,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1623382260, now seen corresponding path program 1 times [2022-02-21 03:38:54,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:54,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100322058] [2022-02-21 03:38:54,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:54,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:54,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:54,479 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:54,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:54,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1141286606, now seen corresponding path program 1 times [2022-02-21 03:38:54,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:54,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424586430] [2022-02-21 03:38:54,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:54,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:54,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {2286#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2286#true} is VALID [2022-02-21 03:38:54,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {2286#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {2286#true} is VALID [2022-02-21 03:38:54,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {2286#true} assume !false; {2286#true} is VALID [2022-02-21 03:38:54,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {2286#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {2286#true} is VALID [2022-02-21 03:38:54,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {2286#true} assume 8466 == main_~s__state~0#1; {2286#true} is VALID [2022-02-21 03:38:54,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {2286#true} assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; {2286#true} is VALID [2022-02-21 03:38:54,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {2286#true} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; {2288#(<= 8656 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:54,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {2288#(<= 8656 |ULTIMATE.start_main_~s__state~0#1|)} assume !false; {2288#(<= 8656 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:54,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {2288#(<= 8656 |ULTIMATE.start_main_~s__state~0#1|)} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {2288#(<= 8656 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:54,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {2288#(<= 8656 |ULTIMATE.start_main_~s__state~0#1|)} assume !(8466 == main_~s__state~0#1); {2288#(<= 8656 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:54,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {2288#(<= 8656 |ULTIMATE.start_main_~s__state~0#1|)} assume 8512 == main_~s__state~0#1; {2287#false} is VALID [2022-02-21 03:38:54,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {2287#false} main_~tmp___1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2287#false} is VALID [2022-02-21 03:38:54,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {2287#false} assume !(0 != main_~tmp___1~0#1);main_~s__state~0#1 := 8640; {2287#false} is VALID [2022-02-21 03:38:54,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {2287#false} assume !false; {2287#false} is VALID [2022-02-21 03:38:54,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {2287#false} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {2287#false} is VALID [2022-02-21 03:38:54,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {2287#false} assume !(8466 == main_~s__state~0#1); {2287#false} is VALID [2022-02-21 03:38:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:54,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:38:54,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424586430] [2022-02-21 03:38:54,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424586430] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:38:54,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:38:54,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:38:54,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347226449] [2022-02-21 03:38:54,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:38:54,519 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:38:54,519 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:38:54,519 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:38:54,519 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:38:54,519 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:38:54,519 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:54,519 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:38:54,519 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:38:54,520 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration4_Loop [2022-02-21 03:38:54,520 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:38:54,520 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:38:54,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:54,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:54,553 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:38:54,553 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:38:54,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:54,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:54,554 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:54,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:38:54,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:38:54,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:54,577 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:38:54,577 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=0, ULTIMATE.start_main_~tmp___1~0#1=0} Honda state: {ULTIMATE.start_main_#t~nondet5#1=0, ULTIMATE.start_main_~tmp___1~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:38:54,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:54,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:54,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:54,596 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:54,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:38:54,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:38:54,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:54,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:54,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:54,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:54,625 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:54,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:38:54,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:38:54,629 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:54,642 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:38:54,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:54,657 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:38:54,657 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:38:54,657 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:38:54,657 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:38:54,657 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:38:54,657 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:54,657 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:38:54,657 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:38:54,657 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration4_Loop [2022-02-21 03:38:54,657 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:38:54,657 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:38:54,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:54,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:54,692 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:38:54,692 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:38:54,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:54,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:54,694 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:54,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:38:54,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:38:54,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:38:54,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:38:54,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:38:54,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:38:54,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:38:54,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:38:54,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:38:54,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:38:54,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:54,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:54,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:54,729 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:54,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:38:54,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:38:54,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:38:54,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:38:54,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:38:54,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:38:54,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:38:54,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:38:54,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:38:54,757 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:38:54,759 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:38:54,759 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:38:54,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:54,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:54,761 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:54,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:38:54,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:38:54,763 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:38:54,763 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:38:54,764 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0#1) = -1*ULTIMATE.start_main_~s__state~0#1 + 8576 Supporting invariants [] [2022-02-21 03:38:54,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:54,797 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:38:54,799 INFO L390 LassoCheck]: Loop: "assume 8512 == main_~s__state~0#1;" "main_~tmp___1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume !(0 != main_~tmp___1~0#1);main_~s__state~0#1 := 8640;" "assume !false;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" [2022-02-21 03:38:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:54,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:38:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:54,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:38:54,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {2289#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2289#unseeded} is VALID [2022-02-21 03:38:54,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {2289#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {2289#unseeded} is VALID [2022-02-21 03:38:54,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {2289#unseeded} assume !false; {2289#unseeded} is VALID [2022-02-21 03:38:54,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {2289#unseeded} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {2289#unseeded} is VALID [2022-02-21 03:38:54,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {2289#unseeded} assume 8466 == main_~s__state~0#1; {2289#unseeded} is VALID [2022-02-21 03:38:54,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {2289#unseeded} assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; {2289#unseeded} is VALID [2022-02-21 03:38:54,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {2289#unseeded} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; {2289#unseeded} is VALID [2022-02-21 03:38:54,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {2289#unseeded} assume !false; {2289#unseeded} is VALID [2022-02-21 03:38:54,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {2289#unseeded} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {2289#unseeded} is VALID [2022-02-21 03:38:54,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {2289#unseeded} assume !(8466 == main_~s__state~0#1); {2289#unseeded} is VALID [2022-02-21 03:38:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:54,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:38:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:54,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:38:54,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {2292#(>= oldRank0 (+ 8576 (* (- 1) |ULTIMATE.start_main_~s__state~0#1|)))} assume 8512 == main_~s__state~0#1; {2334#(<= 64 oldRank0)} is VALID [2022-02-21 03:38:54,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#(<= 64 oldRank0)} main_~tmp___1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2334#(<= 64 oldRank0)} is VALID [2022-02-21 03:38:54,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#(<= 64 oldRank0)} assume !(0 != main_~tmp___1~0#1);main_~s__state~0#1 := 8640; {2341#(and (<= 64 oldRank0) (<= 8640 |ULTIMATE.start_main_~s__state~0#1|))} is VALID [2022-02-21 03:38:54,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {2341#(and (<= 64 oldRank0) (<= 8640 |ULTIMATE.start_main_~s__state~0#1|))} assume !false; {2341#(and (<= 64 oldRank0) (<= 8640 |ULTIMATE.start_main_~s__state~0#1|))} is VALID [2022-02-21 03:38:54,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {2341#(and (<= 64 oldRank0) (<= 8640 |ULTIMATE.start_main_~s__state~0#1|))} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {2341#(and (<= 64 oldRank0) (<= 8640 |ULTIMATE.start_main_~s__state~0#1|))} is VALID [2022-02-21 03:38:54,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {2341#(and (<= 64 oldRank0) (<= 8640 |ULTIMATE.start_main_~s__state~0#1|))} assume !(8466 == main_~s__state~0#1); {2302#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 8576 (* (- 1) |ULTIMATE.start_main_~s__state~0#1|)))))} is VALID [2022-02-21 03:38:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:54,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:54,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:54,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:54,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:54,910 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 [2022-02-21 03:38:54,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 90 transitions. cyclomatic complexity: 33 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,019 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 90 transitions. cyclomatic complexity: 33. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 183 states and 281 transitions. Complement of second has 9 states. [2022-02-21 03:38:55,019 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 [2022-02-21 03:38:55,020 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:38:55,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 90 transitions. cyclomatic complexity: 33 [2022-02-21 03:38:55,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:55,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:55,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:38:55,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:55,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:55,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 281 transitions. [2022-02-21 03:38:55,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2022-02-21 03:38:55,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:55,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:55,022 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 61 states and 90 transitions. cyclomatic complexity: 33 [2022-02-21 03:38:55,023 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2022-02-21 03:38:55,023 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:38:55,024 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:38:55,024 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 183 states and 281 transitions. cyclomatic complexity: 106 [2022-02-21 03:38:55,026 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 32 examples of accepted words. [2022-02-21 03:38:55,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:55,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:38:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:38:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:38:55,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:38:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:38:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:38:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 183 letters. Loop has 183 letters. [2022-02-21 03:38:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 183 letters. Loop has 183 letters. [2022-02-21 03:38:55,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 183 letters. Loop has 183 letters. [2022-02-21 03:38:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 61 letters. Loop has 61 letters. [2022-02-21 03:38:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 61 letters. [2022-02-21 03:38:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 61 letters. Loop has 61 letters. [2022-02-21 03:38:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:55,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:38:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:38:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:38:55,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 12 letters. Loop has 9 letters. [2022-02-21 03:38:55,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:38:55,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:38:55,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 13 letters. Loop has 9 letters. [2022-02-21 03:38:55,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:38:55,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:38:55,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:38:55,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:38:55,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:38:55,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:38:55,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:38:55,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:38:55,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:38:55,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:55,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:55,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 12 letters. Loop has 7 letters. [2022-02-21 03:38:55,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:55,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:55,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 13 letters. Loop has 7 letters. [2022-02-21 03:38:55,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:55,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:55,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:55,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:55,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:55,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:55,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:55,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:55,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:55,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:38:55,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:38:55,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:38:55,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:38:55,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:38:55,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:38:55,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:38:55,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:38:55,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:38:55,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:38:55,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:38:55,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:38:55,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:55,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:55,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:55,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:55,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:55,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:38:55,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:55,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:55,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:55,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:55,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:55,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:55,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:38:55,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:38:55,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 11 letters. Loop has 7 letters. [2022-02-21 03:38:55,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:38:55,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:38:55,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:38:55,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:38:55,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:38:55,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:38:55,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:38:55,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:38:55,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:38:55,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:38:55,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:38:55,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:38:55,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:38:55,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:38:55,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:38:55,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:55,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:55,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:55,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:38:55,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:38:55,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 22 letters. Loop has 11 letters. [2022-02-21 03:38:55,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:55,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:55,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:55,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 22 letters. Loop has 9 letters. [2022-02-21 03:38:55,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 9 letters. [2022-02-21 03:38:55,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 22 letters. Loop has 9 letters. [2022-02-21 03:38:55,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:38:55,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:38:55,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:38:55,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:38:55,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:38:55,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:38:55,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 9 letters. [2022-02-21 03:38:55,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 9 letters. [2022-02-21 03:38:55,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 19 letters. Loop has 9 letters. [2022-02-21 03:38:55,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:38:55,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:38:55,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:38:55,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:55,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:55,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:55,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 11 letters. [2022-02-21 03:38:55,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 11 letters. [2022-02-21 03:38:55,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 20 letters. Loop has 11 letters. [2022-02-21 03:38:55,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:38:55,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:38:55,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:38:55,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:38:55,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:38:55,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:38:55,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:38:55,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:38:55,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:38:55,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:38:55,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:38:55,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:38:55,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 21 letters. Loop has 9 letters. [2022-02-21 03:38:55,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 9 letters. [2022-02-21 03:38:55,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 21 letters. Loop has 9 letters. [2022-02-21 03:38:55,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:38:55,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:38:55,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:38:55,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:55,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:55,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:55,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:38:55,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:38:55,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:38:55,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:38:55,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:38:55,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 16 letters. Loop has 11 letters. [2022-02-21 03:38:55,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:38:55,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:38:55,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:38:55,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:38:55,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:38:55,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:38:55,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:55,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:55,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:55,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:38:55,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:38:55,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:38:55,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:38:55,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:38:55,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:38:55,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:38:55,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:38:55,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:38:55,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:38:55,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:38:55,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 17 letters. Loop has 11 letters. [2022-02-21 03:38:55,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:38:55,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:38:55,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:38:55,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 90 transitions. cyclomatic complexity: 33 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:38:55,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:38:55,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 183 states and 281 transitions. cyclomatic complexity: 106 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:38:55,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,071 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:38:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-02-21 03:38:55,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:38:55,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:38:55,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 10 letters. Loop has 12 letters. [2022-02-21 03:38:55,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 281 transitions. cyclomatic complexity: 106 [2022-02-21 03:38:55,078 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2022-02-21 03:38:55,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 163 states and 245 transitions. [2022-02-21 03:38:55,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2022-02-21 03:38:55,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2022-02-21 03:38:55,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:55,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 245 transitions. [2022-02-21 03:38:55,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:55,085 INFO L681 BuchiCegarLoop]: Abstraction has 163 states and 245 transitions. [2022-02-21 03:38:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 245 transitions. [2022-02-21 03:38:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2022-02-21 03:38:55,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:55,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states and 245 transitions. Second operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,090 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states and 245 transitions. Second operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,090 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,091 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:55,095 INFO L93 Difference]: Finished difference Result 168 states and 252 transitions. [2022-02-21 03:38:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2022-02-21 03:38:55,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:55,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:55,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 163 states and 245 transitions. [2022-02-21 03:38:55,096 INFO L87 Difference]: Start difference. First operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 163 states and 245 transitions. [2022-02-21 03:38:55,096 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:55,100 INFO L93 Difference]: Finished difference Result 174 states and 260 transitions. [2022-02-21 03:38:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2022-02-21 03:38:55,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:55,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:55,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:55,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2022-02-21 03:38:55,104 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2022-02-21 03:38:55,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:38:55,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:38:55,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:38:55,105 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:38:55,140 INFO L93 Difference]: Finished difference Result 164 states and 223 transitions. [2022-02-21 03:38:55,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:38:55,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:55,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 223 transitions. [2022-02-21 03:38:55,152 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2022-02-21 03:38:55,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 154 states and 211 transitions. [2022-02-21 03:38:55,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-02-21 03:38:55,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2022-02-21 03:38:55,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 211 transitions. [2022-02-21 03:38:55,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:55,154 INFO L681 BuchiCegarLoop]: Abstraction has 154 states and 211 transitions. [2022-02-21 03:38:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 211 transitions. [2022-02-21 03:38:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 134. [2022-02-21 03:38:55,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:55,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states and 211 transitions. Second operand has 134 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 133 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,157 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states and 211 transitions. Second operand has 134 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 133 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,158 INFO L87 Difference]: Start difference. First operand 154 states and 211 transitions. Second operand has 134 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 133 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,158 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:55,160 INFO L93 Difference]: Finished difference Result 158 states and 216 transitions. [2022-02-21 03:38:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 216 transitions. [2022-02-21 03:38:55,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:55,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:55,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 133 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 154 states and 211 transitions. [2022-02-21 03:38:55,161 INFO L87 Difference]: Start difference. First operand has 134 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 133 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 154 states and 211 transitions. [2022-02-21 03:38:55,161 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:55,163 INFO L93 Difference]: Finished difference Result 160 states and 218 transitions. [2022-02-21 03:38:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2022-02-21 03:38:55,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:55,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:55,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:55,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 133 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 191 transitions. [2022-02-21 03:38:55,165 INFO L704 BuchiCegarLoop]: Abstraction has 134 states and 191 transitions. [2022-02-21 03:38:55,165 INFO L587 BuchiCegarLoop]: Abstraction has 134 states and 191 transitions. [2022-02-21 03:38:55,165 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:38:55,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 191 transitions. [2022-02-21 03:38:55,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2022-02-21 03:38:55,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:55,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:55,166 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:55,166 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:55,166 INFO L791 eck$LassoCheckResult]: Stem: 3322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); 3323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 3348#L111 assume !false; 3423#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 3424#L36 assume 8466 == main_~s__state~0#1; 3414#L37 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 3412#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 3332#L111 [2022-02-21 03:38:55,167 INFO L793 eck$LassoCheckResult]: Loop: 3332#L111 assume !false; 3324#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 3325#L36 assume !(8466 == main_~s__state~0#1); 3349#L41 assume !(8512 == main_~s__state~0#1); 3367#L57 assume !(8640 == main_~s__state~0#1); 3328#L61 assume 8656 == main_~s__state~0#1; 3329#L62 assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; 3338#L100-1 assume 4 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 5; 3340#L104-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; 3363#L111 assume !false; 3416#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 3417#L36 assume 8466 == main_~s__state~0#1; 3382#L37 assume !(0 == main_~blastFlag~0#1); 3362#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 3332#L111 [2022-02-21 03:38:55,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723569, now seen corresponding path program 1 times [2022-02-21 03:38:55,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:55,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887014086] [2022-02-21 03:38:55,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:55,172 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:55,176 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1982564596, now seen corresponding path program 1 times [2022-02-21 03:38:55,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:55,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183612512] [2022-02-21 03:38:55,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:55,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {3920#true} assume !false; {3920#true} is VALID [2022-02-21 03:38:55,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {3920#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {3920#true} is VALID [2022-02-21 03:38:55,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {3920#true} assume !(8466 == main_~s__state~0#1); {3920#true} is VALID [2022-02-21 03:38:55,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {3920#true} assume !(8512 == main_~s__state~0#1); {3920#true} is VALID [2022-02-21 03:38:55,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {3920#true} assume !(8640 == main_~s__state~0#1); {3920#true} is VALID [2022-02-21 03:38:55,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {3920#true} assume 8656 == main_~s__state~0#1; {3920#true} is VALID [2022-02-21 03:38:55,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {3920#true} assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; {3922#(<= |ULTIMATE.start_main_~blastFlag~0#1| 3)} is VALID [2022-02-21 03:38:55,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {3922#(<= |ULTIMATE.start_main_~blastFlag~0#1| 3)} assume 4 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 5; {3921#false} is VALID [2022-02-21 03:38:55,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {3921#false} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; {3921#false} is VALID [2022-02-21 03:38:55,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {3921#false} assume !false; {3921#false} is VALID [2022-02-21 03:38:55,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {3921#false} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {3921#false} is VALID [2022-02-21 03:38:55,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {3921#false} assume 8466 == main_~s__state~0#1; {3921#false} is VALID [2022-02-21 03:38:55,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {3921#false} assume !(0 == main_~blastFlag~0#1); {3921#false} is VALID [2022-02-21 03:38:55,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {3921#false} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; {3921#false} is VALID [2022-02-21 03:38:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:55,193 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:38:55,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183612512] [2022-02-21 03:38:55,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183612512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:38:55,193 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:38:55,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:38:55,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519656030] [2022-02-21 03:38:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:38:55,194 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:38:55,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:38:55,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:38:55,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:38:55,195 INFO L87 Difference]: Start difference. First operand 134 states and 191 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:38:55,229 INFO L93 Difference]: Finished difference Result 182 states and 254 transitions. [2022-02-21 03:38:55,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:38:55,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:55,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 254 transitions. [2022-02-21 03:38:55,239 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2022-02-21 03:38:55,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 254 transitions. [2022-02-21 03:38:55,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2022-02-21 03:38:55,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2022-02-21 03:38:55,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 254 transitions. [2022-02-21 03:38:55,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:55,243 INFO L681 BuchiCegarLoop]: Abstraction has 182 states and 254 transitions. [2022-02-21 03:38:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 254 transitions. [2022-02-21 03:38:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-02-21 03:38:55,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:55,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states and 254 transitions. Second operand has 182 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 181 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,246 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states and 254 transitions. Second operand has 182 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 181 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,246 INFO L87 Difference]: Start difference. First operand 182 states and 254 transitions. Second operand has 182 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 181 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,247 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:55,249 INFO L93 Difference]: Finished difference Result 186 states and 259 transitions. [2022-02-21 03:38:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 259 transitions. [2022-02-21 03:38:55,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:55,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:55,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 181 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 182 states and 254 transitions. [2022-02-21 03:38:55,250 INFO L87 Difference]: Start difference. First operand has 182 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 181 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 182 states and 254 transitions. [2022-02-21 03:38:55,250 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:55,253 INFO L93 Difference]: Finished difference Result 186 states and 259 transitions. [2022-02-21 03:38:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 259 transitions. [2022-02-21 03:38:55,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:55,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:55,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:55,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 181 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 254 transitions. [2022-02-21 03:38:55,256 INFO L704 BuchiCegarLoop]: Abstraction has 182 states and 254 transitions. [2022-02-21 03:38:55,256 INFO L587 BuchiCegarLoop]: Abstraction has 182 states and 254 transitions. [2022-02-21 03:38:55,256 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:38:55,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 254 transitions. [2022-02-21 03:38:55,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2022-02-21 03:38:55,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:55,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:55,257 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:55,257 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:55,257 INFO L791 eck$LassoCheckResult]: Stem: 4109#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); 4110#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 4115#L111 assume !false; 4116#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 4270#L36 assume 8466 == main_~s__state~0#1; 4206#L37 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 4203#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 4180#L111 [2022-02-21 03:38:55,257 INFO L793 eck$LassoCheckResult]: Loop: 4180#L111 assume !false; 4219#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 4217#L36 assume !(8466 == main_~s__state~0#1); 4214#L41 assume !(8512 == main_~s__state~0#1); 4211#L57 assume !(8640 == main_~s__state~0#1); 4111#L61 assume 8656 == main_~s__state~0#1; 4112#L62 assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; 4124#L100-1 assume !(4 == main_~blastFlag~0#1); 4125#L107 assume !(5 == main_~blastFlag~0#1); 4158#L104-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; 4130#L111 assume !false; 4248#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 4243#L36 assume 8466 == main_~s__state~0#1; 4134#L37 assume !(0 == main_~blastFlag~0#1); 4225#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 4180#L111 [2022-02-21 03:38:55,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723569, now seen corresponding path program 2 times [2022-02-21 03:38:55,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:55,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335216245] [2022-02-21 03:38:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:55,264 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:55,268 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash 862619384, now seen corresponding path program 1 times [2022-02-21 03:38:55,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:55,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415674957] [2022-02-21 03:38:55,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:55,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {4842#true} assume !false; {4842#true} is VALID [2022-02-21 03:38:55,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {4842#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {4842#true} is VALID [2022-02-21 03:38:55,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {4842#true} assume !(8466 == main_~s__state~0#1); {4842#true} is VALID [2022-02-21 03:38:55,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {4842#true} assume !(8512 == main_~s__state~0#1); {4842#true} is VALID [2022-02-21 03:38:55,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {4842#true} assume !(8640 == main_~s__state~0#1); {4842#true} is VALID [2022-02-21 03:38:55,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {4842#true} assume 8656 == main_~s__state~0#1; {4842#true} is VALID [2022-02-21 03:38:55,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {4842#true} assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; {4842#true} is VALID [2022-02-21 03:38:55,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {4842#true} assume !(4 == main_~blastFlag~0#1); {4842#true} is VALID [2022-02-21 03:38:55,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {4842#true} assume !(5 == main_~blastFlag~0#1); {4842#true} is VALID [2022-02-21 03:38:55,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {4842#true} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; {4844#(<= 8640 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:55,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {4844#(<= 8640 |ULTIMATE.start_main_~s__state~0#1|)} assume !false; {4844#(<= 8640 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:55,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {4844#(<= 8640 |ULTIMATE.start_main_~s__state~0#1|)} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {4844#(<= 8640 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:55,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {4844#(<= 8640 |ULTIMATE.start_main_~s__state~0#1|)} assume 8466 == main_~s__state~0#1; {4843#false} is VALID [2022-02-21 03:38:55,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {4843#false} assume !(0 == main_~blastFlag~0#1); {4843#false} is VALID [2022-02-21 03:38:55,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {4843#false} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; {4843#false} is VALID [2022-02-21 03:38:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:55,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:38:55,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415674957] [2022-02-21 03:38:55,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415674957] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:38:55,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:38:55,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:38:55,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446218645] [2022-02-21 03:38:55,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:38:55,287 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:38:55,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:38:55,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:38:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:38:55,288 INFO L87 Difference]: Start difference. First operand 182 states and 254 transitions. cyclomatic complexity: 80 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:38:55,321 INFO L93 Difference]: Finished difference Result 157 states and 202 transitions. [2022-02-21 03:38:55,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:38:55,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:55,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 202 transitions. [2022-02-21 03:38:55,332 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2022-02-21 03:38:55,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 111 states and 141 transitions. [2022-02-21 03:38:55,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2022-02-21 03:38:55,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2022-02-21 03:38:55,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 141 transitions. [2022-02-21 03:38:55,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:55,334 INFO L681 BuchiCegarLoop]: Abstraction has 111 states and 141 transitions. [2022-02-21 03:38:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 141 transitions. [2022-02-21 03:38:55,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-02-21 03:38:55,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:55,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states and 141 transitions. Second operand has 105 states, 105 states have (on average 1.276190476190476) internal successors, (134), 104 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,336 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states and 141 transitions. Second operand has 105 states, 105 states have (on average 1.276190476190476) internal successors, (134), 104 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,336 INFO L87 Difference]: Start difference. First operand 111 states and 141 transitions. Second operand has 105 states, 105 states have (on average 1.276190476190476) internal successors, (134), 104 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,336 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:55,337 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2022-02-21 03:38:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2022-02-21 03:38:55,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:55,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:55,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 105 states have (on average 1.276190476190476) internal successors, (134), 104 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 111 states and 141 transitions. [2022-02-21 03:38:55,338 INFO L87 Difference]: Start difference. First operand has 105 states, 105 states have (on average 1.276190476190476) internal successors, (134), 104 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 111 states and 141 transitions. [2022-02-21 03:38:55,338 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:55,340 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2022-02-21 03:38:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2022-02-21 03:38:55,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:55,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:55,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:55,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 1.276190476190476) internal successors, (134), 104 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 134 transitions. [2022-02-21 03:38:55,341 INFO L704 BuchiCegarLoop]: Abstraction has 105 states and 134 transitions. [2022-02-21 03:38:55,342 INFO L587 BuchiCegarLoop]: Abstraction has 105 states and 134 transitions. [2022-02-21 03:38:55,342 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:38:55,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 134 transitions. [2022-02-21 03:38:55,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2022-02-21 03:38:55,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:55,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:55,343 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:55,343 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:55,343 INFO L791 eck$LassoCheckResult]: Stem: 5006#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); 5007#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 5024#L111 assume !false; 5071#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 5072#L36 assume 8466 == main_~s__state~0#1; 5062#L37 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 5056#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 5058#L111 [2022-02-21 03:38:55,343 INFO L793 eck$LassoCheckResult]: Loop: 5058#L111 assume !false; 5090#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 5084#L36 assume !(8466 == main_~s__state~0#1); 5085#L41 assume !(8512 == main_~s__state~0#1); 5042#L57 assume !(8640 == main_~s__state~0#1); 5008#L61 assume 8656 == main_~s__state~0#1; 5009#L62 assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; 5015#L100-1 assume !(4 == main_~blastFlag~0#1); 5016#L107 assume !(5 == main_~blastFlag~0#1); 5041#L104-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; 5010#L111 assume !false; 5002#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 5003#L36 assume !(8466 == main_~s__state~0#1); 5021#L41 assume !(8512 == main_~s__state~0#1); 5035#L57 assume 8640 == main_~s__state~0#1; 5066#L58 assume !(3 == main_~blastFlag~0#1); 5106#L89-1 assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8656; 5058#L111 [2022-02-21 03:38:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723569, now seen corresponding path program 3 times [2022-02-21 03:38:55,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:55,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160574426] [2022-02-21 03:38:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:55,348 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:55,352 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:55,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:55,352 INFO L85 PathProgramCache]: Analyzing trace with hash 49895967, now seen corresponding path program 1 times [2022-02-21 03:38:55,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:55,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626276248] [2022-02-21 03:38:55,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:55,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:55,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {5488#true} assume !false; {5488#true} is VALID [2022-02-21 03:38:55,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {5488#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {5488#true} is VALID [2022-02-21 03:38:55,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {5488#true} assume !(8466 == main_~s__state~0#1); {5488#true} is VALID [2022-02-21 03:38:55,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {5488#true} assume !(8512 == main_~s__state~0#1); {5488#true} is VALID [2022-02-21 03:38:55,365 INFO L290 TraceCheckUtils]: 4: Hoare triple {5488#true} assume !(8640 == main_~s__state~0#1); {5488#true} is VALID [2022-02-21 03:38:55,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {5488#true} assume 8656 == main_~s__state~0#1; {5488#true} is VALID [2022-02-21 03:38:55,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {5488#true} assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-21 03:38:55,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(4 == main_~blastFlag~0#1); {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-21 03:38:55,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(5 == main_~blastFlag~0#1); {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-21 03:38:55,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-21 03:38:55,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !false; {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-21 03:38:55,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-21 03:38:55,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8466 == main_~s__state~0#1); {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-21 03:38:55,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(8512 == main_~s__state~0#1); {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-21 03:38:55,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume 8640 == main_~s__state~0#1; {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} is VALID [2022-02-21 03:38:55,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {5490#(= (+ |ULTIMATE.start_main_~blastFlag~0#1| (- 3)) 0)} assume !(3 == main_~blastFlag~0#1); {5489#false} is VALID [2022-02-21 03:38:55,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {5489#false} assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8656; {5489#false} is VALID [2022-02-21 03:38:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:55,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:38:55,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626276248] [2022-02-21 03:38:55,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626276248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:38:55,370 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:38:55,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:38:55,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202713096] [2022-02-21 03:38:55,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:38:55,370 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:38:55,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:38:55,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:38:55,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:38:55,371 INFO L87 Difference]: Start difference. First operand 105 states and 134 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:38:55,401 INFO L93 Difference]: Finished difference Result 116 states and 146 transitions. [2022-02-21 03:38:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:38:55,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:55,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 146 transitions. [2022-02-21 03:38:55,414 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2022-02-21 03:38:55,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 146 transitions. [2022-02-21 03:38:55,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2022-02-21 03:38:55,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2022-02-21 03:38:55,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 146 transitions. [2022-02-21 03:38:55,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:55,416 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 146 transitions. [2022-02-21 03:38:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 146 transitions. [2022-02-21 03:38:55,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-02-21 03:38:55,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:55,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states and 146 transitions. Second operand has 116 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 115 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,418 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states and 146 transitions. Second operand has 116 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 115 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,418 INFO L87 Difference]: Start difference. First operand 116 states and 146 transitions. Second operand has 116 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 115 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,418 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:55,419 INFO L93 Difference]: Finished difference Result 120 states and 151 transitions. [2022-02-21 03:38:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2022-02-21 03:38:55,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:55,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:55,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 115 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states and 146 transitions. [2022-02-21 03:38:55,420 INFO L87 Difference]: Start difference. First operand has 116 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 115 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states and 146 transitions. [2022-02-21 03:38:55,420 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:55,422 INFO L93 Difference]: Finished difference Result 120 states and 151 transitions. [2022-02-21 03:38:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2022-02-21 03:38:55,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:55,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:55,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:55,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 115 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 146 transitions. [2022-02-21 03:38:55,424 INFO L704 BuchiCegarLoop]: Abstraction has 116 states and 146 transitions. [2022-02-21 03:38:55,424 INFO L587 BuchiCegarLoop]: Abstraction has 116 states and 146 transitions. [2022-02-21 03:38:55,424 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:38:55,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 146 transitions. [2022-02-21 03:38:55,424 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2022-02-21 03:38:55,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:55,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:55,425 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:55,425 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:55,425 INFO L791 eck$LassoCheckResult]: Stem: 5607#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); 5608#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 5624#L111 assume !false; 5706#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 5705#L36 assume 8466 == main_~s__state~0#1; 5664#L37 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 5659#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 5615#L111 [2022-02-21 03:38:55,425 INFO L793 eck$LassoCheckResult]: Loop: 5615#L111 assume !false; 5609#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 5610#L36 assume !(8466 == main_~s__state~0#1); 5625#L41 assume !(8512 == main_~s__state~0#1); 5635#L57 assume !(8640 == main_~s__state~0#1); 5642#L61 assume 8656 == main_~s__state~0#1; 5711#L62 assume !(2 == main_~blastFlag~0#1); 5619#L100-1 assume !(4 == main_~blastFlag~0#1); 5620#L107 assume !(5 == main_~blastFlag~0#1); 5634#L104-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; 5641#L111 assume !false; 5689#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 5686#L36 assume !(8466 == main_~s__state~0#1); 5679#L41 assume !(8512 == main_~s__state~0#1); 5676#L57 assume 8640 == main_~s__state~0#1; 5646#L58 assume !(3 == main_~blastFlag~0#1); 5643#L89-1 assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8656; 5615#L111 [2022-02-21 03:38:55,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723569, now seen corresponding path program 4 times [2022-02-21 03:38:55,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:55,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239162805] [2022-02-21 03:38:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:55,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:55,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:55,434 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:55,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash 750960545, now seen corresponding path program 1 times [2022-02-21 03:38:55,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:55,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528713667] [2022-02-21 03:38:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:55,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {6130#true} assume !false; {6130#true} is VALID [2022-02-21 03:38:55,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {6130#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {6130#true} is VALID [2022-02-21 03:38:55,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {6130#true} assume !(8466 == main_~s__state~0#1); {6130#true} is VALID [2022-02-21 03:38:55,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {6130#true} assume !(8512 == main_~s__state~0#1); {6130#true} is VALID [2022-02-21 03:38:55,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {6130#true} assume !(8640 == main_~s__state~0#1); {6130#true} is VALID [2022-02-21 03:38:55,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {6130#true} assume 8656 == main_~s__state~0#1; {6130#true} is VALID [2022-02-21 03:38:55,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {6130#true} assume !(2 == main_~blastFlag~0#1); {6130#true} is VALID [2022-02-21 03:38:55,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {6130#true} assume !(4 == main_~blastFlag~0#1); {6130#true} is VALID [2022-02-21 03:38:55,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {6130#true} assume !(5 == main_~blastFlag~0#1); {6130#true} is VALID [2022-02-21 03:38:55,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {6130#true} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-21 03:38:55,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !false; {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-21 03:38:55,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-21 03:38:55,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8466 == main_~s__state~0#1); {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-21 03:38:55,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(8512 == main_~s__state~0#1); {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-21 03:38:55,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume 8640 == main_~s__state~0#1; {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-21 03:38:55,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(3 == main_~blastFlag~0#1); {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} is VALID [2022-02-21 03:38:55,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {6132#(not (= |ULTIMATE.start_main_~s__hit~0#1| 0))} assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8656; {6131#false} is VALID [2022-02-21 03:38:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:55,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:38:55,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528713667] [2022-02-21 03:38:55,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528713667] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:38:55,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:38:55,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:38:55,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488743780] [2022-02-21 03:38:55,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:38:55,451 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:38:55,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:38:55,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:38:55,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:38:55,452 INFO L87 Difference]: Start difference. First operand 116 states and 146 transitions. cyclomatic complexity: 38 Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:38:55,476 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2022-02-21 03:38:55,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:38:55,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:55,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 175 transitions. [2022-02-21 03:38:55,488 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 41 [2022-02-21 03:38:55,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 137 states and 167 transitions. [2022-02-21 03:38:55,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2022-02-21 03:38:55,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2022-02-21 03:38:55,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 167 transitions. [2022-02-21 03:38:55,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:55,490 INFO L681 BuchiCegarLoop]: Abstraction has 137 states and 167 transitions. [2022-02-21 03:38:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 167 transitions. [2022-02-21 03:38:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 109. [2022-02-21 03:38:55,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:55,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states and 167 transitions. Second operand has 109 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 108 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,491 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states and 167 transitions. Second operand has 109 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 108 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,491 INFO L87 Difference]: Start difference. First operand 137 states and 167 transitions. Second operand has 109 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 108 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,492 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:55,493 INFO L93 Difference]: Finished difference Result 141 states and 172 transitions. [2022-02-21 03:38:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 172 transitions. [2022-02-21 03:38:55,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:55,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:55,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 108 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 137 states and 167 transitions. [2022-02-21 03:38:55,494 INFO L87 Difference]: Start difference. First operand has 109 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 108 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 137 states and 167 transitions. [2022-02-21 03:38:55,494 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:55,500 INFO L93 Difference]: Finished difference Result 141 states and 172 transitions. [2022-02-21 03:38:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 172 transitions. [2022-02-21 03:38:55,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:55,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:55,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:55,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:55,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 108 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 136 transitions. [2022-02-21 03:38:55,502 INFO L704 BuchiCegarLoop]: Abstraction has 109 states and 136 transitions. [2022-02-21 03:38:55,502 INFO L587 BuchiCegarLoop]: Abstraction has 109 states and 136 transitions. [2022-02-21 03:38:55,502 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:38:55,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 136 transitions. [2022-02-21 03:38:55,503 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 41 [2022-02-21 03:38:55,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:55,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:55,503 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:55,503 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:55,503 INFO L791 eck$LassoCheckResult]: Stem: 6279#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); 6280#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 6297#L111 assume !false; 6277#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 6278#L36 assume 8466 == main_~s__state~0#1; 6303#L37 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 6304#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 6283#L111 [2022-02-21 03:38:55,504 INFO L793 eck$LassoCheckResult]: Loop: 6283#L111 assume !false; 6275#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 6276#L36 assume !(8466 == main_~s__state~0#1); 6294#L41 assume !(8512 == main_~s__state~0#1); 6306#L57 assume !(8640 == main_~s__state~0#1); 6281#L61 assume 8656 == main_~s__state~0#1; 6282#L62 assume !(2 == main_~blastFlag~0#1); 6289#L100-1 assume !(4 == main_~blastFlag~0#1); 6290#L107 assume !(5 == main_~blastFlag~0#1); 6305#L104-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; 6283#L111 [2022-02-21 03:38:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723569, now seen corresponding path program 5 times [2022-02-21 03:38:55,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:55,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132231032] [2022-02-21 03:38:55,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:55,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:55,509 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:55,511 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:55,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1947655960, now seen corresponding path program 1 times [2022-02-21 03:38:55,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:55,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180683944] [2022-02-21 03:38:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:55,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:55,517 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:55,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash 163931656, now seen corresponding path program 1 times [2022-02-21 03:38:55,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:55,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647049551] [2022-02-21 03:38:55,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:55,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {6849#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6849#true} is VALID [2022-02-21 03:38:55,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {6849#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {6849#true} is VALID [2022-02-21 03:38:55,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {6849#true} assume !false; {6849#true} is VALID [2022-02-21 03:38:55,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {6849#true} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {6849#true} is VALID [2022-02-21 03:38:55,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {6849#true} assume 8466 == main_~s__state~0#1; {6849#true} is VALID [2022-02-21 03:38:55,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {6849#true} assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} is VALID [2022-02-21 03:38:55,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} is VALID [2022-02-21 03:38:55,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} assume !false; {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} is VALID [2022-02-21 03:38:55,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} is VALID [2022-02-21 03:38:55,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} assume !(8466 == main_~s__state~0#1); {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} is VALID [2022-02-21 03:38:55,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} assume !(8512 == main_~s__state~0#1); {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} is VALID [2022-02-21 03:38:55,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} assume !(8640 == main_~s__state~0#1); {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} is VALID [2022-02-21 03:38:55,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} assume 8656 == main_~s__state~0#1; {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} is VALID [2022-02-21 03:38:55,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {6851#(= |ULTIMATE.start_main_~blastFlag~0#1| 2)} assume !(2 == main_~blastFlag~0#1); {6850#false} is VALID [2022-02-21 03:38:55,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {6850#false} assume !(4 == main_~blastFlag~0#1); {6850#false} is VALID [2022-02-21 03:38:55,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {6850#false} assume !(5 == main_~blastFlag~0#1); {6850#false} is VALID [2022-02-21 03:38:55,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {6850#false} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; {6850#false} is VALID [2022-02-21 03:38:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:55,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:38:55,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647049551] [2022-02-21 03:38:55,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647049551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:38:55,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:38:55,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:38:55,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952904961] [2022-02-21 03:38:55,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:38:55,570 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:38:55,570 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:38:55,570 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:38:55,570 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:38:55,570 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:38:55,570 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:55,570 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:38:55,571 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:38:55,571 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration9_Loop [2022-02-21 03:38:55,571 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:38:55,571 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:38:55,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:55,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:55,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:55,647 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:38:55,647 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:38:55,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:55,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:55,648 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:55,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:38:55,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:38:55,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:55,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:55,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:55,728 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:55,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:38:55,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:38:55,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:38:55,755 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:38:55,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:38:55,773 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:38:55,773 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:38:55,773 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:38:55,773 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:38:55,773 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:38:55,773 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:55,773 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:38:55,773 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:38:55,773 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration9_Loop [2022-02-21 03:38:55,773 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:38:55,773 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:38:55,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:55,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:55,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:38:55,846 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:38:55,846 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:38:55,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:55,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:55,848 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:55,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:38:55,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:38:55,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:38:55,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:38:55,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:38:55,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:38:55,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:38:55,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:38:55,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:38:55,858 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:38:55,859 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:38:55,859 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:38:55,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:38:55,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:38:55,860 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:38:55,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:38:55,862 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:38:55,862 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:38:55,862 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:38:55,862 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0#1) = 1*ULTIMATE.start_main_~s__state~0#1 Supporting invariants [] [2022-02-21 03:38:55,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:38:55,882 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:38:55,885 INFO L390 LassoCheck]: Loop: "assume !false;" "assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2);" "assume !(8466 == main_~s__state~0#1);" "assume !(8512 == main_~s__state~0#1);" "assume !(8640 == main_~s__state~0#1);" "assume 8656 == main_~s__state~0#1;" "assume !(2 == main_~blastFlag~0#1);" "assume !(4 == main_~blastFlag~0#1);" "assume !(5 == main_~blastFlag~0#1);" "assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640;" [2022-02-21 03:38:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:55,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:55,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:38:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:55,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:38:55,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {6852#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6852#unseeded} is VALID [2022-02-21 03:38:55,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {6852#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; {6852#unseeded} is VALID [2022-02-21 03:38:55,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {6852#unseeded} assume !false; {6852#unseeded} is VALID [2022-02-21 03:38:55,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {6852#unseeded} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {6852#unseeded} is VALID [2022-02-21 03:38:55,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {6852#unseeded} assume 8466 == main_~s__state~0#1; {6852#unseeded} is VALID [2022-02-21 03:38:55,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {6852#unseeded} assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; {6852#unseeded} is VALID [2022-02-21 03:38:55,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {6852#unseeded} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; {6852#unseeded} is VALID [2022-02-21 03:38:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:55,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:38:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:38:55,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:38:55,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {6855#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} assume !false; {6855#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:55,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {6855#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); {6855#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:55,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {6855#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} assume !(8466 == main_~s__state~0#1); {6855#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:55,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {6855#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} assume !(8512 == main_~s__state~0#1); {6855#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:55,975 INFO L290 TraceCheckUtils]: 4: Hoare triple {6855#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} assume !(8640 == main_~s__state~0#1); {6855#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} is VALID [2022-02-21 03:38:55,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {6855#(>= oldRank0 |ULTIMATE.start_main_~s__state~0#1|)} assume 8656 == main_~s__state~0#1; {6903#(<= 8656 oldRank0)} is VALID [2022-02-21 03:38:55,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {6903#(<= 8656 oldRank0)} assume !(2 == main_~blastFlag~0#1); {6903#(<= 8656 oldRank0)} is VALID [2022-02-21 03:38:55,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {6903#(<= 8656 oldRank0)} assume !(4 == main_~blastFlag~0#1); {6903#(<= 8656 oldRank0)} is VALID [2022-02-21 03:38:55,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {6903#(<= 8656 oldRank0)} assume !(5 == main_~blastFlag~0#1); {6903#(<= 8656 oldRank0)} is VALID [2022-02-21 03:38:55,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {6903#(<= 8656 oldRank0)} assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; {6865#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~s__state~0#1|)) unseeded)} is VALID [2022-02-21 03:38:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:38:55,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:55,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:55,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:38:55,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:55,983 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 [2022-02-21 03:38:55,984 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 136 transitions. cyclomatic complexity: 36 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,038 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 136 transitions. cyclomatic complexity: 36. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 148 states and 178 transitions. Complement of second has 6 states. [2022-02-21 03:38:56,038 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 [2022-02-21 03:38:56,038 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:38:56,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 136 transitions. cyclomatic complexity: 36 [2022-02-21 03:38:56,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:56,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:56,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:38:56,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:56,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:56,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 178 transitions. [2022-02-21 03:38:56,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 41 [2022-02-21 03:38:56,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:56,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:56,040 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 109 states and 136 transitions. cyclomatic complexity: 36 [2022-02-21 03:38:56,042 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 41 examples of accepted words. [2022-02-21 03:38:56,042 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:38:56,043 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:38:56,043 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 148 states and 178 transitions. cyclomatic complexity: 41 [2022-02-21 03:38:56,044 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 41 examples of accepted words. [2022-02-21 03:38:56,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:38:56,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:38:56,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:38:56,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:56,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:56,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:56,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:38:56,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:38:56,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:38:56,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 148 letters. Loop has 148 letters. [2022-02-21 03:38:56,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 148 letters. [2022-02-21 03:38:56,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 148 letters. Loop has 148 letters. [2022-02-21 03:38:56,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:38:56,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:38:56,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:38:56,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:38:56,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:38:56,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:38:56,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 23 letters. Loop has 10 letters. [2022-02-21 03:38:56,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 10 letters. [2022-02-21 03:38:56,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 23 letters. Loop has 10 letters. [2022-02-21 03:38:56,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:56,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:56,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:56,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 21 letters. Loop has 10 letters. [2022-02-21 03:38:56,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 10 letters. [2022-02-21 03:38:56,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 21 letters. Loop has 10 letters. [2022-02-21 03:38:56,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:38:56,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:38:56,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:38:56,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:38:56,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:38:56,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:38:56,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 10 letters. [2022-02-21 03:38:56,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 10 letters. [2022-02-21 03:38:56,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 18 letters. Loop has 10 letters. [2022-02-21 03:38:56,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:56,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:56,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:56,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:38:56,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:38:56,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 10 letters. [2022-02-21 03:38:56,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 8 letters. Loop has 10 letters. [2022-02-21 03:38:56,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 10 letters. [2022-02-21 03:38:56,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 8 letters. Loop has 10 letters. [2022-02-21 03:38:56,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 9 letters. Loop has 10 letters. [2022-02-21 03:38:56,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 10 letters. [2022-02-21 03:38:56,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 9 letters. Loop has 10 letters. [2022-02-21 03:38:56,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:56,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:56,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:38:56,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 10 letters. [2022-02-21 03:38:56,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 10 letters. [2022-02-21 03:38:56,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 10 letters. [2022-02-21 03:38:56,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:38:56,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:38:56,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:38:56,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:38:56,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:38:56,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:38:56,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 22 letters. Loop has 9 letters. [2022-02-21 03:38:56,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 9 letters. [2022-02-21 03:38:56,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 22 letters. Loop has 9 letters. [2022-02-21 03:38:56,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:38:56,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:38:56,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:38:56,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 9 letters. [2022-02-21 03:38:56,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 9 letters. [2022-02-21 03:38:56,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 19 letters. Loop has 9 letters. [2022-02-21 03:38:56,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 9 letters. [2022-02-21 03:38:56,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 9 letters. [2022-02-21 03:38:56,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 18 letters. Loop has 9 letters. [2022-02-21 03:38:56,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 9 letters. [2022-02-21 03:38:56,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 9 letters. [2022-02-21 03:38:56,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 17 letters. Loop has 9 letters. [2022-02-21 03:38:56,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 9 letters. [2022-02-21 03:38:56,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 9 letters. [2022-02-21 03:38:56,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 9 letters. [2022-02-21 03:38:56,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:56,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:56,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:56,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:56,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:56,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:56,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 21 letters. Loop has 9 letters. [2022-02-21 03:38:56,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 9 letters. [2022-02-21 03:38:56,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 21 letters. Loop has 9 letters. [2022-02-21 03:38:56,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:56,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:56,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:56,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:38:56,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:38:56,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:38:56,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:38:56,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:38:56,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:38:56,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:38:56,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:38:56,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:38:56,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:38:56,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:38:56,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:38:56,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:38:56,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:38:56,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:38:56,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:38:56,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:38:56,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:38:56,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:38:56,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:38:56,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:38:56,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:38:56,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:38:56,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:38:56,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:38:56,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:38:56,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:38:56,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:56,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:56,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:56,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:56,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:56,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:56,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:56,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:56,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:38:56,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:56,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:56,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:56,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 21 letters. Loop has 10 letters. [2022-02-21 03:38:56,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 10 letters. [2022-02-21 03:38:56,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 21 letters. Loop has 10 letters. [2022-02-21 03:38:56,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:38:56,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:38:56,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:38:56,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:56,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:56,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:56,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 10 letters. [2022-02-21 03:38:56,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 10 letters. [2022-02-21 03:38:56,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 18 letters. Loop has 10 letters. [2022-02-21 03:38:56,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:38:56,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:38:56,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 20 letters. Loop has 10 letters. [2022-02-21 03:38:56,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 23 letters. Loop has 10 letters. [2022-02-21 03:38:56,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 10 letters. [2022-02-21 03:38:56,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 23 letters. Loop has 10 letters. [2022-02-21 03:38:56,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:56,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:56,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:56,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 10 letters. [2022-02-21 03:38:56,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 10 letters. [2022-02-21 03:38:56,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 10 letters. [2022-02-21 03:38:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 10 letters. [2022-02-21 03:38:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:38:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 10 letters. [2022-02-21 03:38:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 10 letters. [2022-02-21 03:38:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 18 letters. Loop has 10 letters. [2022-02-21 03:38:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 10 letters. [2022-02-21 03:38:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:38:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:38:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 13 letters. Loop has 10 letters. [2022-02-21 03:38:56,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 9 letters. [2022-02-21 03:38:56,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 9 letters. [2022-02-21 03:38:56,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 9 letters. [2022-02-21 03:38:56,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 21 letters. Loop has 9 letters. [2022-02-21 03:38:56,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 9 letters. [2022-02-21 03:38:56,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 21 letters. Loop has 9 letters. [2022-02-21 03:38:56,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 9 letters. [2022-02-21 03:38:56,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 9 letters. [2022-02-21 03:38:56,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 19 letters. Loop has 9 letters. [2022-02-21 03:38:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 9 letters. [2022-02-21 03:38:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 9 letters. [2022-02-21 03:38:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:56,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 22 letters. Loop has 10 letters. [2022-02-21 03:38:56,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 9 letters. [2022-02-21 03:38:56,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 9 letters. [2022-02-21 03:38:56,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 18 letters. Loop has 9 letters. [2022-02-21 03:38:56,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 22 letters. Loop has 9 letters. [2022-02-21 03:38:56,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 9 letters. [2022-02-21 03:38:56,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 22 letters. Loop has 9 letters. [2022-02-21 03:38:56,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:38:56,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:38:56,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 20 letters. Loop has 9 letters. [2022-02-21 03:38:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 9 letters. [2022-02-21 03:38:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 9 letters. [2022-02-21 03:38:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 17 letters. Loop has 9 letters. [2022-02-21 03:38:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:38:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:38:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:38:56,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 21 letters. Loop has 11 letters. [2022-02-21 03:38:56,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:38:56,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:38:56,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:38:56,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:38:56,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:38:56,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 11 letters. [2022-02-21 03:38:56,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:38:56,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:38:56,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 11 letters. [2022-02-21 03:38:56,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:38:56,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:38:56,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:38:56,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:38:56,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:38:56,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 13 letters. Loop has 11 letters. [2022-02-21 03:38:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:38:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:38:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:38:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:38:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:38:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:38:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:56,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:56,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:38:56,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 136 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:38:56,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:38:56,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 148 states and 178 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 11 letters. [2022-02-21 03:38:56,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,078 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:38:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-21 03:38:56,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 7 letters. Loop has 10 letters. [2022-02-21 03:38:56,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 17 letters. Loop has 10 letters. [2022-02-21 03:38:56,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 7 letters. Loop has 20 letters. [2022-02-21 03:38:56,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:38:56,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 178 transitions. cyclomatic complexity: 41 [2022-02-21 03:38:56,082 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 41 [2022-02-21 03:38:56,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 109 states and 132 transitions. [2022-02-21 03:38:56,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2022-02-21 03:38:56,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2022-02-21 03:38:56,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 132 transitions. [2022-02-21 03:38:56,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:56,083 INFO L681 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2022-02-21 03:38:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 132 transitions. [2022-02-21 03:38:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-02-21 03:38:56,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:56,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states and 132 transitions. Second operand has 109 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 108 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,084 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states and 132 transitions. Second operand has 109 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 108 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,084 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 109 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 108 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,085 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:56,086 INFO L93 Difference]: Finished difference Result 113 states and 137 transitions. [2022-02-21 03:38:56,086 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2022-02-21 03:38:56,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:56,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:56,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 108 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 109 states and 132 transitions. [2022-02-21 03:38:56,086 INFO L87 Difference]: Start difference. First operand has 109 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 108 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 109 states and 132 transitions. [2022-02-21 03:38:56,086 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:56,088 INFO L93 Difference]: Finished difference Result 113 states and 137 transitions. [2022-02-21 03:38:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2022-02-21 03:38:56,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:56,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:56,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:56,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 108 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2022-02-21 03:38:56,089 INFO L704 BuchiCegarLoop]: Abstraction has 109 states and 132 transitions. [2022-02-21 03:38:56,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:38:56,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:38:56,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:38:56,089 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:38:56,111 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2022-02-21 03:38:56,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:38:56,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:38:56,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 106 transitions. [2022-02-21 03:38:56,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2022-02-21 03:38:56,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 62 states and 71 transitions. [2022-02-21 03:38:56,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-02-21 03:38:56,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-02-21 03:38:56,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 71 transitions. [2022-02-21 03:38:56,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:38:56,124 INFO L681 BuchiCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-02-21 03:38:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 71 transitions. [2022-02-21 03:38:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-02-21 03:38:56,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:38:56,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states and 71 transitions. Second operand has 62 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,156 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states and 71 transitions. Second operand has 62 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,156 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 62 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,156 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:56,157 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-02-21 03:38:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-02-21 03:38:56,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:56,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:56,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 62 states and 71 transitions. [2022-02-21 03:38:56,157 INFO L87 Difference]: Start difference. First operand has 62 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 62 states and 71 transitions. [2022-02-21 03:38:56,157 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:38:56,158 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-02-21 03:38:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-02-21 03:38:56,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:38:56,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:38:56,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:38:56,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:38:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:38:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-02-21 03:38:56,159 INFO L704 BuchiCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-02-21 03:38:56,159 INFO L587 BuchiCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-02-21 03:38:56,159 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:38:56,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 71 transitions. [2022-02-21 03:38:56,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2022-02-21 03:38:56,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:38:56,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:38:56,159 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:56,159 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:38:56,160 INFO L791 eck$LassoCheckResult]: Stem: 7651#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); 7652#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 7668#L111 assume !false; 7712#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 7705#L36 assume 8466 == main_~s__state~0#1; 7674#L37 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 7675#L69-1 assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; 7682#L111 assume !false; 7708#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 7706#L36 assume !(8466 == main_~s__state~0#1); 7696#L41 assume 8512 == main_~s__state~0#1; 7672#L42 [2022-02-21 03:38:56,160 INFO L793 eck$LassoCheckResult]: Loop: 7672#L42 main_~tmp___1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 7665#L81 assume 0 != main_~tmp___1~0#1;main_~s__state~0#1 := 8466; 7659#L111 assume !false; 7653#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 7654#L36 assume 8466 == main_~s__state~0#1; 7699#L37 assume !(0 == main_~blastFlag~0#1); 7704#L69-1 assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; 7703#L111 assume !false; 7701#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 7698#L36 assume !(8466 == main_~s__state~0#1); 7697#L41 assume 8512 == main_~s__state~0#1; 7672#L42 [2022-02-21 03:38:56,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash 21626939, now seen corresponding path program 1 times [2022-02-21 03:38:56,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:56,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134221469] [2022-02-21 03:38:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:56,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:56,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:56,169 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:56,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1294878776, now seen corresponding path program 1 times [2022-02-21 03:38:56,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:56,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364502272] [2022-02-21 03:38:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:56,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:56,173 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:56,174 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:56,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:38:56,175 INFO L85 PathProgramCache]: Analyzing trace with hash 937672638, now seen corresponding path program 1 times [2022-02-21 03:38:56,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:38:56,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939795631] [2022-02-21 03:38:56,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:38:56,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:38:56,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:38:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:56,181 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:38:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:38:56,185 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:38:56,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:38:56 BoogieIcfgContainer [2022-02-21 03:38:56,355 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:38:56,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:38:56,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:38:56,356 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:38:56,356 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:38:51" (3/4) ... [2022-02-21 03:38:56,358 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 03:38:56,378 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:38:56,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:38:56,379 INFO L158 Benchmark]: Toolchain (without parser) took 5521.00ms. Allocated memory was 109.1MB in the beginning and 153.1MB in the end (delta: 44.0MB). Free memory was 68.9MB in the beginning and 100.2MB in the end (delta: -31.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:38:56,379 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:38:56,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.73ms. Allocated memory is still 109.1MB. Free memory was 68.7MB in the beginning and 82.8MB in the end (delta: -14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:38:56,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.67ms. Allocated memory is still 109.1MB. Free memory was 82.8MB in the beginning and 81.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:38:56,380 INFO L158 Benchmark]: Boogie Preprocessor took 35.18ms. Allocated memory is still 109.1MB. Free memory was 81.3MB in the beginning and 80.4MB in the end (delta: 990.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:38:56,380 INFO L158 Benchmark]: RCFGBuilder took 233.11ms. Allocated memory is still 109.1MB. Free memory was 80.4MB in the beginning and 69.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:38:56,380 INFO L158 Benchmark]: BuchiAutomizer took 4948.42ms. Allocated memory was 109.1MB in the beginning and 153.1MB in the end (delta: 44.0MB). Free memory was 69.9MB in the beginning and 101.2MB in the end (delta: -31.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:38:56,380 INFO L158 Benchmark]: Witness Printer took 22.82ms. Allocated memory is still 153.1MB. Free memory was 101.2MB in the beginning and 100.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:38:56,381 INFO L339 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.19ms. Allocated memory is still 109.1MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.73ms. Allocated memory is still 109.1MB. Free memory was 68.7MB in the beginning and 82.8MB in the end (delta: -14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.67ms. Allocated memory is still 109.1MB. Free memory was 82.8MB in the beginning and 81.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.18ms. Allocated memory is still 109.1MB. Free memory was 81.3MB in the beginning and 80.4MB in the end (delta: 990.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 233.11ms. Allocated memory is still 109.1MB. Free memory was 80.4MB in the beginning and 69.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4948.42ms. Allocated memory was 109.1MB in the beginning and 153.1MB in the end (delta: 44.0MB). Free memory was 69.9MB in the beginning and 101.2MB in the end (delta: -31.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 22.82ms. Allocated memory is still 153.1MB. Free memory was 101.2MB in the beginning and 100.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (8 trivial, 5 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * blastFlag + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * s__state + 8489 and consists of 4 locations. One deterministic module has affine ranking function s__state and consists of 5 locations. One deterministic module has affine ranking function 8576 + -1 * s__state and consists of 5 locations. One deterministic module has affine ranking function s__state and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 62 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 13. Automata minimization 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 155 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 182 states and ocurred in iteration 5. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 548 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 269 IncrementalHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 352 mSDtfsCounter, 269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT1 conc0 concLT4 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp52 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq186 hnf91 smp100 dnf180 smp78 tf112 neg93 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 58ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 41]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@404e57cb=4, NULL=0, NULL=0, s__hit=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22148a0e=0, s__state=8512, tmp___1=4, NULL=1, \result=0, blastFlag=2} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 41]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L21] int s__state ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int blastFlag ; [L24] int tmp___1; [L26] s__state = 8466 [L27] blastFlag = 0 [L29] COND TRUE 1 [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L36] COND TRUE s__state == 8466 [L69] COND TRUE blastFlag == 0 [L70] blastFlag = 2 [L72] COND FALSE !(\read(s__hit)) [L75] s__state = 8512 [L29] COND TRUE 1 [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L36] COND FALSE !(s__state == 8466) [L41] COND TRUE s__state == 8512 Loop: [L80] tmp___1 = __VERIFIER_nondet_int() [L81] COND TRUE \read(tmp___1) [L82] s__state = 8466 [L29] COND TRUE 1 [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L36] COND TRUE s__state == 8466 [L69] COND FALSE !(blastFlag == 0) [L72] COND FALSE !(\read(s__hit)) [L75] s__state = 8512 [L29] COND TRUE 1 [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L36] COND FALSE !(s__state == 8466) [L41] COND TRUE s__state == 8512 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:38:56,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)