./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/NestedRecursion_1b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9948dbd77aeb2de72e0bd3a3a4e22b1606b19383e4631af58adbec46ed909b6c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:23:42,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:23:42,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:23:42,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:23:42,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:23:42,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:23:42,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:23:42,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:23:42,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:23:42,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:23:42,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:23:42,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:23:42,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:23:42,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:23:42,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:23:42,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:23:42,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:23:42,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:23:42,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:23:42,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:23:42,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:23:42,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:23:42,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:23:42,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:23:42,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:23:42,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:23:42,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:23:42,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:23:42,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:23:42,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:23:42,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:23:42,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:23:42,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:23:42,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:23:42,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:23:42,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:23:42,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:23:42,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:23:42,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:23:42,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:23:42,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:23:42,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:23:42,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:23:42,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:23:42,194 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:23:42,194 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:23:42,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:23:42,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:23:42,196 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:23:42,196 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:23:42,196 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:23:42,196 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:23:42,197 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:23:42,197 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:23:42,197 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:23:42,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:23:42,197 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:23:42,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:23:42,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:23:42,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:23:42,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:23:42,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:23:42,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:23:42,198 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:23:42,198 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:23:42,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:23:42,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:23:42,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:23:42,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:23:42,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:23:42,201 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:23:42,201 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9948dbd77aeb2de72e0bd3a3a4e22b1606b19383e4631af58adbec46ed909b6c [2022-02-21 03:23:42,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:23:42,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:23:42,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:23:42,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:23:42,451 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:23:42,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2022-02-21 03:23:42,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ec7daab/2c6e7d0daec54b62a5154119ec6204ae/FLAG7cfe41a98 [2022-02-21 03:23:42,933 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:23:42,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2022-02-21 03:23:42,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ec7daab/2c6e7d0daec54b62a5154119ec6204ae/FLAG7cfe41a98 [2022-02-21 03:23:42,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ec7daab/2c6e7d0daec54b62a5154119ec6204ae [2022-02-21 03:23:42,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:23:42,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:23:42,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:42,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:23:42,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:23:42,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:42" (1/1) ... [2022-02-21 03:23:42,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6f60e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:42, skipping insertion in model container [2022-02-21 03:23:42,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:42" (1/1) ... [2022-02-21 03:23:42,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:23:42,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:23:43,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:43,143 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:23:43,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:43,162 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:23:43,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43 WrapperNode [2022-02-21 03:23:43,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:43,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:43,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:23:43,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:23:43,170 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:23:43" (1/1) ... [2022-02-21 03:23:43,174 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:23:43" (1/1) ... [2022-02-21 03:23:43,185 INFO L137 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6 [2022-02-21 03:23:43,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:43,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:23:43,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:23:43,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:23:43,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:23:43,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:23:43,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:23:43,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:23:43,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (1/1) ... [2022-02-21 03:23:43,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:43,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:43,236 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:23:43,254 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:23:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2022-02-21 03:23:43,283 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2022-02-21 03:23:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2022-02-21 03:23:43,284 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2022-02-21 03:23:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:23:43,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:23:43,320 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:23:43,321 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:23:43,419 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:23:43,425 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:23:43,426 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:23:43,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:43 BoogieIcfgContainer [2022-02-21 03:23:43,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:23:43,428 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:23:43,428 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:23:43,430 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:23:43,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:43,431 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:23:42" (1/3) ... [2022-02-21 03:23:43,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b3fe1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:43, skipping insertion in model container [2022-02-21 03:23:43,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:43,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:43" (2/3) ... [2022-02-21 03:23:43,432 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b3fe1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:43, skipping insertion in model container [2022-02-21 03:23:43,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:43,432 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:43" (3/3) ... [2022-02-21 03:23:43,433 INFO L388 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1b.c [2022-02-21 03:23:43,498 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:23:43,503 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:23:43,503 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:23:43,503 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:23:43,503 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:23:43,503 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:23:43,503 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:23:43,503 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:23:43,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:23:43,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:43,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:43,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:43,551 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:23:43,551 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:43,551 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:23:43,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:23:43,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:43,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:43,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:43,562 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:23:43,563 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:43,567 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 14#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 10#L25true call main_#t~ret6#1 := rec2(main_~x~0#1);< 17#rec2ENTRYtrue [2022-02-21 03:23:43,567 INFO L793 eck$LassoCheckResult]: Loop: 17#rec2ENTRYtrue ~j := #in~j; 18#L18true assume !(~j <= 0); 21#L20true call #t~ret3 := rec1(~j - 1);< 23#rec1ENTRYtrue ~i := #in~i; 19#L12true assume ~i <= 0;#res := 0; 15#rec1FINALtrue assume true; 16#rec1EXITtrue >#34#return; 4#L20-1true call #t~ret4 := rec2(#t~ret3);< 17#rec2ENTRYtrue [2022-02-21 03:23:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash 48738, now seen corresponding path program 1 times [2022-02-21 03:23:43,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:43,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418234115] [2022-02-21 03:23:43,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:43,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:43,633 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:43,653 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:43,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1074209557, now seen corresponding path program 1 times [2022-02-21 03:23:43,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:43,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340597128] [2022-02-21 03:23:43,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:43,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:43,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:43,694 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:43,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:43,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1203131828, now seen corresponding path program 1 times [2022-02-21 03:23:43,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:43,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326961983] [2022-02-21 03:23:43,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:43,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:43,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:43,721 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:43,944 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:43,944 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:43,961 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:43,961 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:43,962 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:43,962 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:43,962 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:43,962 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:43,962 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration1_Loop [2022-02-21 03:23:43,962 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:43,962 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:43,971 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:23:43,976 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:23:43,978 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:23:43,980 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:23:43,997 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:23:44,047 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:44,048 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:44,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,051 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:23:44,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:44,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:44,087 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:23:44,098 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:44,098 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_~j=0} Honda state: {rec2_~j=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:44,128 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:23:44,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,144 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:23:44,145 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:23:44,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:44,146 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:44,167 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:44,168 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:44,183 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:23:44,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,185 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:23:44,186 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:23:44,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:44,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:44,203 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:44,203 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:44,219 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:23:44,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,227 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:23:44,228 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:23:44,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:44,229 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:44,250 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:44,250 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:44,267 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:23:44,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,270 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:23:44,271 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:23:44,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:44,272 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:44,300 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:23:44,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,302 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:23:44,305 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:23:44,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:44,308 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:44,331 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:44,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:23:44,347 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:44,347 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:44,348 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:44,348 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:44,348 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:44,348 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,348 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:44,348 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:44,348 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration1_Loop [2022-02-21 03:23:44,348 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:44,348 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:44,349 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:23:44,352 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:23:44,355 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:23:44,358 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:23:44,364 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:23:44,413 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:44,416 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:44,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,426 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:23:44,432 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:23:44,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:44,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:44,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:44,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:44,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:44,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:44,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:44,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:44,457 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:23:44,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:44,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,471 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:23:44,506 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:23:44,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:44,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:44,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:44,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:44,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:44,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:44,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:44,517 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:23:44,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:44,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:23:44,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,536 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:23:44,537 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:23:44,538 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:23:44,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:44,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:44,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:44,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:44,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:44,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:44,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:44,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:44,572 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:23:44,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,577 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:23:44,578 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:23:44,579 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:23:44,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:44,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:44,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:44,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:44,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:44,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:44,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:44,595 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:44,598 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:23:44,598 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:23:44,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:44,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:44,601 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:23:44,602 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:23:44,603 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:44,603 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:44,603 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:44,604 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2022-02-21 03:23:44,633 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:23:44,639 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:44,645 INFO L390 LassoCheck]: Loop: "~j := #in~j;" "assume !(~j <= 0);" "call #t~ret3 := rec1(~j - 1);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#34#return;" "call #t~ret4 := rec2(#t~ret3);"< [2022-02-21 03:23:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:44,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:23:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:44,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:44,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#unseeded} assume { :begin_inline_ULTIMATE.init } true; {32#unseeded} is VALID [2022-02-21 03:23:44,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {32#unseeded} is VALID [2022-02-21 03:23:44,702 INFO L272 TraceCheckUtils]: 2: Hoare triple {32#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {32#unseeded} is VALID [2022-02-21 03:23:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:44,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:23:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:44,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:44,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(>= oldRank0 |rec2_#in~j|)} ~j := #in~j; {56#(<= rec2_~j oldRank0)} is VALID [2022-02-21 03:23:44,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(<= rec2_~j oldRank0)} assume !(~j <= 0); {60#(< 0 oldRank0)} is VALID [2022-02-21 03:23:44,841 INFO L272 TraceCheckUtils]: 2: Hoare triple {60#(< 0 oldRank0)} call #t~ret3 := rec1(~j - 1); {64#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:44,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {64#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {64#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:44,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {64#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {71#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:44,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {71#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {71#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:44,843 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {71#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} {60#(< 0 oldRank0)} #34#return; {78#(and (<= |rec2_#t~ret3| 0) (< 0 oldRank0))} is VALID [2022-02-21 03:23:44,844 INFO L272 TraceCheckUtils]: 7: Hoare triple {78#(and (<= |rec2_#t~ret3| 0) (< 0 oldRank0))} call #t~ret4 := rec2(#t~ret3); {45#(or (and (>= oldRank0 0) (> oldRank0 |rec2_#in~j|)) unseeded)} is VALID [2022-02-21 03:23:44,844 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:23:44,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:44,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:44,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 3 letters. Loop has 8 letters. [2022-02-21 03:23:44,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:44,893 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2022-02-21 03:23:44,894 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:45,296 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:23:45,497 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6). Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 195 states and 280 transitions. Complement of second has 61 states. [2022-02-21 03:23:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:45,498 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:45,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:23:45,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:45,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:45,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:45,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:45,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:23:45,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:45,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:45,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 280 transitions. [2022-02-21 03:23:45,516 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:45,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:45,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:45,518 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:23:45,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:45,525 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:23:45,525 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:45,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:23:45,529 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:45,530 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 195 states and 280 transitions. cyclomatic complexity: 89 [2022-02-21 03:23:45,541 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:23:45,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 3 letters. Loop has 8 letters. [2022-02-21 03:23:45,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 3 letters. Loop has 8 letters. [2022-02-21 03:23:45,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 3 letters. Loop has 8 letters. [2022-02-21 03:23:45,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:23:45,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:23:45,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:23:45,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:45,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:45,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:45,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 195 letters. Loop has 195 letters. [2022-02-21 03:23:45,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 195 letters. Loop has 195 letters. [2022-02-21 03:23:45,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 195 letters. Loop has 195 letters. [2022-02-21 03:23:45,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:23:45,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:23:45,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:23:45,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:23:45,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:23:45,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:23:45,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:23:45,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:23:45,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:23:45,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 18 letters. Loop has 13 letters. [2022-02-21 03:23:45,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 13 letters. [2022-02-21 03:23:45,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 18 letters. Loop has 13 letters. [2022-02-21 03:23:45,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:23:45,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:23:45,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:23:45,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:23:45,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:23:45,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:23:45,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:45,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:45,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:45,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:23:45,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:23:45,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:23:45,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 18 letters. Loop has 13 letters. [2022-02-21 03:23:45,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 18 letters. Loop has 13 letters. [2022-02-21 03:23:45,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 18 letters. Loop has 13 letters. [2022-02-21 03:23:45,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 3 letters. Loop has 8 letters. [2022-02-21 03:23:45,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 3 letters. Loop has 8 letters. [2022-02-21 03:23:45,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 3 letters. Loop has 8 letters. [2022-02-21 03:23:45,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:23:45,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:23:45,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:23:45,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 4 letters. Loop has 8 letters. [2022-02-21 03:23:45,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 4 letters. Loop has 8 letters. [2022-02-21 03:23:45,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 4 letters. Loop has 8 letters. [2022-02-21 03:23:45,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:23:45,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:23:45,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:23:45,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:23:45,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:23:45,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:23:45,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:23:45,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:23:45,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:23:45,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:45,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:45,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:45,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:45,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:45,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:45,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:45,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:45,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:45,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:45,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:45,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:45,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:23:45,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:23:45,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:23:45,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:45,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:45,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:45,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:45,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:45,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:45,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:45,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:45,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:45,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:45,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:45,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:45,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 53 letters. Loop has 24 letters. [2022-02-21 03:23:45,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 53 letters. Loop has 24 letters. [2022-02-21 03:23:45,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 53 letters. Loop has 24 letters. [2022-02-21 03:23:45,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 74 letters. Loop has 24 letters. [2022-02-21 03:23:45,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 74 letters. Loop has 24 letters. [2022-02-21 03:23:45,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 74 letters. Loop has 24 letters. [2022-02-21 03:23:45,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 51 letters. Loop has 24 letters. [2022-02-21 03:23:45,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 51 letters. Loop has 24 letters. [2022-02-21 03:23:45,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 51 letters. Loop has 24 letters. [2022-02-21 03:23:45,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 52 letters. Loop has 24 letters. [2022-02-21 03:23:45,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 52 letters. Loop has 24 letters. [2022-02-21 03:23:45,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 52 letters. Loop has 24 letters. [2022-02-21 03:23:45,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Stem has 74 letters. Loop has 24 letters. [2022-02-21 03:23:45,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 74 letters. Loop has 24 letters. [2022-02-21 03:23:45,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 280 transitions. cyclomatic complexity: 89 Stem has 74 letters. Loop has 24 letters. [2022-02-21 03:23:45,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,586 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-02-21 03:23:45,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 58 transitions. Stem has 3 letters. Loop has 8 letters. [2022-02-21 03:23:45,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 58 transitions. Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:45,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 58 transitions. Stem has 3 letters. Loop has 16 letters. [2022-02-21 03:23:45,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:45,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 280 transitions. cyclomatic complexity: 89 [2022-02-21 03:23:45,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:45,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 83 states and 121 transitions. [2022-02-21 03:23:45,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-02-21 03:23:45,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-02-21 03:23:45,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 121 transitions. [2022-02-21 03:23:45,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:45,627 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 121 transitions. [2022-02-21 03:23:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 121 transitions. [2022-02-21 03:23:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2022-02-21 03:23:45,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:45,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states and 121 transitions. Second operand has 56 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (30), 15 states have call predecessors, (30), 16 states have call successors, (30) [2022-02-21 03:23:45,658 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states and 121 transitions. Second operand has 56 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (30), 15 states have call predecessors, (30), 16 states have call successors, (30) [2022-02-21 03:23:45,662 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 56 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (30), 15 states have call predecessors, (30), 16 states have call successors, (30) [2022-02-21 03:23:45,666 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:45,684 INFO L93 Difference]: Finished difference Result 203 states and 301 transitions. [2022-02-21 03:23:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 301 transitions. [2022-02-21 03:23:45,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:45,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:45,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (30), 15 states have call predecessors, (30), 16 states have call successors, (30) Second operand 83 states and 121 transitions. [2022-02-21 03:23:45,691 INFO L87 Difference]: Start difference. First operand has 56 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (30), 15 states have call predecessors, (30), 16 states have call successors, (30) Second operand 83 states and 121 transitions. [2022-02-21 03:23:45,691 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:45,711 INFO L93 Difference]: Finished difference Result 310 states and 459 transitions. [2022-02-21 03:23:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 459 transitions. [2022-02-21 03:23:45,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:45,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:45,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:45,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (30), 15 states have call predecessors, (30), 16 states have call successors, (30) [2022-02-21 03:23:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2022-02-21 03:23:45,720 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 84 transitions. [2022-02-21 03:23:45,720 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 84 transitions. [2022-02-21 03:23:45,720 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:23:45,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 84 transitions. [2022-02-21 03:23:45,721 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:45,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:45,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:45,722 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:45,722 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:45,722 INFO L791 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 362#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 356#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 369#rec2ENTRY ~j := #in~j; 389#L18 assume !(~j <= 0); 364#L20 call #t~ret3 := rec1(~j - 1);< 393#rec1ENTRY ~i := #in~i; 391#L12 assume !(~i <= 0); 376#L14 call #t~ret0 := rec1(~i - 2);< 377#rec1ENTRY [2022-02-21 03:23:45,722 INFO L793 eck$LassoCheckResult]: Loop: 377#rec1ENTRY ~i := #in~i; 403#L12 assume !(~i <= 0); 373#L14 call #t~ret0 := rec1(~i - 2);< 377#rec1ENTRY [2022-02-21 03:23:45,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:45,723 INFO L85 PathProgramCache]: Analyzing trace with hash 838970620, now seen corresponding path program 1 times [2022-02-21 03:23:45,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:45,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532006417] [2022-02-21 03:23:45,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:45,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,734 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:45,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:45,734 INFO L85 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 1 times [2022-02-21 03:23:45,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:45,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156268948] [2022-02-21 03:23:45,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:45,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,737 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,739 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1359045147, now seen corresponding path program 2 times [2022-02-21 03:23:45,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:45,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877750821] [2022-02-21 03:23:45,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:45,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,745 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:45,750 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:45,788 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:45,788 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:45,788 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:45,788 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:45,788 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:45,788 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,789 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:45,789 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:45,789 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration2_Loop [2022-02-21 03:23:45,789 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:45,789 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:45,789 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:23:45,791 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:23:45,793 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:23:45,794 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:23:45,796 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:23:45,798 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:23:45,836 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:45,836 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:45,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:45,837 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:23:45,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:45,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:45,852 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:23:45,853 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:45,853 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:45,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 03:23:45,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:45,872 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:23:45,873 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:23:45,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:45,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:45,895 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:45,895 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:45,911 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:23:45,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:45,912 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:23:45,913 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:23:45,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:45,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:45,923 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:45,923 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:45,940 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:23:45,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:45,942 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:23:45,943 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:23:45,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:45,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:45,965 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:45,965 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:45,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:23:45,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:45,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:45,982 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:23:45,983 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:23:45,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:45,985 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,003 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:46,003 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:46,018 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:23:46,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,020 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:23:46,022 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:23:46,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:46,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,059 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:23:46,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,061 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:23:46,062 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:23:46,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:46,064 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,091 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:46,109 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:23:46,110 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:46,110 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:46,110 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:46,110 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:46,110 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:46,110 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,110 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:46,110 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:46,110 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration2_Loop [2022-02-21 03:23:46,110 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:46,110 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:46,111 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:23:46,113 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:23:46,115 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:23:46,117 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:23:46,119 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:23:46,123 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:23:46,177 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:46,177 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:46,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,179 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:23:46,184 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:23:46,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:46,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:46,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:46,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:46,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:46,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:46,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:46,194 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:23:46,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:46,221 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:23:46,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,222 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:23:46,223 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:23:46,224 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:23:46,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:46,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:46,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:46,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:46,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:46,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:46,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:46,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:46,259 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:23:46,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,261 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:23:46,262 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:23:46,263 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:23:46,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:46,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:46,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:46,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:46,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:46,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:46,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:46,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:46,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:23:46,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,288 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:23:46,290 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:23:46,290 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:23:46,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:46,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:46,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:46,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:46,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:46,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:46,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:46,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:46,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:23:46,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,314 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:23:46,315 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:23:46,317 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:23:46,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:46,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:46,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:46,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:46,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:46,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:46,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:46,331 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:46,333 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:23:46,333 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:23:46,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,335 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:23:46,336 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:23:46,337 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:46,337 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:46,337 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:46,337 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2022-02-21 03:23:46,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:23:46,368 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:46,372 INFO L390 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2022-02-21 03:23:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:23:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:46,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {1211#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1211#unseeded} is VALID [2022-02-21 03:23:46,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1211#unseeded} is VALID [2022-02-21 03:23:46,438 INFO L272 TraceCheckUtils]: 2: Hoare triple {1211#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {1211#unseeded} is VALID [2022-02-21 03:23:46,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {1211#unseeded} ~j := #in~j; {1211#unseeded} is VALID [2022-02-21 03:23:46,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {1211#unseeded} assume !(~j <= 0); {1211#unseeded} is VALID [2022-02-21 03:23:46,439 INFO L272 TraceCheckUtils]: 5: Hoare triple {1211#unseeded} call #t~ret3 := rec1(~j - 1); {1211#unseeded} is VALID [2022-02-21 03:23:46,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {1211#unseeded} ~i := #in~i; {1211#unseeded} is VALID [2022-02-21 03:23:46,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#unseeded} assume !(~i <= 0); {1211#unseeded} is VALID [2022-02-21 03:23:46,440 INFO L272 TraceCheckUtils]: 8: Hoare triple {1211#unseeded} call #t~ret0 := rec1(~i - 2); {1211#unseeded} is VALID [2022-02-21 03:23:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:46,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {1214#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {1253#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:46,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {1253#(<= rec1_~i oldRank0)} assume !(~i <= 0); {1257#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:46,491 INFO L272 TraceCheckUtils]: 2: Hoare triple {1257#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {1224#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:46,491 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:23:46,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:46,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:46,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:46,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,498 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:23:46,499 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 84 transitions. cyclomatic complexity: 32 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:46,562 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 84 transitions. cyclomatic complexity: 32. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 106 states and 150 transitions. Complement of second has 13 states. [2022-02-21 03:23:46,562 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:23:46,562 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:46,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 84 transitions. cyclomatic complexity: 32 [2022-02-21 03:23:46,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:46,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:46,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:46,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:46,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:46,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:46,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 150 transitions. [2022-02-21 03:23:46,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:46,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:46,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:46,566 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 56 states and 84 transitions. cyclomatic complexity: 32 [2022-02-21 03:23:46,572 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:23:46,572 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:46,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:46,573 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:46,573 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 106 states and 150 transitions. cyclomatic complexity: 51 [2022-02-21 03:23:46,581 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:23:46,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:46,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:46,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:46,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:46,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 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:23:46,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:46,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:46,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:46,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:46,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 106 letters. Loop has 106 letters. [2022-02-21 03:23:46,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 106 letters. Loop has 106 letters. [2022-02-21 03:23:46,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 106 letters. Loop has 106 letters. [2022-02-21 03:23:46,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:23:46,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:23:46,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:23:46,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:46,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 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:23:46,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:23:46,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:46,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:46,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:46,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:23:46,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:23:46,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:23:46,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:46,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:46,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:23:46,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:46,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:46,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:46,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:46,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:46,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:46,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:46,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:46,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:46,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:46,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:46,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:46,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:46,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:46,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:46,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:46,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:46,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:46,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:46,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:46,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:46,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:46,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:46,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:46,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:46,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:46,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:46,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:46,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:46,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:46,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:46,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:46,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:46,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:46,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 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:23:46,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:46,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:46,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:46,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:46,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:23:46,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:23:46,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:23:46,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:46,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:46,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:46,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:23:46,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:23:46,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:23:46,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:46,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:46,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:46,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:46,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:46,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:46,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:46,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:46,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:46,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:46,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:46,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:46,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:46,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:46,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:46,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:46,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:46,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:46,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:46,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:46,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:46,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:46,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:46,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:46,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:46,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:46,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:46,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 84 transitions. cyclomatic complexity: 32 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:46,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:46,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 150 transitions. cyclomatic complexity: 51 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:46,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,612 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:23:46,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:23:46,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:46,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:23:46,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:46,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 150 transitions. cyclomatic complexity: 51 [2022-02-21 03:23:46,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:46,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 94 states and 138 transitions. [2022-02-21 03:23:46,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-02-21 03:23:46,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-02-21 03:23:46,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 138 transitions. [2022-02-21 03:23:46,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:46,624 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 138 transitions. [2022-02-21 03:23:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 138 transitions. [2022-02-21 03:23:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-02-21 03:23:46,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:46,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states and 138 transitions. Second operand has 90 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 15 states have call predecessors, (27), 12 states have return successors, (41), 16 states have call predecessors, (41), 22 states have call successors, (41) [2022-02-21 03:23:46,631 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states and 138 transitions. Second operand has 90 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 15 states have call predecessors, (27), 12 states have return successors, (41), 16 states have call predecessors, (41), 22 states have call successors, (41) [2022-02-21 03:23:46,631 INFO L87 Difference]: Start difference. First operand 94 states and 138 transitions. Second operand has 90 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 15 states have call predecessors, (27), 12 states have return successors, (41), 16 states have call predecessors, (41), 22 states have call successors, (41) [2022-02-21 03:23:46,631 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:46,652 INFO L93 Difference]: Finished difference Result 256 states and 381 transitions. [2022-02-21 03:23:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2022-02-21 03:23:46,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:46,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:46,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 15 states have call predecessors, (27), 12 states have return successors, (41), 16 states have call predecessors, (41), 22 states have call successors, (41) Second operand 94 states and 138 transitions. [2022-02-21 03:23:46,656 INFO L87 Difference]: Start difference. First operand has 90 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 15 states have call predecessors, (27), 12 states have return successors, (41), 16 states have call predecessors, (41), 22 states have call successors, (41) Second operand 94 states and 138 transitions. [2022-02-21 03:23:46,657 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:46,672 INFO L93 Difference]: Finished difference Result 278 states and 413 transitions. [2022-02-21 03:23:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 413 transitions. [2022-02-21 03:23:46,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:46,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:46,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:46,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 15 states have call predecessors, (27), 12 states have return successors, (41), 16 states have call predecessors, (41), 22 states have call successors, (41) [2022-02-21 03:23:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2022-02-21 03:23:46,678 INFO L704 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2022-02-21 03:23:46,678 INFO L587 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2022-02-21 03:23:46,679 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:23:46,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 130 transitions. [2022-02-21 03:23:46,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:46,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:46,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:46,680 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:46,680 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:46,681 INFO L791 eck$LassoCheckResult]: Stem: 1391#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1392#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1388#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 1408#rec2ENTRY ~j := #in~j; 1423#L18 assume !(~j <= 0); 1394#L20 call #t~ret3 := rec1(~j - 1);< 1434#rec1ENTRY ~i := #in~i; 1435#L12 assume !(~i <= 0); 1414#L14 call #t~ret0 := rec1(~i - 2);< 1431#rec1ENTRY ~i := #in~i; 1429#L12 assume ~i <= 0;#res := 0; 1413#rec1FINAL assume true; 1415#rec1EXIT >#28#return; 1412#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1410#rec1ENTRY [2022-02-21 03:23:46,681 INFO L793 eck$LassoCheckResult]: Loop: 1410#rec1ENTRY ~i := #in~i; 1453#L12 assume !(~i <= 0); 1445#L14 call #t~ret0 := rec1(~i - 2);< 1410#rec1ENTRY [2022-02-21 03:23:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 372282091, now seen corresponding path program 1 times [2022-02-21 03:23:46,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:46,682 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537085966] [2022-02-21 03:23:46,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,688 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,693 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:46,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:46,694 INFO L85 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 2 times [2022-02-21 03:23:46,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:46,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256644294] [2022-02-21 03:23:46,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,699 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:46,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:46,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1050214860, now seen corresponding path program 2 times [2022-02-21 03:23:46,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:46,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46843367] [2022-02-21 03:23:46,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:23:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:46,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {2304#true} ~i := #in~i; {2304#true} is VALID [2022-02-21 03:23:46,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {2304#true} assume ~i <= 0;#res := 0; {2313#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:46,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {2313#(<= |rec1_#res| 0)} assume true; {2313#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:46,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2313#(<= |rec1_#res| 0)} {2304#true} #28#return; {2310#(<= |rec1_#t~ret0| 0)} is VALID [2022-02-21 03:23:46,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {2304#true} assume { :begin_inline_ULTIMATE.init } true; {2304#true} is VALID [2022-02-21 03:23:46,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {2304#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2304#true} is VALID [2022-02-21 03:23:46,775 INFO L272 TraceCheckUtils]: 2: Hoare triple {2304#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {2304#true} is VALID [2022-02-21 03:23:46,775 INFO L290 TraceCheckUtils]: 3: Hoare triple {2304#true} ~j := #in~j; {2304#true} is VALID [2022-02-21 03:23:46,775 INFO L290 TraceCheckUtils]: 4: Hoare triple {2304#true} assume !(~j <= 0); {2304#true} is VALID [2022-02-21 03:23:46,775 INFO L272 TraceCheckUtils]: 5: Hoare triple {2304#true} call #t~ret3 := rec1(~j - 1); {2304#true} is VALID [2022-02-21 03:23:46,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {2304#true} ~i := #in~i; {2304#true} is VALID [2022-02-21 03:23:46,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {2304#true} assume !(~i <= 0); {2304#true} is VALID [2022-02-21 03:23:46,776 INFO L272 TraceCheckUtils]: 8: Hoare triple {2304#true} call #t~ret0 := rec1(~i - 2); {2304#true} is VALID [2022-02-21 03:23:46,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {2304#true} ~i := #in~i; {2304#true} is VALID [2022-02-21 03:23:46,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {2304#true} assume ~i <= 0;#res := 0; {2313#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:46,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {2313#(<= |rec1_#res| 0)} assume true; {2313#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:46,777 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2313#(<= |rec1_#res| 0)} {2304#true} #28#return; {2310#(<= |rec1_#t~ret0| 0)} is VALID [2022-02-21 03:23:46,777 INFO L272 TraceCheckUtils]: 13: Hoare triple {2310#(<= |rec1_#t~ret0| 0)} call #t~ret1 := rec1(#t~ret0 - 1); {2311#(<= (+ |rec1_#in~i| 1) 0)} is VALID [2022-02-21 03:23:46,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {2311#(<= (+ |rec1_#in~i| 1) 0)} ~i := #in~i; {2312#(<= (+ rec1_~i 1) 0)} is VALID [2022-02-21 03:23:46,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {2312#(<= (+ rec1_~i 1) 0)} assume !(~i <= 0); {2305#false} is VALID [2022-02-21 03:23:46,778 INFO L272 TraceCheckUtils]: 16: Hoare triple {2305#false} call #t~ret0 := rec1(~i - 2); {2305#false} is VALID [2022-02-21 03:23:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:23:46,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:46,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46843367] [2022-02-21 03:23:46,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46843367] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:46,779 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:23:46,779 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:23:46,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878291948] [2022-02-21 03:23:46,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:46,819 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:46,820 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:46,820 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:46,820 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:46,820 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:46,820 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,820 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:46,820 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:46,820 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration3_Loop [2022-02-21 03:23:46,820 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:46,821 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:46,821 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:23:46,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:23:46,824 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:23:46,827 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:23:46,829 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:23:46,830 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:23:46,873 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:46,874 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:46,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,935 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:23:46,936 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:23:46,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:46,940 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,960 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:46,960 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:46,977 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:23:46,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,979 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:23:46,980 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:23:46,985 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:46,985 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:46,991 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:46,991 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,009 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:23:47,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,011 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:23:47,012 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:23:47,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:23:47,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,036 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:23:47,037 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:23:47,038 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:47,038 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,093 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:47,096 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:23:47,097 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:47,097 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:47,097 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:47,097 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:47,097 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:47,097 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,097 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:47,097 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:47,097 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration3_Loop [2022-02-21 03:23:47,097 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:47,097 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:47,098 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:23:47,100 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:23:47,115 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:23:47,118 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:23:47,119 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:23:47,121 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:23:47,150 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:23:47,178 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:47,178 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:47,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,196 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:23:47,212 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:23:47,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:47,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:47,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:47,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:47,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:47,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:47,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:47,220 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:23:47,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:47,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,268 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:23:47,287 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:23:47,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:47,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:47,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:47,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:47,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:47,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:47,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:47,299 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:23:47,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:47,338 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:23:47,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,340 INFO L229 MonitoredProcess]: Starting monitored process 32 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:23:47,357 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:23:47,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:47,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:47,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:47,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:47,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:47,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:47,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:47,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:23:47,387 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:47,393 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:23:47,393 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:23:47,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,408 INFO L229 MonitoredProcess]: Starting monitored process 33 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:23:47,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:23:47,419 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:47,419 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:47,419 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:47,420 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2022-02-21 03:23:47,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,459 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:47,461 INFO L390 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2022-02-21 03:23:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:23:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:47,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {2314#unseeded} assume { :begin_inline_ULTIMATE.init } true; {2314#unseeded} is VALID [2022-02-21 03:23:47,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {2314#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2314#unseeded} is VALID [2022-02-21 03:23:47,568 INFO L272 TraceCheckUtils]: 2: Hoare triple {2314#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {2314#unseeded} is VALID [2022-02-21 03:23:47,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {2314#unseeded} ~j := #in~j; {2314#unseeded} is VALID [2022-02-21 03:23:47,569 INFO L290 TraceCheckUtils]: 4: Hoare triple {2314#unseeded} assume !(~j <= 0); {2314#unseeded} is VALID [2022-02-21 03:23:47,572 INFO L272 TraceCheckUtils]: 5: Hoare triple {2314#unseeded} call #t~ret3 := rec1(~j - 1); {2314#unseeded} is VALID [2022-02-21 03:23:47,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {2314#unseeded} ~i := #in~i; {2314#unseeded} is VALID [2022-02-21 03:23:47,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {2314#unseeded} assume !(~i <= 0); {2314#unseeded} is VALID [2022-02-21 03:23:47,575 INFO L272 TraceCheckUtils]: 8: Hoare triple {2314#unseeded} call #t~ret0 := rec1(~i - 2); {2356#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {2356#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {2356#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {2356#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {2356#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {2356#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2356#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:47,579 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2356#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2314#unseeded} #28#return; {2314#unseeded} is VALID [2022-02-21 03:23:47,579 INFO L272 TraceCheckUtils]: 13: Hoare triple {2314#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {2314#unseeded} is VALID [2022-02-21 03:23:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:47,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:47,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {2317#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {2372#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:47,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {2372#(<= rec1_~i oldRank0)} assume !(~i <= 0); {2376#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:47,623 INFO L272 TraceCheckUtils]: 2: Hoare triple {2376#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {2327#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:47,623 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:23:47,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:47,642 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:23:47,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:47,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,643 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:47,643 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 130 transitions. cyclomatic complexity: 47 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:47,777 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 130 transitions. cyclomatic complexity: 47. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 135 states and 194 transitions. Complement of second has 14 states. [2022-02-21 03:23:47,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:47,777 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:47,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 130 transitions. cyclomatic complexity: 47 [2022-02-21 03:23:47,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:47,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:47,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:47,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:47,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:47,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:47,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 194 transitions. [2022-02-21 03:23:47,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:47,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:47,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:47,781 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 90 states and 130 transitions. cyclomatic complexity: 47 [2022-02-21 03:23:47,787 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:23:47,799 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:47,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:47,800 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:47,800 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 135 states and 194 transitions. cyclomatic complexity: 68 [2022-02-21 03:23:47,802 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:23:47,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:47,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:47,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:47,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:47,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:47,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:47,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:47,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:47,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:47,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 135 letters. Loop has 135 letters. [2022-02-21 03:23:47,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 135 letters. Loop has 135 letters. [2022-02-21 03:23:47,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 135 letters. Loop has 135 letters. [2022-02-21 03:23:47,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 90 letters. Loop has 90 letters. [2022-02-21 03:23:47,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 90 letters. Loop has 90 letters. [2022-02-21 03:23:47,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 90 letters. Loop has 90 letters. [2022-02-21 03:23:47,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:47,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:47,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:47,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:47,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:47,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:47,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:47,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:47,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:47,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:23:47,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:23:47,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:23:47,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:47,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:47,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:47,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:23:47,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:23:47,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:23:47,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:47,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:47,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 16 letters. Loop has 24 letters. [2022-02-21 03:23:47,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:47,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:47,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:23:47,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:47,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:47,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:47,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:47,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:47,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 21 letters. Loop has 45 letters. [2022-02-21 03:23:47,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:47,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:47,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:47,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:47,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:47,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:47,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:47,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:47,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:47,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:47,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:47,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:47,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:47,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:47,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:47,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:47,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:47,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:47,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:23:47,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:23:47,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:23:47,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:23:47,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:23:47,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:23:47,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:23:47,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:23:47,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:23:47,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:47,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:47,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 21 letters. Loop has 29 letters. [2022-02-21 03:23:47,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:47,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:47,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:23:47,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:47,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:47,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:47,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:23:47,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:23:47,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 8 letters. [2022-02-21 03:23:47,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:47,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:47,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:47,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:47,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:47,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:47,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:47,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:47,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:47,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 135 states and 194 transitions. cyclomatic complexity: 68 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:47,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,858 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-02-21 03:23:47,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:47,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:23:47,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:23:47,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:47,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 194 transitions. cyclomatic complexity: 68 [2022-02-21 03:23:47,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:47,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 123 states and 182 transitions. [2022-02-21 03:23:47,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2022-02-21 03:23:47,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2022-02-21 03:23:47,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 182 transitions. [2022-02-21 03:23:47,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:47,884 INFO L681 BuchiCegarLoop]: Abstraction has 123 states and 182 transitions. [2022-02-21 03:23:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 182 transitions. [2022-02-21 03:23:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2022-02-21 03:23:47,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:47,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states and 182 transitions. Second operand has 114 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 74 states have internal predecessors, (80), 33 states have call successors, (33), 19 states have call predecessors, (33), 16 states have return successors, (53), 20 states have call predecessors, (53), 28 states have call successors, (53) [2022-02-21 03:23:47,891 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states and 182 transitions. Second operand has 114 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 74 states have internal predecessors, (80), 33 states have call successors, (33), 19 states have call predecessors, (33), 16 states have return successors, (53), 20 states have call predecessors, (53), 28 states have call successors, (53) [2022-02-21 03:23:47,892 INFO L87 Difference]: Start difference. First operand 123 states and 182 transitions. Second operand has 114 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 74 states have internal predecessors, (80), 33 states have call successors, (33), 19 states have call predecessors, (33), 16 states have return successors, (53), 20 states have call predecessors, (53), 28 states have call successors, (53) [2022-02-21 03:23:47,892 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:47,908 INFO L93 Difference]: Finished difference Result 328 states and 495 transitions. [2022-02-21 03:23:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 495 transitions. [2022-02-21 03:23:47,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:47,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:47,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 74 states have internal predecessors, (80), 33 states have call successors, (33), 19 states have call predecessors, (33), 16 states have return successors, (53), 20 states have call predecessors, (53), 28 states have call successors, (53) Second operand 123 states and 182 transitions. [2022-02-21 03:23:47,911 INFO L87 Difference]: Start difference. First operand has 114 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 74 states have internal predecessors, (80), 33 states have call successors, (33), 19 states have call predecessors, (33), 16 states have return successors, (53), 20 states have call predecessors, (53), 28 states have call successors, (53) Second operand 123 states and 182 transitions. [2022-02-21 03:23:47,911 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:47,929 INFO L93 Difference]: Finished difference Result 378 states and 573 transitions. [2022-02-21 03:23:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 573 transitions. [2022-02-21 03:23:47,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:47,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:47,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:47,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 74 states have internal predecessors, (80), 33 states have call successors, (33), 19 states have call predecessors, (33), 16 states have return successors, (53), 20 states have call predecessors, (53), 28 states have call successors, (53) [2022-02-21 03:23:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2022-02-21 03:23:47,936 INFO L704 BuchiCegarLoop]: Abstraction has 114 states and 166 transitions. [2022-02-21 03:23:47,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:47,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:23:47,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:23:47,940 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:48,044 INFO L93 Difference]: Finished difference Result 124 states and 176 transitions. [2022-02-21 03:23:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:23:48,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:48,056 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:23:48,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 176 transitions. [2022-02-21 03:23:48,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-02-21 03:23:48,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 122 states and 174 transitions. [2022-02-21 03:23:48,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2022-02-21 03:23:48,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2022-02-21 03:23:48,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 174 transitions. [2022-02-21 03:23:48,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:48,068 INFO L681 BuchiCegarLoop]: Abstraction has 122 states and 174 transitions. [2022-02-21 03:23:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 174 transitions. [2022-02-21 03:23:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 102. [2022-02-21 03:23:48,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:48,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states and 174 transitions. Second operand has 102 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 64 states have internal predecessors, (68), 31 states have call successors, (31), 17 states have call predecessors, (31), 14 states have return successors, (45), 20 states have call predecessors, (45), 26 states have call successors, (45) [2022-02-21 03:23:48,083 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states and 174 transitions. Second operand has 102 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 64 states have internal predecessors, (68), 31 states have call successors, (31), 17 states have call predecessors, (31), 14 states have return successors, (45), 20 states have call predecessors, (45), 26 states have call successors, (45) [2022-02-21 03:23:48,083 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 102 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 64 states have internal predecessors, (68), 31 states have call successors, (31), 17 states have call predecessors, (31), 14 states have return successors, (45), 20 states have call predecessors, (45), 26 states have call successors, (45) [2022-02-21 03:23:48,084 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:48,116 INFO L93 Difference]: Finished difference Result 354 states and 537 transitions. [2022-02-21 03:23:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 537 transitions. [2022-02-21 03:23:48,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:48,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:48,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 64 states have internal predecessors, (68), 31 states have call successors, (31), 17 states have call predecessors, (31), 14 states have return successors, (45), 20 states have call predecessors, (45), 26 states have call successors, (45) Second operand 122 states and 174 transitions. [2022-02-21 03:23:48,120 INFO L87 Difference]: Start difference. First operand has 102 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 64 states have internal predecessors, (68), 31 states have call successors, (31), 17 states have call predecessors, (31), 14 states have return successors, (45), 20 states have call predecessors, (45), 26 states have call successors, (45) Second operand 122 states and 174 transitions. [2022-02-21 03:23:48,120 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:48,138 INFO L93 Difference]: Finished difference Result 406 states and 621 transitions. [2022-02-21 03:23:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 621 transitions. [2022-02-21 03:23:48,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:48,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:48,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:48,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 64 states have internal predecessors, (68), 31 states have call successors, (31), 17 states have call predecessors, (31), 14 states have return successors, (45), 20 states have call predecessors, (45), 26 states have call successors, (45) [2022-02-21 03:23:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2022-02-21 03:23:48,144 INFO L704 BuchiCegarLoop]: Abstraction has 102 states and 144 transitions. [2022-02-21 03:23:48,144 INFO L587 BuchiCegarLoop]: Abstraction has 102 states and 144 transitions. [2022-02-21 03:23:48,144 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:23:48,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 144 transitions. [2022-02-21 03:23:48,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-02-21 03:23:48,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:48,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:48,146 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:48,146 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:48,146 INFO L791 eck$LassoCheckResult]: Stem: 3863#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3864#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 3857#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 3880#rec2ENTRY ~j := #in~j; 3924#L18 assume !(~j <= 0); 3866#L20 call #t~ret3 := rec1(~j - 1);< 3923#rec1ENTRY ~i := #in~i; 3922#L12 assume !(~i <= 0); 3889#L14 call #t~ret0 := rec1(~i - 2);< 3919#rec1ENTRY ~i := #in~i; 3918#L12 assume !(~i <= 0); 3888#L14 call #t~ret0 := rec1(~i - 2);< 3917#rec1ENTRY ~i := #in~i; 3921#L12 assume ~i <= 0;#res := 0; 3957#rec1FINAL assume true; 3903#rec1EXIT >#28#return; 3894#L14-1 [2022-02-21 03:23:48,146 INFO L793 eck$LassoCheckResult]: Loop: 3894#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 3895#rec1ENTRY ~i := #in~i; 3909#L12 assume ~i <= 0;#res := 0; 3898#rec1FINAL assume true; 3900#rec1EXIT >#30#return; 3881#L14-2 call #t~ret2 := rec1(#t~ret1);< 3890#rec1ENTRY ~i := #in~i; 3952#L12 assume !(~i <= 0); 3882#L14 call #t~ret0 := rec1(~i - 2);< 3890#rec1ENTRY ~i := #in~i; 3952#L12 assume ~i <= 0;#res := 0; 3954#rec1FINAL assume true; 3953#rec1EXIT >#28#return; 3894#L14-1 [2022-02-21 03:23:48,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:48,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1325197585, now seen corresponding path program 1 times [2022-02-21 03:23:48,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:48,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187916093] [2022-02-21 03:23:48,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:48,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:48,154 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:48,159 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash 949089090, now seen corresponding path program 1 times [2022-02-21 03:23:48,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:48,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737589922] [2022-02-21 03:23:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:48,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-21 03:23:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {5095#true} ~i := #in~i; {5095#true} is VALID [2022-02-21 03:23:48,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {5095#true} assume ~i <= 0;#res := 0; {5108#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:48,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {5108#(<= |rec1_#res| 0)} assume true; {5108#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:48,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5108#(<= |rec1_#res| 0)} {5095#true} #30#return; {5101#(<= |rec1_#t~ret1| 0)} is VALID [2022-02-21 03:23:48,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:23:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {5095#true} ~i := #in~i; {5095#true} is VALID [2022-02-21 03:23:48,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {5095#true} assume ~i <= 0;#res := 0; {5095#true} is VALID [2022-02-21 03:23:48,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {5095#true} assume true; {5095#true} is VALID [2022-02-21 03:23:48,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5095#true} {5096#false} #28#return; {5096#false} is VALID [2022-02-21 03:23:48,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {5095#true} call #t~ret1 := rec1(#t~ret0 - 1); {5095#true} is VALID [2022-02-21 03:23:48,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {5095#true} ~i := #in~i; {5095#true} is VALID [2022-02-21 03:23:48,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {5095#true} assume ~i <= 0;#res := 0; {5108#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:48,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {5108#(<= |rec1_#res| 0)} assume true; {5108#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:48,205 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5108#(<= |rec1_#res| 0)} {5095#true} #30#return; {5101#(<= |rec1_#t~ret1| 0)} is VALID [2022-02-21 03:23:48,206 INFO L272 TraceCheckUtils]: 5: Hoare triple {5101#(<= |rec1_#t~ret1| 0)} call #t~ret2 := rec1(#t~ret1); {5102#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:48,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {5102#(<= |rec1_#in~i| 0)} ~i := #in~i; {5103#(<= rec1_~i 0)} is VALID [2022-02-21 03:23:48,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {5103#(<= rec1_~i 0)} assume !(~i <= 0); {5096#false} is VALID [2022-02-21 03:23:48,207 INFO L272 TraceCheckUtils]: 8: Hoare triple {5096#false} call #t~ret0 := rec1(~i - 2); {5095#true} is VALID [2022-02-21 03:23:48,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {5095#true} ~i := #in~i; {5095#true} is VALID [2022-02-21 03:23:48,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {5095#true} assume ~i <= 0;#res := 0; {5095#true} is VALID [2022-02-21 03:23:48,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {5095#true} assume true; {5095#true} is VALID [2022-02-21 03:23:48,207 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5095#true} {5096#false} #28#return; {5096#false} is VALID [2022-02-21 03:23:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:23:48,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:48,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737589922] [2022-02-21 03:23:48,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737589922] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:48,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114285724] [2022-02-21 03:23:48,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:48,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:48,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,224 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-02-21 03:23:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:23:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:48,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {5095#true} call #t~ret1 := rec1(#t~ret0 - 1); {5095#true} is VALID [2022-02-21 03:23:48,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {5095#true} ~i := #in~i; {5095#true} is VALID [2022-02-21 03:23:48,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {5095#true} assume ~i <= 0;#res := 0; {5108#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:48,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {5108#(<= |rec1_#res| 0)} assume true; {5108#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:48,335 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5108#(<= |rec1_#res| 0)} {5095#true} #30#return; {5101#(<= |rec1_#t~ret1| 0)} is VALID [2022-02-21 03:23:48,338 INFO L272 TraceCheckUtils]: 5: Hoare triple {5101#(<= |rec1_#t~ret1| 0)} call #t~ret2 := rec1(#t~ret1); {5102#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:48,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {5102#(<= |rec1_#in~i| 0)} ~i := #in~i; {5103#(<= rec1_~i 0)} is VALID [2022-02-21 03:23:48,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {5103#(<= rec1_~i 0)} assume !(~i <= 0); {5096#false} is VALID [2022-02-21 03:23:48,339 INFO L272 TraceCheckUtils]: 8: Hoare triple {5096#false} call #t~ret0 := rec1(~i - 2); {5096#false} is VALID [2022-02-21 03:23:48,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {5096#false} ~i := #in~i; {5096#false} is VALID [2022-02-21 03:23:48,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {5096#false} assume ~i <= 0;#res := 0; {5096#false} is VALID [2022-02-21 03:23:48,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {5096#false} assume true; {5096#false} is VALID [2022-02-21 03:23:48,339 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5096#false} {5096#false} #28#return; {5096#false} is VALID [2022-02-21 03:23:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:48,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:23:48,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114285724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:48,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:23:48,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2022-02-21 03:23:48,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042997443] [2022-02-21 03:23:48,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:48,341 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:23:48,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:48,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:23:48,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:23:48,342 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. cyclomatic complexity: 49 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:48,438 INFO L93 Difference]: Finished difference Result 118 states and 162 transitions. [2022-02-21 03:23:48,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:23:48,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:48,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:48,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 162 transitions. [2022-02-21 03:23:48,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:48,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 162 transitions. [2022-02-21 03:23:48,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-02-21 03:23:48,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-02-21 03:23:48,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 162 transitions. [2022-02-21 03:23:48,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:48,461 INFO L681 BuchiCegarLoop]: Abstraction has 118 states and 162 transitions. [2022-02-21 03:23:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 162 transitions. [2022-02-21 03:23:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2022-02-21 03:23:48,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:48,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states and 162 transitions. Second operand has 114 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 70 states have internal predecessors, (74), 35 states have call successors, (35), 19 states have call predecessors, (35), 16 states have return successors, (49), 24 states have call predecessors, (49), 30 states have call successors, (49) [2022-02-21 03:23:48,466 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states and 162 transitions. Second operand has 114 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 70 states have internal predecessors, (74), 35 states have call successors, (35), 19 states have call predecessors, (35), 16 states have return successors, (49), 24 states have call predecessors, (49), 30 states have call successors, (49) [2022-02-21 03:23:48,466 INFO L87 Difference]: Start difference. First operand 118 states and 162 transitions. Second operand has 114 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 70 states have internal predecessors, (74), 35 states have call successors, (35), 19 states have call predecessors, (35), 16 states have return successors, (49), 24 states have call predecessors, (49), 30 states have call successors, (49) [2022-02-21 03:23:48,466 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:48,479 INFO L93 Difference]: Finished difference Result 354 states and 515 transitions. [2022-02-21 03:23:48,479 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 515 transitions. [2022-02-21 03:23:48,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:48,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:48,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 70 states have internal predecessors, (74), 35 states have call successors, (35), 19 states have call predecessors, (35), 16 states have return successors, (49), 24 states have call predecessors, (49), 30 states have call successors, (49) Second operand 118 states and 162 transitions. [2022-02-21 03:23:48,482 INFO L87 Difference]: Start difference. First operand has 114 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 70 states have internal predecessors, (74), 35 states have call successors, (35), 19 states have call predecessors, (35), 16 states have return successors, (49), 24 states have call predecessors, (49), 30 states have call successors, (49) Second operand 118 states and 162 transitions. [2022-02-21 03:23:48,482 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:48,495 INFO L93 Difference]: Finished difference Result 354 states and 515 transitions. [2022-02-21 03:23:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 515 transitions. [2022-02-21 03:23:48,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:48,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:48,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:48,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 70 states have internal predecessors, (74), 35 states have call successors, (35), 19 states have call predecessors, (35), 16 states have return successors, (49), 24 states have call predecessors, (49), 30 states have call successors, (49) [2022-02-21 03:23:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2022-02-21 03:23:48,501 INFO L704 BuchiCegarLoop]: Abstraction has 114 states and 158 transitions. [2022-02-21 03:23:48,501 INFO L587 BuchiCegarLoop]: Abstraction has 114 states and 158 transitions. [2022-02-21 03:23:48,501 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:23:48,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 158 transitions. [2022-02-21 03:23:48,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:23:48,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:48,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:48,502 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:48,502 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:48,502 INFO L791 eck$LassoCheckResult]: Stem: 5276#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5277#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 5270#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 5293#rec2ENTRY ~j := #in~j; 5341#L18 assume !(~j <= 0); 5280#L20 call #t~ret3 := rec1(~j - 1);< 5340#rec1ENTRY ~i := #in~i; 5339#L12 assume !(~i <= 0); 5327#L14 call #t~ret0 := rec1(~i - 2);< 5337#rec1ENTRY ~i := #in~i; 5338#L12 assume ~i <= 0;#res := 0; 5360#rec1FINAL assume true; 5351#rec1EXIT >#28#return; 5300#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 5301#rec1ENTRY ~i := #in~i; 5372#L12 assume ~i <= 0;#res := 0; 5371#rec1FINAL assume true; 5370#rec1EXIT >#30#return; 5294#L14-2 call #t~ret2 := rec1(#t~ret1);< 5295#rec1ENTRY ~i := #in~i; 5317#L12 assume ~i <= 0;#res := 0; 5304#rec1FINAL assume true; 5306#rec1EXIT >#32#return; 5278#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 5281#rec1FINAL assume true; 5333#rec1EXIT >#34#return; 5269#L20-1 [2022-02-21 03:23:48,502 INFO L793 eck$LassoCheckResult]: Loop: 5269#L20-1 call #t~ret4 := rec2(#t~ret3);< 5273#rec2ENTRY ~j := #in~j; 5313#L18 assume !(~j <= 0); 5322#L20 call #t~ret3 := rec1(~j - 1);< 5320#rec1ENTRY ~i := #in~i; 5362#L12 assume !(~i <= 0); 5331#L14 call #t~ret0 := rec1(~i - 2);< 5320#rec1ENTRY ~i := #in~i; 5362#L12 assume ~i <= 0;#res := 0; 5361#rec1FINAL assume true; 5352#rec1EXIT >#28#return; 5353#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 5301#rec1ENTRY ~i := #in~i; 5372#L12 assume ~i <= 0;#res := 0; 5371#rec1FINAL assume true; 5370#rec1EXIT >#30#return; 5305#L14-2 call #t~ret2 := rec1(#t~ret1);< 5295#rec1ENTRY ~i := #in~i; 5317#L12 assume ~i <= 0;#res := 0; 5304#rec1FINAL assume true; 5306#rec1EXIT >#32#return; 5309#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 5345#rec1FINAL assume true; 5325#rec1EXIT >#34#return; 5269#L20-1 [2022-02-21 03:23:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:48,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1231361643, now seen corresponding path program 1 times [2022-02-21 03:23:48,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:48,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386962262] [2022-02-21 03:23:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:48,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:48,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:48,535 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:48,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:48,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1591101301, now seen corresponding path program 1 times [2022-02-21 03:23:48,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:48,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600834176] [2022-02-21 03:23:48,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:48,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:48,550 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:48,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:48,551 INFO L85 PathProgramCache]: Analyzing trace with hash 774680821, now seen corresponding path program 1 times [2022-02-21 03:23:48,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:48,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595339277] [2022-02-21 03:23:48,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:48,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:23:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:23:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6463#true} {6463#true} #28#return; {6463#true} is VALID [2022-02-21 03:23:48,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:23:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6463#true} {6463#true} #30#return; {6463#true} is VALID [2022-02-21 03:23:48,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:23:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6522#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:48,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {6522#(<= |rec1_#res| 0)} assume true; {6522#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:48,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6522#(<= |rec1_#res| 0)} {6463#true} #32#return; {6520#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:48,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {6463#true} assume !(~i <= 0); {6463#true} is VALID [2022-02-21 03:23:48,666 INFO L272 TraceCheckUtils]: 2: Hoare triple {6463#true} call #t~ret0 := rec1(~i - 2); {6463#true} is VALID [2022-02-21 03:23:48,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,667 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6463#true} {6463#true} #28#return; {6463#true} is VALID [2022-02-21 03:23:48,667 INFO L272 TraceCheckUtils]: 7: Hoare triple {6463#true} call #t~ret1 := rec1(#t~ret0 - 1); {6463#true} is VALID [2022-02-21 03:23:48,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,668 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6463#true} {6463#true} #30#return; {6463#true} is VALID [2022-02-21 03:23:48,668 INFO L272 TraceCheckUtils]: 12: Hoare triple {6463#true} call #t~ret2 := rec1(#t~ret1); {6463#true} is VALID [2022-02-21 03:23:48,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6522#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:48,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {6522#(<= |rec1_#res| 0)} assume true; {6522#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:48,669 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6522#(<= |rec1_#res| 0)} {6463#true} #32#return; {6520#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:48,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {6520#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6521#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:48,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {6521#(<= |rec1_#res| 1)} assume true; {6521#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:48,671 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6521#(<= |rec1_#res| 1)} {6463#true} #34#return; {6485#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:23:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-21 03:23:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:23:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6463#true} {6524#(and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))} #28#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:23:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6463#true} {6529#(<= 1 |rec1_#in~i|)} #30#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:23:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6463#true} {6529#(<= 1 |rec1_#in~i|)} #32#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {6463#true} ~i := #in~i; {6523#(= |rec1_#in~i| rec1_~i)} is VALID [2022-02-21 03:23:48,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {6523#(= |rec1_#in~i| rec1_~i)} assume !(~i <= 0); {6524#(and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))} is VALID [2022-02-21 03:23:48,750 INFO L272 TraceCheckUtils]: 2: Hoare triple {6524#(and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))} call #t~ret0 := rec1(~i - 2); {6463#true} is VALID [2022-02-21 03:23:48,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,751 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6463#true} {6524#(and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))} #28#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,751 INFO L272 TraceCheckUtils]: 7: Hoare triple {6529#(<= 1 |rec1_#in~i|)} call #t~ret1 := rec1(#t~ret0 - 1); {6463#true} is VALID [2022-02-21 03:23:48,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,752 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6463#true} {6529#(<= 1 |rec1_#in~i|)} #30#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,752 INFO L272 TraceCheckUtils]: 12: Hoare triple {6529#(<= 1 |rec1_#in~i|)} call #t~ret2 := rec1(#t~ret1); {6463#true} is VALID [2022-02-21 03:23:48,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,753 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6463#true} {6529#(<= 1 |rec1_#in~i|)} #32#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {6529#(<= 1 |rec1_#in~i|)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {6529#(<= 1 |rec1_#in~i|)} assume true; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,754 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6529#(<= 1 |rec1_#in~i|)} {6487#(<= rec2_~j 1)} #34#return; {6464#false} is VALID [2022-02-21 03:23:48,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {6463#true} assume { :begin_inline_ULTIMATE.init } true; {6463#true} is VALID [2022-02-21 03:23:48,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {6463#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {6463#true} is VALID [2022-02-21 03:23:48,755 INFO L272 TraceCheckUtils]: 2: Hoare triple {6463#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {6463#true} is VALID [2022-02-21 03:23:48,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {6463#true} ~j := #in~j; {6463#true} is VALID [2022-02-21 03:23:48,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {6463#true} assume !(~j <= 0); {6463#true} is VALID [2022-02-21 03:23:48,755 INFO L272 TraceCheckUtils]: 5: Hoare triple {6463#true} call #t~ret3 := rec1(~j - 1); {6463#true} is VALID [2022-02-21 03:23:48,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {6463#true} assume !(~i <= 0); {6463#true} is VALID [2022-02-21 03:23:48,756 INFO L272 TraceCheckUtils]: 8: Hoare triple {6463#true} call #t~ret0 := rec1(~i - 2); {6463#true} is VALID [2022-02-21 03:23:48,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,756 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6463#true} {6463#true} #28#return; {6463#true} is VALID [2022-02-21 03:23:48,756 INFO L272 TraceCheckUtils]: 13: Hoare triple {6463#true} call #t~ret1 := rec1(#t~ret0 - 1); {6463#true} is VALID [2022-02-21 03:23:48,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,757 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6463#true} {6463#true} #30#return; {6463#true} is VALID [2022-02-21 03:23:48,757 INFO L272 TraceCheckUtils]: 18: Hoare triple {6463#true} call #t~ret2 := rec1(#t~ret1); {6463#true} is VALID [2022-02-21 03:23:48,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6522#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:48,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {6522#(<= |rec1_#res| 0)} assume true; {6522#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:48,759 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6522#(<= |rec1_#res| 0)} {6463#true} #32#return; {6520#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:48,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {6520#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6521#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:48,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {6521#(<= |rec1_#res| 1)} assume true; {6521#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:48,760 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6521#(<= |rec1_#res| 1)} {6463#true} #34#return; {6485#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:23:48,760 INFO L272 TraceCheckUtils]: 26: Hoare triple {6485#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3); {6486#(<= |rec2_#in~j| 1)} is VALID [2022-02-21 03:23:48,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {6486#(<= |rec2_#in~j| 1)} ~j := #in~j; {6487#(<= rec2_~j 1)} is VALID [2022-02-21 03:23:48,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {6487#(<= rec2_~j 1)} assume !(~j <= 0); {6487#(<= rec2_~j 1)} is VALID [2022-02-21 03:23:48,761 INFO L272 TraceCheckUtils]: 29: Hoare triple {6487#(<= rec2_~j 1)} call #t~ret3 := rec1(~j - 1); {6463#true} is VALID [2022-02-21 03:23:48,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {6463#true} ~i := #in~i; {6523#(= |rec1_#in~i| rec1_~i)} is VALID [2022-02-21 03:23:48,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {6523#(= |rec1_#in~i| rec1_~i)} assume !(~i <= 0); {6524#(and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))} is VALID [2022-02-21 03:23:48,762 INFO L272 TraceCheckUtils]: 32: Hoare triple {6524#(and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))} call #t~ret0 := rec1(~i - 2); {6463#true} is VALID [2022-02-21 03:23:48,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,774 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6463#true} {6524#(and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))} #28#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,774 INFO L272 TraceCheckUtils]: 37: Hoare triple {6529#(<= 1 |rec1_#in~i|)} call #t~ret1 := rec1(#t~ret0 - 1); {6463#true} is VALID [2022-02-21 03:23:48,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,777 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6463#true} {6529#(<= 1 |rec1_#in~i|)} #30#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,777 INFO L272 TraceCheckUtils]: 42: Hoare triple {6529#(<= 1 |rec1_#in~i|)} call #t~ret2 := rec1(#t~ret1); {6463#true} is VALID [2022-02-21 03:23:48,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:48,777 INFO L290 TraceCheckUtils]: 44: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:48,778 INFO L290 TraceCheckUtils]: 45: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:48,778 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6463#true} {6529#(<= 1 |rec1_#in~i|)} #32#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,778 INFO L290 TraceCheckUtils]: 47: Hoare triple {6529#(<= 1 |rec1_#in~i|)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {6529#(<= 1 |rec1_#in~i|)} assume true; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:48,779 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6529#(<= 1 |rec1_#in~i|)} {6487#(<= rec2_~j 1)} #34#return; {6464#false} is VALID [2022-02-21 03:23:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-02-21 03:23:48,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:48,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595339277] [2022-02-21 03:23:48,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595339277] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:48,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239521724] [2022-02-21 03:23:48,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:48,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:48,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,782 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-02-21 03:23:48,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:23:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:49,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {6463#true} assume { :begin_inline_ULTIMATE.init } true; {6463#true} is VALID [2022-02-21 03:23:49,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {6463#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {6463#true} is VALID [2022-02-21 03:23:49,072 INFO L272 TraceCheckUtils]: 2: Hoare triple {6463#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {6463#true} is VALID [2022-02-21 03:23:49,072 INFO L290 TraceCheckUtils]: 3: Hoare triple {6463#true} ~j := #in~j; {6463#true} is VALID [2022-02-21 03:23:49,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {6463#true} assume !(~j <= 0); {6463#true} is VALID [2022-02-21 03:23:49,073 INFO L272 TraceCheckUtils]: 5: Hoare triple {6463#true} call #t~ret3 := rec1(~j - 1); {6463#true} is VALID [2022-02-21 03:23:49,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {6463#true} assume !(~i <= 0); {6463#true} is VALID [2022-02-21 03:23:49,073 INFO L272 TraceCheckUtils]: 8: Hoare triple {6463#true} call #t~ret0 := rec1(~i - 2); {6463#true} is VALID [2022-02-21 03:23:49,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:49,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:49,074 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6463#true} {6463#true} #28#return; {6463#true} is VALID [2022-02-21 03:23:49,074 INFO L272 TraceCheckUtils]: 13: Hoare triple {6463#true} call #t~ret1 := rec1(#t~ret0 - 1); {6463#true} is VALID [2022-02-21 03:23:49,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:49,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:49,074 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6463#true} {6463#true} #30#return; {6463#true} is VALID [2022-02-21 03:23:49,074 INFO L272 TraceCheckUtils]: 18: Hoare triple {6463#true} call #t~ret2 := rec1(#t~ret1); {6463#true} is VALID [2022-02-21 03:23:49,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6522#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:49,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {6522#(<= |rec1_#res| 0)} assume true; {6522#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:49,076 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6522#(<= |rec1_#res| 0)} {6463#true} #32#return; {6520#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:49,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {6520#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6521#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:49,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {6521#(<= |rec1_#res| 1)} assume true; {6521#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:49,078 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6521#(<= |rec1_#res| 1)} {6463#true} #34#return; {6485#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:23:49,078 INFO L272 TraceCheckUtils]: 26: Hoare triple {6485#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3); {6486#(<= |rec2_#in~j| 1)} is VALID [2022-02-21 03:23:49,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {6486#(<= |rec2_#in~j| 1)} ~j := #in~j; {6487#(<= rec2_~j 1)} is VALID [2022-02-21 03:23:49,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {6487#(<= rec2_~j 1)} assume !(~j <= 0); {6487#(<= rec2_~j 1)} is VALID [2022-02-21 03:23:49,079 INFO L272 TraceCheckUtils]: 29: Hoare triple {6487#(<= rec2_~j 1)} call #t~ret3 := rec1(~j - 1); {6463#true} is VALID [2022-02-21 03:23:49,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {6463#true} ~i := #in~i; {6631#(<= rec1_~i |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {6631#(<= rec1_~i |rec1_#in~i|)} assume !(~i <= 0); {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,092 INFO L272 TraceCheckUtils]: 32: Hoare triple {6529#(<= 1 |rec1_#in~i|)} call #t~ret0 := rec1(~i - 2); {6463#true} is VALID [2022-02-21 03:23:49,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:49,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:49,093 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6463#true} {6529#(<= 1 |rec1_#in~i|)} #28#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,093 INFO L272 TraceCheckUtils]: 37: Hoare triple {6529#(<= 1 |rec1_#in~i|)} call #t~ret1 := rec1(#t~ret0 - 1); {6463#true} is VALID [2022-02-21 03:23:49,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:49,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:49,094 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6463#true} {6529#(<= 1 |rec1_#in~i|)} #30#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,094 INFO L272 TraceCheckUtils]: 42: Hoare triple {6529#(<= 1 |rec1_#in~i|)} call #t~ret2 := rec1(#t~ret1); {6463#true} is VALID [2022-02-21 03:23:49,094 INFO L290 TraceCheckUtils]: 43: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:49,094 INFO L290 TraceCheckUtils]: 45: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:49,095 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6463#true} {6529#(<= 1 |rec1_#in~i|)} #32#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,095 INFO L290 TraceCheckUtils]: 47: Hoare triple {6529#(<= 1 |rec1_#in~i|)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,096 INFO L290 TraceCheckUtils]: 48: Hoare triple {6529#(<= 1 |rec1_#in~i|)} assume true; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,096 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6529#(<= 1 |rec1_#in~i|)} {6487#(<= rec2_~j 1)} #34#return; {6464#false} is VALID [2022-02-21 03:23:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-02-21 03:23:49,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:49,651 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6529#(<= 1 |rec1_#in~i|)} {6487#(<= rec2_~j 1)} #34#return; {6464#false} is VALID [2022-02-21 03:23:49,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {6529#(<= 1 |rec1_#in~i|)} assume true; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,652 INFO L290 TraceCheckUtils]: 47: Hoare triple {6529#(<= 1 |rec1_#in~i|)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,652 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6463#true} {6529#(<= 1 |rec1_#in~i|)} #32#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,652 INFO L290 TraceCheckUtils]: 45: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:49,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:49,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,653 INFO L272 TraceCheckUtils]: 42: Hoare triple {6529#(<= 1 |rec1_#in~i|)} call #t~ret2 := rec1(#t~ret1); {6463#true} is VALID [2022-02-21 03:23:49,654 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6463#true} {6529#(<= 1 |rec1_#in~i|)} #30#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:49,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:49,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,654 INFO L272 TraceCheckUtils]: 37: Hoare triple {6529#(<= 1 |rec1_#in~i|)} call #t~ret1 := rec1(#t~ret0 - 1); {6463#true} is VALID [2022-02-21 03:23:49,654 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6463#true} {6529#(<= 1 |rec1_#in~i|)} #28#return; {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:49,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:49,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,655 INFO L272 TraceCheckUtils]: 32: Hoare triple {6529#(<= 1 |rec1_#in~i|)} call #t~ret0 := rec1(~i - 2); {6463#true} is VALID [2022-02-21 03:23:49,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {6746#(or (<= rec1_~i 0) (<= 1 |rec1_#in~i|))} assume !(~i <= 0); {6529#(<= 1 |rec1_#in~i|)} is VALID [2022-02-21 03:23:49,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {6463#true} ~i := #in~i; {6746#(or (<= rec1_~i 0) (<= 1 |rec1_#in~i|))} is VALID [2022-02-21 03:23:49,656 INFO L272 TraceCheckUtils]: 29: Hoare triple {6487#(<= rec2_~j 1)} call #t~ret3 := rec1(~j - 1); {6463#true} is VALID [2022-02-21 03:23:49,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {6487#(<= rec2_~j 1)} assume !(~j <= 0); {6487#(<= rec2_~j 1)} is VALID [2022-02-21 03:23:49,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {6486#(<= |rec2_#in~j| 1)} ~j := #in~j; {6487#(<= rec2_~j 1)} is VALID [2022-02-21 03:23:49,657 INFO L272 TraceCheckUtils]: 26: Hoare triple {6485#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3); {6486#(<= |rec2_#in~j| 1)} is VALID [2022-02-21 03:23:49,658 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6521#(<= |rec1_#res| 1)} {6463#true} #34#return; {6485#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:23:49,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {6521#(<= |rec1_#res| 1)} assume true; {6521#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:49,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {6520#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6521#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:49,659 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6522#(<= |rec1_#res| 0)} {6463#true} #32#return; {6520#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:49,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {6522#(<= |rec1_#res| 0)} assume true; {6522#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:49,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6522#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:49,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,660 INFO L272 TraceCheckUtils]: 18: Hoare triple {6463#true} call #t~ret2 := rec1(#t~ret1); {6463#true} is VALID [2022-02-21 03:23:49,660 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6463#true} {6463#true} #30#return; {6463#true} is VALID [2022-02-21 03:23:49,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:49,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:49,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,660 INFO L272 TraceCheckUtils]: 13: Hoare triple {6463#true} call #t~ret1 := rec1(#t~ret0 - 1); {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6463#true} {6463#true} #28#return; {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {6463#true} assume true; {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {6463#true} assume ~i <= 0;#res := 0; {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L272 TraceCheckUtils]: 8: Hoare triple {6463#true} call #t~ret0 := rec1(~i - 2); {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {6463#true} assume !(~i <= 0); {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {6463#true} ~i := #in~i; {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L272 TraceCheckUtils]: 5: Hoare triple {6463#true} call #t~ret3 := rec1(~j - 1); {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {6463#true} assume !(~j <= 0); {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {6463#true} ~j := #in~j; {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L272 TraceCheckUtils]: 2: Hoare triple {6463#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {6463#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {6463#true} is VALID [2022-02-21 03:23:49,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {6463#true} assume { :begin_inline_ULTIMATE.init } true; {6463#true} is VALID [2022-02-21 03:23:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-02-21 03:23:49,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239521724] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:49,662 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:49,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-02-21 03:23:49,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218842363] [2022-02-21 03:23:49,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:50,068 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:50,068 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:50,068 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:50,068 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:50,068 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:50,069 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:50,069 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:50,069 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:50,069 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration5_Loop [2022-02-21 03:23:50,069 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:50,069 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:50,070 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:23:50,077 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:23:50,079 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:23:50,119 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:50,119 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:50,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:50,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:50,122 INFO L229 MonitoredProcess]: Starting monitored process 36 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:23:50,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:23:50,124 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:50,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:50,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:50,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:50,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:50,173 INFO L229 MonitoredProcess]: Starting monitored process 37 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:23:50,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:23:50,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:50,176 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:53,126 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:53,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:23:53,131 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:53,131 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:53,131 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:53,131 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:53,131 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:53,131 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:53,131 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:53,131 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:53,131 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration5_Loop [2022-02-21 03:23:53,131 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:53,132 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:53,132 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:23:53,139 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:23:53,142 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:23:53,184 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:53,185 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:53,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:53,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:53,186 INFO L229 MonitoredProcess]: Starting monitored process 38 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:23:53,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:23:53,188 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:23:53,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:53,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:53,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:53,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:53,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:53,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:53,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:53,197 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:53,204 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:23:53,204 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:23:53,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:53,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:53,206 INFO L229 MonitoredProcess]: Starting monitored process 39 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:23:53,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:23:53,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:53,208 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:53,208 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:53,208 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#t~ret3) = 1*rec2_#t~ret3 Supporting invariants [] [2022-02-21 03:23:53,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 03:23:53,227 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:53,229 INFO L390 LassoCheck]: Loop: "call #t~ret4 := rec2(#t~ret3);"< "~j := #in~j;" "assume !(~j <= 0);" "call #t~ret3 := rec1(~j - 1);"< "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#28#return;" "call #t~ret1 := rec1(#t~ret0 - 1);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#30#return;" "call #t~ret2 := rec1(#t~ret1);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#32#return;" "#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#34#return;" [2022-02-21 03:23:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:53,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:23:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:53,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:53,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {6834#unseeded} assume { :begin_inline_ULTIMATE.init } true; {6834#unseeded} is VALID [2022-02-21 03:23:53,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {6834#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {6834#unseeded} is VALID [2022-02-21 03:23:53,533 INFO L272 TraceCheckUtils]: 2: Hoare triple {6834#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {6834#unseeded} is VALID [2022-02-21 03:23:53,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {6834#unseeded} ~j := #in~j; {6834#unseeded} is VALID [2022-02-21 03:23:53,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {6834#unseeded} assume !(~j <= 0); {6834#unseeded} is VALID [2022-02-21 03:23:53,535 INFO L272 TraceCheckUtils]: 5: Hoare triple {6834#unseeded} call #t~ret3 := rec1(~j - 1); {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,536 INFO L272 TraceCheckUtils]: 8: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,538 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,538 INFO L272 TraceCheckUtils]: 13: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,545 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,545 INFO L272 TraceCheckUtils]: 18: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,548 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:53,549 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6867#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6834#unseeded} #34#return; {6834#unseeded} is VALID [2022-02-21 03:23:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:53,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:23:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:53,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:53,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:53,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {6837#(>= oldRank0 |rec2_#t~ret3|)} call #t~ret4 := rec2(#t~ret3); {6928#(<= |rec2_#in~j| oldRank0)} is VALID [2022-02-21 03:23:53,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {6928#(<= |rec2_#in~j| oldRank0)} ~j := #in~j; {6932#(<= rec2_~j oldRank0)} is VALID [2022-02-21 03:23:53,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {6932#(<= rec2_~j oldRank0)} assume !(~j <= 0); {6932#(<= rec2_~j oldRank0)} is VALID [2022-02-21 03:23:53,916 INFO L272 TraceCheckUtils]: 3: Hoare triple {6932#(<= rec2_~j oldRank0)} call #t~ret3 := rec1(~j - 1); {6939#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:53,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {6939#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {6943#(and (<= rec1_~i |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:53,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {6943#(and (<= rec1_~i |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} assume !(~i <= 0); {6947#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:53,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {6947#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret0 := rec1(~i - 2); {6939#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:53,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {6939#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {6939#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:53,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {6939#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {6939#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:53,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {6939#(<= |old(oldRank0)| oldRank0)} assume true; {6939#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:53,919 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6939#(<= |old(oldRank0)| oldRank0)} {6947#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #28#return; {6947#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:53,919 INFO L272 TraceCheckUtils]: 11: Hoare triple {6947#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret1 := rec1(#t~ret0 - 1); {6939#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:53,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {6939#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {6939#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:53,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {6939#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {6939#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:53,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {6939#(<= |old(oldRank0)| oldRank0)} assume true; {6939#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:53,921 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6939#(<= |old(oldRank0)| oldRank0)} {6947#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #30#return; {6947#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:53,921 INFO L272 TraceCheckUtils]: 16: Hoare triple {6947#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret2 := rec1(#t~ret1); {6939#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:53,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {6939#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {6939#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:53,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {6939#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {6987#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:53,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {6987#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {6987#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:53,923 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6987#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} {6947#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #32#return; {6994#(and (<= |rec1_#t~ret2| 0) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:53,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {6994#(and (<= |rec1_#t~ret2| 0) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {6998#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:53,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {6998#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} assume true; {6998#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:53,924 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6998#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} {6932#(<= rec2_~j oldRank0)} #34#return; {6847#(or unseeded (and (>= oldRank0 0) (> oldRank0 |rec2_#t~ret3|)))} is VALID [2022-02-21 03:23:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 03:23:53,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:23:53,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:53,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:53,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:53,962 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2022-02-21 03:23:53,963 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 114 states and 158 transitions. cyclomatic complexity: 51 Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:23:54,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 114 states and 158 transitions. cyclomatic complexity: 51. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Result 585 states and 904 transitions. Complement of second has 45 states. [2022-02-21 03:23:54,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:54,610 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:54,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 158 transitions. cyclomatic complexity: 51 [2022-02-21 03:23:54,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:54,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:54,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:23:54,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:54,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:54,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:54,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 585 states and 904 transitions. [2022-02-21 03:23:54,615 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-02-21 03:23:54,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:54,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:54,616 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 114 states and 158 transitions. cyclomatic complexity: 51 [2022-02-21 03:23:54,622 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:23:54,622 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:23:54,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:54,623 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:54,624 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 585 states and 904 transitions. cyclomatic complexity: 339 [2022-02-21 03:23:54,627 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 22 examples of accepted words. [2022-02-21 03:23:54,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:54,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:54,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:54,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 3 letters. Loop has 11 letters. [2022-02-21 03:23:54,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 3 letters. Loop has 11 letters. [2022-02-21 03:23:54,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 3 letters. Loop has 11 letters. [2022-02-21 03:23:54,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:54,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:54,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:54,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 585 letters. Loop has 585 letters. [2022-02-21 03:23:54,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 585 letters. Loop has 585 letters. [2022-02-21 03:23:54,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 585 letters. Loop has 585 letters. [2022-02-21 03:23:54,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 114 letters. Loop has 114 letters. [2022-02-21 03:23:54,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 114 letters. Loop has 114 letters. [2022-02-21 03:23:54,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 114 letters. Loop has 114 letters. [2022-02-21 03:23:54,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:23:54,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:23:54,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:23:54,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:54,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:54,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:54,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:54,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:54,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:54,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:54,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:54,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:54,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:54,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:54,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:54,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:54,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:54,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:54,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:54,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:54,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:54,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:54,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:54,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:54,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:54,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:54,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 28 letters. Loop has 24 letters. [2022-02-21 03:23:54,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:54,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:54,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:54,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:54,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:54,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 27 letters. Loop has 24 letters. [2022-02-21 03:23:54,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:54,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:54,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 29 letters. Loop has 24 letters. [2022-02-21 03:23:54,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:54,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:54,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:54,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 3 letters. Loop has 11 letters. [2022-02-21 03:23:54,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 3 letters. Loop has 11 letters. [2022-02-21 03:23:54,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 3 letters. Loop has 11 letters. [2022-02-21 03:23:54,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:54,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:54,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:54,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:54,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:54,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:54,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:54,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:54,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:54,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:54,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:54,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:54,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:54,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:54,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:54,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:54,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:54,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:54,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:54,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:54,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:54,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:54,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:54,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:54,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 61 letters. Loop has 141 letters. [2022-02-21 03:23:54,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 61 letters. Loop has 141 letters. [2022-02-21 03:23:54,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 61 letters. Loop has 141 letters. [2022-02-21 03:23:54,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:54,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:54,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:54,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 40 letters. Loop has 72 letters. [2022-02-21 03:23:54,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 40 letters. Loop has 72 letters. [2022-02-21 03:23:54,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 40 letters. Loop has 72 letters. [2022-02-21 03:23:54,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:54,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:54,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:54,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 61 letters. Loop has 141 letters. [2022-02-21 03:23:54,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 61 letters. Loop has 141 letters. [2022-02-21 03:23:54,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 61 letters. Loop has 141 letters. [2022-02-21 03:23:54,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 61 letters. Loop has 93 letters. [2022-02-21 03:23:54,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 61 letters. Loop has 93 letters. [2022-02-21 03:23:54,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 61 letters. Loop has 93 letters. [2022-02-21 03:23:54,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:54,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:54,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:54,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 40 letters. Loop has 72 letters. [2022-02-21 03:23:54,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 40 letters. Loop has 72 letters. [2022-02-21 03:23:54,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 40 letters. Loop has 72 letters. [2022-02-21 03:23:54,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 51 letters. Loop has 72 letters. [2022-02-21 03:23:54,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 51 letters. Loop has 72 letters. [2022-02-21 03:23:54,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 51 letters. Loop has 72 letters. [2022-02-21 03:23:54,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 52 letters. Loop has 72 letters. [2022-02-21 03:23:54,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 52 letters. Loop has 72 letters. [2022-02-21 03:23:54,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 52 letters. Loop has 72 letters. [2022-02-21 03:23:54,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 53 letters. Loop has 72 letters. [2022-02-21 03:23:54,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 72 letters. [2022-02-21 03:23:54,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 53 letters. Loop has 72 letters. [2022-02-21 03:23:54,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 50 letters. Loop has 72 letters. [2022-02-21 03:23:54,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 50 letters. Loop has 72 letters. [2022-02-21 03:23:54,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 50 letters. Loop has 72 letters. [2022-02-21 03:23:54,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 50 letters. Loop has 24 letters. [2022-02-21 03:23:54,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 50 letters. Loop has 24 letters. [2022-02-21 03:23:54,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 50 letters. Loop has 24 letters. [2022-02-21 03:23:54,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 114 states and 158 transitions. cyclomatic complexity: 51 Stem has 50 letters. Loop has 72 letters. [2022-02-21 03:23:54,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Stem has 50 letters. Loop has 72 letters. [2022-02-21 03:23:54,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 585 states and 904 transitions. cyclomatic complexity: 339 Stem has 50 letters. Loop has 72 letters. [2022-02-21 03:23:54,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,701 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:23:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-02-21 03:23:54,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 26 letters. Loop has 24 letters. [2022-02-21 03:23:54,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 50 letters. Loop has 24 letters. [2022-02-21 03:23:54,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 26 letters. Loop has 48 letters. [2022-02-21 03:23:54,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:54,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 585 states and 904 transitions. cyclomatic complexity: 339 [2022-02-21 03:23:54,727 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-02-21 03:23:54,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 585 states to 433 states and 650 transitions. [2022-02-21 03:23:54,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2022-02-21 03:23:54,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2022-02-21 03:23:54,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 650 transitions. [2022-02-21 03:23:54,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:54,746 INFO L681 BuchiCegarLoop]: Abstraction has 433 states and 650 transitions. [2022-02-21 03:23:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 650 transitions. [2022-02-21 03:23:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 384. [2022-02-21 03:23:54,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:54,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states and 650 transitions. Second operand has 384 states, 203 states have (on average 1.1428571428571428) internal successors, (232), 226 states have internal predecessors, (232), 125 states have call successors, (129), 57 states have call predecessors, (129), 56 states have return successors, (174), 100 states have call predecessors, (174), 116 states have call successors, (174) [2022-02-21 03:23:54,765 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states and 650 transitions. Second operand has 384 states, 203 states have (on average 1.1428571428571428) internal successors, (232), 226 states have internal predecessors, (232), 125 states have call successors, (129), 57 states have call predecessors, (129), 56 states have return successors, (174), 100 states have call predecessors, (174), 116 states have call successors, (174) [2022-02-21 03:23:54,766 INFO L87 Difference]: Start difference. First operand 433 states and 650 transitions. Second operand has 384 states, 203 states have (on average 1.1428571428571428) internal successors, (232), 226 states have internal predecessors, (232), 125 states have call successors, (129), 57 states have call predecessors, (129), 56 states have return successors, (174), 100 states have call predecessors, (174), 116 states have call successors, (174) [2022-02-21 03:23:54,766 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:54,854 INFO L93 Difference]: Finished difference Result 1549 states and 2353 transitions. [2022-02-21 03:23:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2353 transitions. [2022-02-21 03:23:54,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:54,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:54,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 384 states, 203 states have (on average 1.1428571428571428) internal successors, (232), 226 states have internal predecessors, (232), 125 states have call successors, (129), 57 states have call predecessors, (129), 56 states have return successors, (174), 100 states have call predecessors, (174), 116 states have call successors, (174) Second operand 433 states and 650 transitions. [2022-02-21 03:23:54,867 INFO L87 Difference]: Start difference. First operand has 384 states, 203 states have (on average 1.1428571428571428) internal successors, (232), 226 states have internal predecessors, (232), 125 states have call successors, (129), 57 states have call predecessors, (129), 56 states have return successors, (174), 100 states have call predecessors, (174), 116 states have call successors, (174) Second operand 433 states and 650 transitions. [2022-02-21 03:23:54,867 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:54,968 INFO L93 Difference]: Finished difference Result 1659 states and 2534 transitions. [2022-02-21 03:23:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2534 transitions. [2022-02-21 03:23:54,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:54,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:54,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:54,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 203 states have (on average 1.1428571428571428) internal successors, (232), 226 states have internal predecessors, (232), 125 states have call successors, (129), 57 states have call predecessors, (129), 56 states have return successors, (174), 100 states have call predecessors, (174), 116 states have call successors, (174) [2022-02-21 03:23:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 535 transitions. [2022-02-21 03:23:54,987 INFO L704 BuchiCegarLoop]: Abstraction has 384 states and 535 transitions. [2022-02-21 03:23:54,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:23:54,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:23:54,988 INFO L87 Difference]: Start difference. First operand 384 states and 535 transitions. Second operand has 13 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-21 03:23:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:55,357 INFO L93 Difference]: Finished difference Result 443 states and 646 transitions. [2022-02-21 03:23:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:23:55,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-21 03:23:55,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:55,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 443 states and 646 transitions. [2022-02-21 03:23:55,400 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-02-21 03:23:55,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 443 states to 350 states and 496 transitions. [2022-02-21 03:23:55,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2022-02-21 03:23:55,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2022-02-21 03:23:55,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 496 transitions. [2022-02-21 03:23:55,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:55,412 INFO L681 BuchiCegarLoop]: Abstraction has 350 states and 496 transitions. [2022-02-21 03:23:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 496 transitions. [2022-02-21 03:23:55,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 315. [2022-02-21 03:23:55,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:55,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states and 496 transitions. Second operand has 315 states, 169 states have (on average 1.1005917159763314) internal successors, (186), 183 states have internal predecessors, (186), 100 states have call successors, (102), 49 states have call predecessors, (102), 46 states have return successors, (128), 82 states have call predecessors, (128), 84 states have call successors, (128) [2022-02-21 03:23:55,422 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states and 496 transitions. Second operand has 315 states, 169 states have (on average 1.1005917159763314) internal successors, (186), 183 states have internal predecessors, (186), 100 states have call successors, (102), 49 states have call predecessors, (102), 46 states have return successors, (128), 82 states have call predecessors, (128), 84 states have call successors, (128) [2022-02-21 03:23:55,423 INFO L87 Difference]: Start difference. First operand 350 states and 496 transitions. Second operand has 315 states, 169 states have (on average 1.1005917159763314) internal successors, (186), 183 states have internal predecessors, (186), 100 states have call successors, (102), 49 states have call predecessors, (102), 46 states have return successors, (128), 82 states have call predecessors, (128), 84 states have call successors, (128) [2022-02-21 03:23:55,423 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:55,484 INFO L93 Difference]: Finished difference Result 1322 states and 1993 transitions. [2022-02-21 03:23:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1993 transitions. [2022-02-21 03:23:55,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:55,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:55,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 315 states, 169 states have (on average 1.1005917159763314) internal successors, (186), 183 states have internal predecessors, (186), 100 states have call successors, (102), 49 states have call predecessors, (102), 46 states have return successors, (128), 82 states have call predecessors, (128), 84 states have call successors, (128) Second operand 350 states and 496 transitions. [2022-02-21 03:23:55,492 INFO L87 Difference]: Start difference. First operand has 315 states, 169 states have (on average 1.1005917159763314) internal successors, (186), 183 states have internal predecessors, (186), 100 states have call successors, (102), 49 states have call predecessors, (102), 46 states have return successors, (128), 82 states have call predecessors, (128), 84 states have call successors, (128) Second operand 350 states and 496 transitions. [2022-02-21 03:23:55,492 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:55,560 INFO L93 Difference]: Finished difference Result 1378 states and 2079 transitions. [2022-02-21 03:23:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2079 transitions. [2022-02-21 03:23:55,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:55,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:55,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:55,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 169 states have (on average 1.1005917159763314) internal successors, (186), 183 states have internal predecessors, (186), 100 states have call successors, (102), 49 states have call predecessors, (102), 46 states have return successors, (128), 82 states have call predecessors, (128), 84 states have call successors, (128) [2022-02-21 03:23:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 416 transitions. [2022-02-21 03:23:55,578 INFO L704 BuchiCegarLoop]: Abstraction has 315 states and 416 transitions. [2022-02-21 03:23:55,579 INFO L587 BuchiCegarLoop]: Abstraction has 315 states and 416 transitions. [2022-02-21 03:23:55,579 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:23:55,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 416 transitions. [2022-02-21 03:23:55,580 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-02-21 03:23:55,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:55,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:55,581 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:55,581 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:55,581 INFO L791 eck$LassoCheckResult]: Stem: 12903#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12904#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 12900#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 12929#rec2ENTRY ~j := #in~j; 12993#L18 assume !(~j <= 0); 12990#L20 call #t~ret3 := rec1(~j - 1);< 12991#rec1ENTRY ~i := #in~i; 13007#L12 assume !(~i <= 0); 13003#L14 call #t~ret0 := rec1(~i - 2);< 13006#rec1ENTRY ~i := #in~i; 13014#L12 assume ~i <= 0;#res := 0; 13041#rec1FINAL assume true; 13040#rec1EXIT >#28#return; 13033#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 13034#rec1ENTRY ~i := #in~i; 13038#L12 assume ~i <= 0;#res := 0; 13037#rec1FINAL assume true; 13032#rec1EXIT >#30#return; 13026#L14-2 call #t~ret2 := rec1(#t~ret1);< 13030#rec1ENTRY ~i := #in~i; 13036#L12 assume ~i <= 0;#res := 0; 13031#rec1FINAL assume true; 13029#rec1EXIT >#32#return; 13027#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 13063#rec1FINAL assume true; 13060#rec1EXIT >#34#return; 12974#L20-1 call #t~ret4 := rec2(#t~ret3);< 13087#rec2ENTRY ~j := #in~j; 13086#L18 assume !(~j <= 0); 13057#L20 call #t~ret3 := rec1(~j - 1);< 12977#rec1ENTRY ~i := #in~i; 13076#L12 assume !(~i <= 0); 12916#L14 call #t~ret0 := rec1(~i - 2);< 12932#rec1ENTRY [2022-02-21 03:23:55,582 INFO L793 eck$LassoCheckResult]: Loop: 12932#rec1ENTRY ~i := #in~i; 13096#L12 assume !(~i <= 0); 12914#L14 call #t~ret0 := rec1(~i - 2);< 12932#rec1ENTRY [2022-02-21 03:23:55,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:55,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1565705522, now seen corresponding path program 2 times [2022-02-21 03:23:55,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:55,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443378850] [2022-02-21 03:23:55,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:55,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:23:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:23:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17147#true} is VALID [2022-02-21 03:23:55,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {17147#true} assume true; {17147#true} is VALID [2022-02-21 03:23:55,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17147#true} {17147#true} #28#return; {17147#true} is VALID [2022-02-21 03:23:55,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:23:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17147#true} is VALID [2022-02-21 03:23:55,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {17147#true} assume true; {17147#true} is VALID [2022-02-21 03:23:55,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17147#true} {17147#true} #30#return; {17147#true} is VALID [2022-02-21 03:23:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:23:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17188#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:55,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {17188#(<= |rec1_#res| 0)} assume true; {17188#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:55,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17188#(<= |rec1_#res| 0)} {17147#true} #32#return; {17186#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:55,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {17147#true} assume !(~i <= 0); {17147#true} is VALID [2022-02-21 03:23:55,709 INFO L272 TraceCheckUtils]: 2: Hoare triple {17147#true} call #t~ret0 := rec1(~i - 2); {17147#true} is VALID [2022-02-21 03:23:55,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,709 INFO L290 TraceCheckUtils]: 4: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17147#true} is VALID [2022-02-21 03:23:55,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {17147#true} assume true; {17147#true} is VALID [2022-02-21 03:23:55,710 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {17147#true} {17147#true} #28#return; {17147#true} is VALID [2022-02-21 03:23:55,710 INFO L272 TraceCheckUtils]: 7: Hoare triple {17147#true} call #t~ret1 := rec1(#t~ret0 - 1); {17147#true} is VALID [2022-02-21 03:23:55,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17147#true} is VALID [2022-02-21 03:23:55,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {17147#true} assume true; {17147#true} is VALID [2022-02-21 03:23:55,712 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {17147#true} {17147#true} #30#return; {17147#true} is VALID [2022-02-21 03:23:55,714 INFO L272 TraceCheckUtils]: 12: Hoare triple {17147#true} call #t~ret2 := rec1(#t~ret1); {17147#true} is VALID [2022-02-21 03:23:55,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17188#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:55,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {17188#(<= |rec1_#res| 0)} assume true; {17188#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:55,715 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17188#(<= |rec1_#res| 0)} {17147#true} #32#return; {17186#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:55,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {17186#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {17187#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:55,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {17187#(<= |rec1_#res| 1)} assume true; {17187#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:55,717 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {17187#(<= |rec1_#res| 1)} {17147#true} #34#return; {17169#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:23:55,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {17147#true} assume { :begin_inline_ULTIMATE.init } true; {17147#true} is VALID [2022-02-21 03:23:55,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {17147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {17147#true} is VALID [2022-02-21 03:23:55,717 INFO L272 TraceCheckUtils]: 2: Hoare triple {17147#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {17147#true} is VALID [2022-02-21 03:23:55,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {17147#true} ~j := #in~j; {17147#true} is VALID [2022-02-21 03:23:55,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {17147#true} assume !(~j <= 0); {17147#true} is VALID [2022-02-21 03:23:55,717 INFO L272 TraceCheckUtils]: 5: Hoare triple {17147#true} call #t~ret3 := rec1(~j - 1); {17147#true} is VALID [2022-02-21 03:23:55,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {17147#true} assume !(~i <= 0); {17147#true} is VALID [2022-02-21 03:23:55,718 INFO L272 TraceCheckUtils]: 8: Hoare triple {17147#true} call #t~ret0 := rec1(~i - 2); {17147#true} is VALID [2022-02-21 03:23:55,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17147#true} is VALID [2022-02-21 03:23:55,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {17147#true} assume true; {17147#true} is VALID [2022-02-21 03:23:55,718 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17147#true} {17147#true} #28#return; {17147#true} is VALID [2022-02-21 03:23:55,718 INFO L272 TraceCheckUtils]: 13: Hoare triple {17147#true} call #t~ret1 := rec1(#t~ret0 - 1); {17147#true} is VALID [2022-02-21 03:23:55,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17147#true} is VALID [2022-02-21 03:23:55,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {17147#true} assume true; {17147#true} is VALID [2022-02-21 03:23:55,719 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17147#true} {17147#true} #30#return; {17147#true} is VALID [2022-02-21 03:23:55,719 INFO L272 TraceCheckUtils]: 18: Hoare triple {17147#true} call #t~ret2 := rec1(#t~ret1); {17147#true} is VALID [2022-02-21 03:23:55,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17188#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:55,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {17188#(<= |rec1_#res| 0)} assume true; {17188#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:55,720 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17188#(<= |rec1_#res| 0)} {17147#true} #32#return; {17186#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:55,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {17186#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {17187#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:55,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {17187#(<= |rec1_#res| 1)} assume true; {17187#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:55,721 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17187#(<= |rec1_#res| 1)} {17147#true} #34#return; {17169#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:23:55,723 INFO L272 TraceCheckUtils]: 26: Hoare triple {17169#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3); {17170#(<= |rec2_#in~j| 1)} is VALID [2022-02-21 03:23:55,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {17170#(<= |rec2_#in~j| 1)} ~j := #in~j; {17171#(<= rec2_~j 1)} is VALID [2022-02-21 03:23:55,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {17171#(<= rec2_~j 1)} assume !(~j <= 0); {17171#(<= rec2_~j 1)} is VALID [2022-02-21 03:23:55,724 INFO L272 TraceCheckUtils]: 29: Hoare triple {17171#(<= rec2_~j 1)} call #t~ret3 := rec1(~j - 1); {17172#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:55,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {17172#(<= |rec1_#in~i| 0)} ~i := #in~i; {17173#(<= rec1_~i 0)} is VALID [2022-02-21 03:23:55,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {17173#(<= rec1_~i 0)} assume !(~i <= 0); {17148#false} is VALID [2022-02-21 03:23:55,725 INFO L272 TraceCheckUtils]: 32: Hoare triple {17148#false} call #t~ret0 := rec1(~i - 2); {17148#false} is VALID [2022-02-21 03:23:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:23:55,725 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:55,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443378850] [2022-02-21 03:23:55,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443378850] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:55,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591030119] [2022-02-21 03:23:55,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:23:55,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:55,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:55,727 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:55,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-02-21 03:23:55,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:23:55,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:55,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:23:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:55,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:55,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {17147#true} assume { :begin_inline_ULTIMATE.init } true; {17147#true} is VALID [2022-02-21 03:23:55,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {17147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {17147#true} is VALID [2022-02-21 03:23:55,876 INFO L272 TraceCheckUtils]: 2: Hoare triple {17147#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {17147#true} is VALID [2022-02-21 03:23:55,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {17147#true} ~j := #in~j; {17147#true} is VALID [2022-02-21 03:23:55,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {17147#true} assume !(~j <= 0); {17147#true} is VALID [2022-02-21 03:23:55,877 INFO L272 TraceCheckUtils]: 5: Hoare triple {17147#true} call #t~ret3 := rec1(~j - 1); {17147#true} is VALID [2022-02-21 03:23:55,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {17147#true} assume !(~i <= 0); {17147#true} is VALID [2022-02-21 03:23:55,877 INFO L272 TraceCheckUtils]: 8: Hoare triple {17147#true} call #t~ret0 := rec1(~i - 2); {17147#true} is VALID [2022-02-21 03:23:55,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17147#true} is VALID [2022-02-21 03:23:55,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {17147#true} assume true; {17147#true} is VALID [2022-02-21 03:23:55,878 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17147#true} {17147#true} #28#return; {17147#true} is VALID [2022-02-21 03:23:55,878 INFO L272 TraceCheckUtils]: 13: Hoare triple {17147#true} call #t~ret1 := rec1(#t~ret0 - 1); {17147#true} is VALID [2022-02-21 03:23:55,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17147#true} is VALID [2022-02-21 03:23:55,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {17147#true} assume true; {17147#true} is VALID [2022-02-21 03:23:55,878 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17147#true} {17147#true} #30#return; {17147#true} is VALID [2022-02-21 03:23:55,878 INFO L272 TraceCheckUtils]: 18: Hoare triple {17147#true} call #t~ret2 := rec1(#t~ret1); {17147#true} is VALID [2022-02-21 03:23:55,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:55,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17188#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:55,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {17188#(<= |rec1_#res| 0)} assume true; {17188#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:55,880 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17188#(<= |rec1_#res| 0)} {17147#true} #32#return; {17186#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:55,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {17186#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {17187#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:55,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {17187#(<= |rec1_#res| 1)} assume true; {17187#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:55,881 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17187#(<= |rec1_#res| 1)} {17147#true} #34#return; {17169#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:23:55,881 INFO L272 TraceCheckUtils]: 26: Hoare triple {17169#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3); {17170#(<= |rec2_#in~j| 1)} is VALID [2022-02-21 03:23:55,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {17170#(<= |rec2_#in~j| 1)} ~j := #in~j; {17171#(<= rec2_~j 1)} is VALID [2022-02-21 03:23:55,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {17171#(<= rec2_~j 1)} assume !(~j <= 0); {17171#(<= rec2_~j 1)} is VALID [2022-02-21 03:23:55,882 INFO L272 TraceCheckUtils]: 29: Hoare triple {17171#(<= rec2_~j 1)} call #t~ret3 := rec1(~j - 1); {17172#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:55,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {17172#(<= |rec1_#in~i| 0)} ~i := #in~i; {17173#(<= rec1_~i 0)} is VALID [2022-02-21 03:23:55,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {17173#(<= rec1_~i 0)} assume !(~i <= 0); {17148#false} is VALID [2022-02-21 03:23:55,883 INFO L272 TraceCheckUtils]: 32: Hoare triple {17148#false} call #t~ret0 := rec1(~i - 2); {17148#false} is VALID [2022-02-21 03:23:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:23:55,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:56,152 INFO L272 TraceCheckUtils]: 32: Hoare triple {17148#false} call #t~ret0 := rec1(~i - 2); {17148#false} is VALID [2022-02-21 03:23:56,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {17173#(<= rec1_~i 0)} assume !(~i <= 0); {17148#false} is VALID [2022-02-21 03:23:56,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {17172#(<= |rec1_#in~i| 0)} ~i := #in~i; {17173#(<= rec1_~i 0)} is VALID [2022-02-21 03:23:56,153 INFO L272 TraceCheckUtils]: 29: Hoare triple {17171#(<= rec2_~j 1)} call #t~ret3 := rec1(~j - 1); {17172#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:23:56,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {17171#(<= rec2_~j 1)} assume !(~j <= 0); {17171#(<= rec2_~j 1)} is VALID [2022-02-21 03:23:56,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {17170#(<= |rec2_#in~j| 1)} ~j := #in~j; {17171#(<= rec2_~j 1)} is VALID [2022-02-21 03:23:56,154 INFO L272 TraceCheckUtils]: 26: Hoare triple {17169#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3); {17170#(<= |rec2_#in~j| 1)} is VALID [2022-02-21 03:23:56,155 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17187#(<= |rec1_#res| 1)} {17147#true} #34#return; {17169#(<= |rec2_#t~ret3| 1)} is VALID [2022-02-21 03:23:56,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {17187#(<= |rec1_#res| 1)} assume true; {17187#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:56,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {17186#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {17187#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:23:56,156 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17188#(<= |rec1_#res| 0)} {17147#true} #32#return; {17186#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:23:56,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {17188#(<= |rec1_#res| 0)} assume true; {17188#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:56,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17188#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:23:56,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:56,157 INFO L272 TraceCheckUtils]: 18: Hoare triple {17147#true} call #t~ret2 := rec1(#t~ret1); {17147#true} is VALID [2022-02-21 03:23:56,157 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17147#true} {17147#true} #30#return; {17147#true} is VALID [2022-02-21 03:23:56,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {17147#true} assume true; {17147#true} is VALID [2022-02-21 03:23:56,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17147#true} is VALID [2022-02-21 03:23:56,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:56,157 INFO L272 TraceCheckUtils]: 13: Hoare triple {17147#true} call #t~ret1 := rec1(#t~ret0 - 1); {17147#true} is VALID [2022-02-21 03:23:56,158 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17147#true} {17147#true} #28#return; {17147#true} is VALID [2022-02-21 03:23:56,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {17147#true} assume true; {17147#true} is VALID [2022-02-21 03:23:56,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {17147#true} assume ~i <= 0;#res := 0; {17147#true} is VALID [2022-02-21 03:23:56,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:56,158 INFO L272 TraceCheckUtils]: 8: Hoare triple {17147#true} call #t~ret0 := rec1(~i - 2); {17147#true} is VALID [2022-02-21 03:23:56,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {17147#true} assume !(~i <= 0); {17147#true} is VALID [2022-02-21 03:23:56,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {17147#true} ~i := #in~i; {17147#true} is VALID [2022-02-21 03:23:56,158 INFO L272 TraceCheckUtils]: 5: Hoare triple {17147#true} call #t~ret3 := rec1(~j - 1); {17147#true} is VALID [2022-02-21 03:23:56,159 INFO L290 TraceCheckUtils]: 4: Hoare triple {17147#true} assume !(~j <= 0); {17147#true} is VALID [2022-02-21 03:23:56,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {17147#true} ~j := #in~j; {17147#true} is VALID [2022-02-21 03:23:56,159 INFO L272 TraceCheckUtils]: 2: Hoare triple {17147#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {17147#true} is VALID [2022-02-21 03:23:56,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {17147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {17147#true} is VALID [2022-02-21 03:23:56,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {17147#true} assume { :begin_inline_ULTIMATE.init } true; {17147#true} is VALID [2022-02-21 03:23:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:23:56,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591030119] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:56,160 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:56,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2022-02-21 03:23:56,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130173718] [2022-02-21 03:23:56,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:56,162 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:56,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:56,163 INFO L85 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 3 times [2022-02-21 03:23:56,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:56,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531629287] [2022-02-21 03:23:56,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:56,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:56,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:56,167 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:56,204 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:56,204 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:56,205 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:56,205 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:56,205 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:56,205 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,205 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:56,205 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:56,205 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration6_Loop [2022-02-21 03:23:56,205 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:56,205 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:56,206 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:23:56,207 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:23:56,209 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:23:56,211 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:23:56,213 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:23:56,214 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:23:56,254 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:56,254 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:56,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,255 INFO L229 MonitoredProcess]: Starting monitored process 41 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:23:56,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:56,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:56,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:23:56,299 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:56,300 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:56,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:56,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,319 INFO L229 MonitoredProcess]: Starting monitored process 42 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:23:56,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:23:56,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:56,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:56,327 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:56,328 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:56,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:56,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,347 INFO L229 MonitoredProcess]: Starting monitored process 43 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:23:56,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:23:56,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:56,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:56,355 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:56,355 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:56,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:56,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,375 INFO L229 MonitoredProcess]: Starting monitored process 44 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:23:56,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:23:56,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:56,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:56,397 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:56,398 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:56,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:56,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,416 INFO L229 MonitoredProcess]: Starting monitored process 45 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:23:56,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:23:56,418 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:56,418 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:56,435 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:56,435 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:56,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:56,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,453 INFO L229 MonitoredProcess]: Starting monitored process 46 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:23:56,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:23:56,456 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:56,456 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:56,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:56,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,480 INFO L229 MonitoredProcess]: Starting monitored process 47 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:23:56,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:23:56,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:56,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:56,507 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:56,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 03:23:56,510 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:56,511 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:56,511 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:56,511 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:56,511 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:56,511 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,511 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:56,511 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:56,511 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration6_Loop [2022-02-21 03:23:56,511 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:56,511 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:56,512 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:23:56,514 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:23:56,516 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:23:56,517 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:23:56,519 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:23:56,525 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:23:56,583 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:56,583 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:56,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,593 INFO L229 MonitoredProcess]: Starting monitored process 48 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:23:56,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:23:56,595 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:23:56,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:56,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:56,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:56,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:56,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:56,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:56,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:56,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:56,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 03:23:56,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,619 INFO L229 MonitoredProcess]: Starting monitored process 49 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:23:56,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:23:56,622 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:23:56,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:56,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:56,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:56,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:56,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:56,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:56,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:56,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:56,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:56,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,652 INFO L229 MonitoredProcess]: Starting monitored process 50 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:23:56,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:23:56,655 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:23:56,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:56,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:56,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:56,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:56,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:56,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:56,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:56,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:56,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:56,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,679 INFO L229 MonitoredProcess]: Starting monitored process 51 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:23:56,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:23:56,681 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:23:56,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:56,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:56,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:56,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:56,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:56,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:56,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:56,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:56,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 03:23:56,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,705 INFO L229 MonitoredProcess]: Starting monitored process 52 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:23:56,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:23:56,708 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:23:56,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:56,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:56,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:56,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:56,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:56,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:56,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:56,715 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:56,718 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:23:56,718 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:23:56,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:56,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:56,720 INFO L229 MonitoredProcess]: Starting monitored process 53 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:23:56,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:23:56,722 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:56,722 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:56,722 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:56,722 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2022-02-21 03:23:56,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-02-21 03:23:56,741 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:56,747 INFO L390 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2022-02-21 03:23:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:56,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:56,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:23:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:56,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:56,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-02-21 03:23:57,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {17383#unseeded} assume { :begin_inline_ULTIMATE.init } true; {17383#unseeded} is VALID [2022-02-21 03:23:57,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {17383#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {17383#unseeded} is VALID [2022-02-21 03:23:57,097 INFO L272 TraceCheckUtils]: 2: Hoare triple {17383#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {17383#unseeded} is VALID [2022-02-21 03:23:57,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {17383#unseeded} ~j := #in~j; {17383#unseeded} is VALID [2022-02-21 03:23:57,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {17383#unseeded} assume !(~j <= 0); {17383#unseeded} is VALID [2022-02-21 03:23:57,098 INFO L272 TraceCheckUtils]: 5: Hoare triple {17383#unseeded} call #t~ret3 := rec1(~j - 1); {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,099 INFO L272 TraceCheckUtils]: 8: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,105 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,105 INFO L272 TraceCheckUtils]: 13: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,108 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,108 INFO L272 TraceCheckUtils]: 18: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,110 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,111 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17416#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {17383#unseeded} #34#return; {17383#unseeded} is VALID [2022-02-21 03:23:57,112 INFO L272 TraceCheckUtils]: 26: Hoare triple {17383#unseeded} call #t~ret4 := rec2(#t~ret3); {17383#unseeded} is VALID [2022-02-21 03:23:57,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {17383#unseeded} ~j := #in~j; {17383#unseeded} is VALID [2022-02-21 03:23:57,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {17383#unseeded} assume !(~j <= 0); {17383#unseeded} is VALID [2022-02-21 03:23:57,113 INFO L272 TraceCheckUtils]: 29: Hoare triple {17383#unseeded} call #t~ret3 := rec1(~j - 1); {17383#unseeded} is VALID [2022-02-21 03:23:57,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {17383#unseeded} ~i := #in~i; {17383#unseeded} is VALID [2022-02-21 03:23:57,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {17383#unseeded} assume !(~i <= 0); {17383#unseeded} is VALID [2022-02-21 03:23:57,114 INFO L272 TraceCheckUtils]: 32: Hoare triple {17383#unseeded} call #t~ret0 := rec1(~i - 2); {17383#unseeded} is VALID [2022-02-21 03:23:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:57,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:57,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:57,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {17386#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {17498#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:57,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {17498#(<= rec1_~i oldRank0)} assume !(~i <= 0); {17502#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:57,156 INFO L272 TraceCheckUtils]: 2: Hoare triple {17502#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {17396#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:57,156 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:23:57,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:57,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:57,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,184 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:57,184 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 315 states and 416 transitions. cyclomatic complexity: 114 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:57,292 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 315 states and 416 transitions. cyclomatic complexity: 114. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 349 states and 456 transitions. Complement of second has 14 states. [2022-02-21 03:23:57,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:57,293 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:57,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 416 transitions. cyclomatic complexity: 114 [2022-02-21 03:23:57,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:57,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:57,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:57,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:57,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:57,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:57,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 349 states and 456 transitions. [2022-02-21 03:23:57,295 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-02-21 03:23:57,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:57,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:57,296 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 315 states and 416 transitions. cyclomatic complexity: 114 [2022-02-21 03:23:57,299 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2022-02-21 03:23:57,299 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:57,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:57,300 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:57,300 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 349 states and 456 transitions. cyclomatic complexity: 120 [2022-02-21 03:23:57,303 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2022-02-21 03:23:57,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:57,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:57,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:57,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 349 letters. Loop has 349 letters. [2022-02-21 03:23:57,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 349 letters. Loop has 349 letters. [2022-02-21 03:23:57,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 349 letters. Loop has 349 letters. [2022-02-21 03:23:57,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 315 letters. Loop has 315 letters. [2022-02-21 03:23:57,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 315 letters. Loop has 315 letters. [2022-02-21 03:23:57,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 315 letters. Loop has 315 letters. [2022-02-21 03:23:57,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:57,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:57,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:57,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:57,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:57,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:57,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:57,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:57,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:57,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:57,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:57,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:57,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:57,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:57,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:57,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:57,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:57,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:57,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:57,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:57,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:57,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:57,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:57,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:57,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:57,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:57,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:57,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:57,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:57,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:57,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:57,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:57,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:57,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,338 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-21 03:23:57,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,339 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:23:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:57,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:23:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:57,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:57,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {17383#unseeded} assume { :begin_inline_ULTIMATE.init } true; {17383#unseeded} is VALID [2022-02-21 03:23:57,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {17383#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {17383#unseeded} is VALID [2022-02-21 03:23:57,659 INFO L272 TraceCheckUtils]: 2: Hoare triple {17383#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {17383#unseeded} is VALID [2022-02-21 03:23:57,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {17383#unseeded} ~j := #in~j; {17383#unseeded} is VALID [2022-02-21 03:23:57,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {17383#unseeded} assume !(~j <= 0); {17383#unseeded} is VALID [2022-02-21 03:23:57,660 INFO L272 TraceCheckUtils]: 5: Hoare triple {17383#unseeded} call #t~ret3 := rec1(~j - 1); {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,662 INFO L272 TraceCheckUtils]: 8: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,664 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,664 INFO L272 TraceCheckUtils]: 13: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,666 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,667 INFO L272 TraceCheckUtils]: 18: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,670 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:57,672 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17895#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {17383#unseeded} #34#return; {17383#unseeded} is VALID [2022-02-21 03:23:57,672 INFO L272 TraceCheckUtils]: 26: Hoare triple {17383#unseeded} call #t~ret4 := rec2(#t~ret3); {17383#unseeded} is VALID [2022-02-21 03:23:57,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {17383#unseeded} ~j := #in~j; {17383#unseeded} is VALID [2022-02-21 03:23:57,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {17383#unseeded} assume !(~j <= 0); {17383#unseeded} is VALID [2022-02-21 03:23:57,673 INFO L272 TraceCheckUtils]: 29: Hoare triple {17383#unseeded} call #t~ret3 := rec1(~j - 1); {17383#unseeded} is VALID [2022-02-21 03:23:57,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {17383#unseeded} ~i := #in~i; {17383#unseeded} is VALID [2022-02-21 03:23:57,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {17383#unseeded} assume !(~i <= 0); {17383#unseeded} is VALID [2022-02-21 03:23:57,674 INFO L272 TraceCheckUtils]: 32: Hoare triple {17383#unseeded} call #t~ret0 := rec1(~i - 2); {17383#unseeded} is VALID [2022-02-21 03:23:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:57,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:57,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:57,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {17386#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {17977#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:57,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {17977#(<= rec1_~i oldRank0)} assume !(~i <= 0); {17981#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:57,719 INFO L272 TraceCheckUtils]: 2: Hoare triple {17981#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {17396#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:57,719 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:23:57,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:57,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:57,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,746 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:57,746 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 315 states and 416 transitions. cyclomatic complexity: 114 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:57,834 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 315 states and 416 transitions. cyclomatic complexity: 114. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 349 states and 456 transitions. Complement of second has 14 states. [2022-02-21 03:23:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:57,835 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:57,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 416 transitions. cyclomatic complexity: 114 [2022-02-21 03:23:57,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:57,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:57,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:57,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:57,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:57,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:57,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 349 states and 456 transitions. [2022-02-21 03:23:57,838 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-02-21 03:23:57,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:57,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:57,838 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 315 states and 416 transitions. cyclomatic complexity: 114 [2022-02-21 03:23:57,838 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2022-02-21 03:23:57,839 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:57,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:57,839 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:57,839 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 349 states and 456 transitions. cyclomatic complexity: 120 [2022-02-21 03:23:57,841 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2022-02-21 03:23:57,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:57,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:57,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:57,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 349 letters. Loop has 349 letters. [2022-02-21 03:23:57,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 349 letters. Loop has 349 letters. [2022-02-21 03:23:57,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 349 letters. Loop has 349 letters. [2022-02-21 03:23:57,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 315 letters. Loop has 315 letters. [2022-02-21 03:23:57,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 315 letters. Loop has 315 letters. [2022-02-21 03:23:57,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 315 letters. Loop has 315 letters. [2022-02-21 03:23:57,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:57,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:57,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:57,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:57,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:57,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:57,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:57,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:57,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:57,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:57,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:57,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:57,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:57,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:57,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:57,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:57,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:57,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:57,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:57,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:57,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:57,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 30 letters. Loop has 3 letters. [2022-02-21 03:23:57,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:57,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:57,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:23:57,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:57,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:57,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:23:57,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:57,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:57,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:57,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:57,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:57,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:57,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:57,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:57,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:57,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:57,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:57,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 349 states and 456 transitions. cyclomatic complexity: 120 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:57,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,875 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-21 03:23:57,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:57,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:57,876 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:23:57,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:57,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:23:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:57,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:58,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {17383#unseeded} assume { :begin_inline_ULTIMATE.init } true; {17383#unseeded} is VALID [2022-02-21 03:23:58,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {17383#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {17383#unseeded} is VALID [2022-02-21 03:23:58,192 INFO L272 TraceCheckUtils]: 2: Hoare triple {17383#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {17383#unseeded} is VALID [2022-02-21 03:23:58,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {17383#unseeded} ~j := #in~j; {17383#unseeded} is VALID [2022-02-21 03:23:58,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {17383#unseeded} assume !(~j <= 0); {17383#unseeded} is VALID [2022-02-21 03:23:58,193 INFO L272 TraceCheckUtils]: 5: Hoare triple {17383#unseeded} call #t~ret3 := rec1(~j - 1); {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,195 INFO L272 TraceCheckUtils]: 8: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,197 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,198 INFO L272 TraceCheckUtils]: 13: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,200 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,201 INFO L272 TraceCheckUtils]: 18: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,203 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:58,204 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {18374#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {17383#unseeded} #34#return; {17383#unseeded} is VALID [2022-02-21 03:23:58,205 INFO L272 TraceCheckUtils]: 26: Hoare triple {17383#unseeded} call #t~ret4 := rec2(#t~ret3); {17383#unseeded} is VALID [2022-02-21 03:23:58,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {17383#unseeded} ~j := #in~j; {17383#unseeded} is VALID [2022-02-21 03:23:58,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {17383#unseeded} assume !(~j <= 0); {17383#unseeded} is VALID [2022-02-21 03:23:58,206 INFO L272 TraceCheckUtils]: 29: Hoare triple {17383#unseeded} call #t~ret3 := rec1(~j - 1); {17383#unseeded} is VALID [2022-02-21 03:23:58,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {17383#unseeded} ~i := #in~i; {17383#unseeded} is VALID [2022-02-21 03:23:58,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {17383#unseeded} assume !(~i <= 0); {17383#unseeded} is VALID [2022-02-21 03:23:58,207 INFO L272 TraceCheckUtils]: 32: Hoare triple {17383#unseeded} call #t~ret0 := rec1(~i - 2); {17383#unseeded} is VALID [2022-02-21 03:23:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:58,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:58,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:58,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {17386#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {18456#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:23:58,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {18456#(<= rec1_~i oldRank0)} assume !(~i <= 0); {18460#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} is VALID [2022-02-21 03:23:58,254 INFO L272 TraceCheckUtils]: 2: Hoare triple {18460#(and (not (<= rec1_~i 0)) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {17396#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:23:58,254 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:23:58,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:58,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:58,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:58,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,281 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:58,281 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 315 states and 416 transitions. cyclomatic complexity: 114 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:58,411 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 315 states and 416 transitions. cyclomatic complexity: 114. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 486 states and 617 transitions. Complement of second has 16 states. [2022-02-21 03:23:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:58,412 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:58,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 416 transitions. cyclomatic complexity: 114 [2022-02-21 03:23:58,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:58,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:58,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:58,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:58,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:58,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:58,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 486 states and 617 transitions. [2022-02-21 03:23:58,415 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2022-02-21 03:23:58,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:58,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:58,415 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 315 states and 416 transitions. cyclomatic complexity: 114 [2022-02-21 03:23:58,416 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2022-02-21 03:23:58,416 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:58,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:58,428 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:58,428 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 486 states and 617 transitions. cyclomatic complexity: 144 [2022-02-21 03:23:58,431 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 25 examples of accepted words. [2022-02-21 03:23:58,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:58,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:58,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:58,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:58,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:58,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:58,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:23:58,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:23:58,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:23:58,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 486 letters. Loop has 486 letters. [2022-02-21 03:23:58,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 486 letters. Loop has 486 letters. [2022-02-21 03:23:58,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 486 letters. Loop has 486 letters. [2022-02-21 03:23:58,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 315 letters. Loop has 315 letters. [2022-02-21 03:23:58,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 315 letters. Loop has 315 letters. [2022-02-21 03:23:58,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 315 letters. Loop has 315 letters. [2022-02-21 03:23:58,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:58,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:58,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:58,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:58,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:58,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:58,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:58,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:58,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:58,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:58,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:58,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:58,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:58,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:58,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:58,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:58,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:58,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:58,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:58,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:58,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:58,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:58,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:58,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:58,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:58,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:58,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:58,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:58,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:58,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:58,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:58,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:58,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:58,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:58,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:58,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:58,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:58,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:58,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:58,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:58,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:58,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:58,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:58,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:58,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:58,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:58,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:58,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:58,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:58,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:58,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:58,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:58,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:58,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:58,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:58,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:58,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:58,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 39 letters. Loop has 24 letters. [2022-02-21 03:23:58,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 39 letters. Loop has 24 letters. [2022-02-21 03:23:58,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 39 letters. Loop has 24 letters. [2022-02-21 03:23:58,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 38 letters. Loop has 24 letters. [2022-02-21 03:23:58,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 38 letters. Loop has 24 letters. [2022-02-21 03:23:58,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 38 letters. Loop has 24 letters. [2022-02-21 03:23:58,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:58,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:58,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:58,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:23:58,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:23:58,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:23:58,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 30 letters. [2022-02-21 03:23:58,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 30 letters. [2022-02-21 03:23:58,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 40 letters. Loop has 30 letters. [2022-02-21 03:23:58,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:58,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:58,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 61 letters. Loop has 45 letters. [2022-02-21 03:23:58,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 27 letters. [2022-02-21 03:23:58,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 27 letters. [2022-02-21 03:23:58,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 40 letters. Loop has 27 letters. [2022-02-21 03:23:58,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 40 letters. Loop has 24 letters. [2022-02-21 03:23:58,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 36 letters. Loop has 27 letters. [2022-02-21 03:23:58,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 36 letters. Loop has 27 letters. [2022-02-21 03:23:58,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 36 letters. Loop has 27 letters. [2022-02-21 03:23:58,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:58,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:58,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:58,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:58,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:58,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:58,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 33 letters. Loop has 24 letters. [2022-02-21 03:23:58,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 33 letters. Loop has 24 letters. [2022-02-21 03:23:58,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 33 letters. Loop has 24 letters. [2022-02-21 03:23:58,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 34 letters. Loop has 24 letters. [2022-02-21 03:23:58,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 34 letters. Loop has 24 letters. [2022-02-21 03:23:58,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 34 letters. Loop has 24 letters. [2022-02-21 03:23:58,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 35 letters. Loop has 24 letters. [2022-02-21 03:23:58,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 35 letters. Loop has 24 letters. [2022-02-21 03:23:58,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 35 letters. Loop has 24 letters. [2022-02-21 03:23:58,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:23:58,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:23:58,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:23:58,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:58,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:58,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:23:58,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 30 letters. [2022-02-21 03:23:58,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 30 letters. [2022-02-21 03:23:58,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 32 letters. Loop has 30 letters. [2022-02-21 03:23:58,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:58,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:58,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:23:58,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:58,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:58,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:58,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:58,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:58,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 147 letters. Loop has 72 letters. [2022-02-21 03:23:58,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:58,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:58,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 148 letters. Loop has 72 letters. [2022-02-21 03:23:58,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:58,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:58,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 149 letters. Loop has 72 letters. [2022-02-21 03:23:58,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 315 states and 416 transitions. cyclomatic complexity: 114 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:58,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:58,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 486 states and 617 transitions. cyclomatic complexity: 144 Stem has 146 letters. Loop has 72 letters. [2022-02-21 03:23:58,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,473 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:23:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-21 03:23:58,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:23:58,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 36 letters. Loop has 3 letters. [2022-02-21 03:23:58,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 33 letters. Loop has 6 letters. [2022-02-21 03:23:58,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:58,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 486 states and 617 transitions. cyclomatic complexity: 144 [2022-02-21 03:23:58,485 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2022-02-21 03:23:58,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 486 states to 396 states and 527 transitions. [2022-02-21 03:23:58,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2022-02-21 03:23:58,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-02-21 03:23:58,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 396 states and 527 transitions. [2022-02-21 03:23:58,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:58,496 INFO L681 BuchiCegarLoop]: Abstraction has 396 states and 527 transitions. [2022-02-21 03:23:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states and 527 transitions. [2022-02-21 03:23:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 352. [2022-02-21 03:23:58,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:58,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states and 527 transitions. Second operand has 352 states, 196 states have (on average 1.1275510204081634) internal successors, (221), 212 states have internal predecessors, (221), 102 states have call successors, (104), 57 states have call predecessors, (104), 54 states have return successors, (132), 82 states have call predecessors, (132), 86 states have call successors, (132) [2022-02-21 03:23:58,502 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states and 527 transitions. Second operand has 352 states, 196 states have (on average 1.1275510204081634) internal successors, (221), 212 states have internal predecessors, (221), 102 states have call successors, (104), 57 states have call predecessors, (104), 54 states have return successors, (132), 82 states have call predecessors, (132), 86 states have call successors, (132) [2022-02-21 03:23:58,503 INFO L87 Difference]: Start difference. First operand 396 states and 527 transitions. Second operand has 352 states, 196 states have (on average 1.1275510204081634) internal successors, (221), 212 states have internal predecessors, (221), 102 states have call successors, (104), 57 states have call predecessors, (104), 54 states have return successors, (132), 82 states have call predecessors, (132), 86 states have call successors, (132) [2022-02-21 03:23:58,503 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:58,559 INFO L93 Difference]: Finished difference Result 1230 states and 1778 transitions. [2022-02-21 03:23:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1778 transitions. [2022-02-21 03:23:58,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:58,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:58,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 352 states, 196 states have (on average 1.1275510204081634) internal successors, (221), 212 states have internal predecessors, (221), 102 states have call successors, (104), 57 states have call predecessors, (104), 54 states have return successors, (132), 82 states have call predecessors, (132), 86 states have call successors, (132) Second operand 396 states and 527 transitions. [2022-02-21 03:23:58,566 INFO L87 Difference]: Start difference. First operand has 352 states, 196 states have (on average 1.1275510204081634) internal successors, (221), 212 states have internal predecessors, (221), 102 states have call successors, (104), 57 states have call predecessors, (104), 54 states have return successors, (132), 82 states have call predecessors, (132), 86 states have call successors, (132) Second operand 396 states and 527 transitions. [2022-02-21 03:23:58,567 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:58,641 INFO L93 Difference]: Finished difference Result 1420 states and 2070 transitions. [2022-02-21 03:23:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2070 transitions. [2022-02-21 03:23:58,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:58,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:58,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:58,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 196 states have (on average 1.1275510204081634) internal successors, (221), 212 states have internal predecessors, (221), 102 states have call successors, (104), 57 states have call predecessors, (104), 54 states have return successors, (132), 82 states have call predecessors, (132), 86 states have call successors, (132) [2022-02-21 03:23:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 457 transitions. [2022-02-21 03:23:58,656 INFO L704 BuchiCegarLoop]: Abstraction has 352 states and 457 transitions. [2022-02-21 03:23:58,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:58,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:23:58,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:23:58,658 INFO L87 Difference]: Start difference. First operand 352 states and 457 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:23:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:58,872 INFO L93 Difference]: Finished difference Result 379 states and 514 transitions. [2022-02-21 03:23:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:23:58,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:23:58,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:58,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 514 transitions. [2022-02-21 03:23:58,901 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 03:23:58,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 105 states and 143 transitions. [2022-02-21 03:23:58,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2022-02-21 03:23:58,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2022-02-21 03:23:58,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2022-02-21 03:23:58,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:58,904 INFO L681 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2022-02-21 03:23:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2022-02-21 03:23:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-02-21 03:23:58,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:58,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states and 143 transitions. Second operand has 87 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 54 states have internal predecessors, (57), 22 states have call successors, (22), 15 states have call predecessors, (22), 14 states have return successors, (28), 17 states have call predecessors, (28), 20 states have call successors, (28) [2022-02-21 03:23:58,907 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states and 143 transitions. Second operand has 87 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 54 states have internal predecessors, (57), 22 states have call successors, (22), 15 states have call predecessors, (22), 14 states have return successors, (28), 17 states have call predecessors, (28), 20 states have call successors, (28) [2022-02-21 03:23:58,907 INFO L87 Difference]: Start difference. First operand 105 states and 143 transitions. Second operand has 87 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 54 states have internal predecessors, (57), 22 states have call successors, (22), 15 states have call predecessors, (22), 14 states have return successors, (28), 17 states have call predecessors, (28), 20 states have call successors, (28) [2022-02-21 03:23:58,907 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:58,914 INFO L93 Difference]: Finished difference Result 267 states and 407 transitions. [2022-02-21 03:23:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 407 transitions. [2022-02-21 03:23:58,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:58,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:58,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 54 states have internal predecessors, (57), 22 states have call successors, (22), 15 states have call predecessors, (22), 14 states have return successors, (28), 17 states have call predecessors, (28), 20 states have call successors, (28) Second operand 105 states and 143 transitions. [2022-02-21 03:23:58,931 INFO L87 Difference]: Start difference. First operand has 87 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 54 states have internal predecessors, (57), 22 states have call successors, (22), 15 states have call predecessors, (22), 14 states have return successors, (28), 17 states have call predecessors, (28), 20 states have call successors, (28) Second operand 105 states and 143 transitions. [2022-02-21 03:23:58,931 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:58,940 INFO L93 Difference]: Finished difference Result 314 states and 481 transitions. [2022-02-21 03:23:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 481 transitions. [2022-02-21 03:23:58,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:58,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:58,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:58,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 54 states have internal predecessors, (57), 22 states have call successors, (22), 15 states have call predecessors, (22), 14 states have return successors, (28), 17 states have call predecessors, (28), 20 states have call successors, (28) [2022-02-21 03:23:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2022-02-21 03:23:58,943 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 107 transitions. [2022-02-21 03:23:58,943 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 107 transitions. [2022-02-21 03:23:58,943 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:23:58,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 107 transitions. [2022-02-21 03:23:58,944 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 03:23:58,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:58,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:58,944 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:58,945 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:58,945 INFO L791 eck$LassoCheckResult]: Stem: 23603#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 23604#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 23602#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 23614#rec2ENTRY ~j := #in~j; 23665#L18 assume !(~j <= 0); 23662#L20 call #t~ret3 := rec1(~j - 1);< 23664#rec1ENTRY ~i := #in~i; 23663#L12 assume !(~i <= 0); 23632#L14 call #t~ret0 := rec1(~i - 2);< 23638#rec1ENTRY ~i := #in~i; 23635#L12 assume !(~i <= 0); 23631#L14 [2022-02-21 03:23:58,945 INFO L793 eck$LassoCheckResult]: Loop: 23631#L14 call #t~ret0 := rec1(~i - 2);< 23633#rec1ENTRY ~i := #in~i; 23635#L12 assume !(~i <= 0); 23631#L14 [2022-02-21 03:23:58,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1203085824, now seen corresponding path program 3 times [2022-02-21 03:23:58,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:58,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194288625] [2022-02-21 03:23:58,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:58,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:58,949 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:58,951 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:58,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:58,952 INFO L85 PathProgramCache]: Analyzing trace with hash 55742, now seen corresponding path program 4 times [2022-02-21 03:23:58,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:58,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873749421] [2022-02-21 03:23:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:58,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:58,954 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:58,955 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:58,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash 372328287, now seen corresponding path program 4 times [2022-02-21 03:23:58,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:58,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109255114] [2022-02-21 03:23:58,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:58,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:58,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:58,964 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:59,004 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:59,004 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:59,005 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:59,005 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:59,005 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:59,005 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:59,005 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:59,005 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:59,005 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration7_Loop [2022-02-21 03:23:59,005 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:59,005 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:59,006 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:23:59,008 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:23:59,010 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:23:59,011 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:23:59,016 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:23:59,061 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:59,061 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:59,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:59,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:59,073 INFO L229 MonitoredProcess]: Starting monitored process 54 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:23:59,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:23:59,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:59,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:59,095 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:59,095 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:59,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:59,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:59,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:59,129 INFO L229 MonitoredProcess]: Starting monitored process 55 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:23:59,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 03:23:59,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:59,132 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:59,159 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:59,160 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:59,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-02-21 03:23:59,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:59,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:59,177 INFO L229 MonitoredProcess]: Starting monitored process 56 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:23:59,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 03:23:59,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:59,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:59,186 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:59,186 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:59,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-02-21 03:23:59,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:59,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:59,213 INFO L229 MonitoredProcess]: Starting monitored process 57 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:23:59,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 03:23:59,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:59,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:59,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:59,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:59,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:59,248 INFO L229 MonitoredProcess]: Starting monitored process 58 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:23:59,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 03:23:59,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:59,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:03,958 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:03,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:03,962 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:03,963 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:03,963 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:03,963 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:03,963 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:03,963 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:03,963 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:03,963 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:03,963 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration7_Loop [2022-02-21 03:24:03,963 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:03,963 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:03,963 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:24:03,971 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:24:03,972 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:24:03,975 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:24:03,976 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:24:04,030 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:04,030 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:04,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:04,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:04,044 INFO L229 MonitoredProcess]: Starting monitored process 59 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:24:04,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 03:24:04,048 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:24:04,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:04,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:04,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:04,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:04,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:04,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:04,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:04,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:04,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:04,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:04,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:04,112 INFO L229 MonitoredProcess]: Starting monitored process 60 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:24:04,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 03:24:04,114 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:24:04,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:04,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:04,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:04,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:04,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:04,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:04,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:04,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:04,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-02-21 03:24:04,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:04,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:04,160 INFO L229 MonitoredProcess]: Starting monitored process 61 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:24:04,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 03:24:04,162 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:24:04,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:04,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:04,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:04,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:04,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:04,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:04,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:04,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:04,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-02-21 03:24:04,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:04,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:04,186 INFO L229 MonitoredProcess]: Starting monitored process 62 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:24:04,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 03:24:04,188 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:24:04,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:04,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:04,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:04,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:04,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:04,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:04,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:04,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:04,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-02-21 03:24:04,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:04,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:04,227 INFO L229 MonitoredProcess]: Starting monitored process 63 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:24:04,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 03:24:04,229 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:24:04,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:04,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:04,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:04,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:04,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:04,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:04,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:04,251 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:04,253 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:04,253 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:04,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:04,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:04,254 INFO L229 MonitoredProcess]: Starting monitored process 64 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:24:04,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 03:24:04,257 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:04,257 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:04,257 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:04,257 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_~i) = 1*rec1_~i Supporting invariants [] [2022-02-21 03:24:04,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-02-21 03:24:04,277 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:04,278 INFO L390 LassoCheck]: Loop: "call #t~ret0 := rec1(~i - 2);"< "~i := #in~i;" "assume !(~i <= 0);" [2022-02-21 03:24:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:24:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:04,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {24824#unseeded} assume { :begin_inline_ULTIMATE.init } true; {24824#unseeded} is VALID [2022-02-21 03:24:04,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {24824#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {24824#unseeded} is VALID [2022-02-21 03:24:04,325 INFO L272 TraceCheckUtils]: 2: Hoare triple {24824#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {24824#unseeded} is VALID [2022-02-21 03:24:04,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {24824#unseeded} ~j := #in~j; {24824#unseeded} is VALID [2022-02-21 03:24:04,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {24824#unseeded} assume !(~j <= 0); {24824#unseeded} is VALID [2022-02-21 03:24:04,325 INFO L272 TraceCheckUtils]: 5: Hoare triple {24824#unseeded} call #t~ret3 := rec1(~j - 1); {24824#unseeded} is VALID [2022-02-21 03:24:04,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {24824#unseeded} ~i := #in~i; {24824#unseeded} is VALID [2022-02-21 03:24:04,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {24824#unseeded} assume !(~i <= 0); {24824#unseeded} is VALID [2022-02-21 03:24:04,326 INFO L272 TraceCheckUtils]: 8: Hoare triple {24824#unseeded} call #t~ret0 := rec1(~i - 2); {24824#unseeded} is VALID [2022-02-21 03:24:04,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {24824#unseeded} ~i := #in~i; {24824#unseeded} is VALID [2022-02-21 03:24:04,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {24824#unseeded} assume !(~i <= 0); {24824#unseeded} is VALID [2022-02-21 03:24:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:24:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:04,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {24827#(>= oldRank0 rec1_~i)} call #t~ret0 := rec1(~i - 2); {24872#(<= (+ 2 |rec1_#in~i|) oldRank0)} is VALID [2022-02-21 03:24:04,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {24872#(<= (+ 2 |rec1_#in~i|) oldRank0)} ~i := #in~i; {24876#(<= (+ 2 rec1_~i) oldRank0)} is VALID [2022-02-21 03:24:04,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {24876#(<= (+ 2 rec1_~i) oldRank0)} assume !(~i <= 0); {24837#(or (and (>= oldRank0 0) (> oldRank0 rec1_~i)) unseeded)} is VALID [2022-02-21 03:24:04,366 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:24:04,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:04,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:04,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:04,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,373 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:24:04,373 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 107 transitions. cyclomatic complexity: 23 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:04,409 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 107 transitions. cyclomatic complexity: 23. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 101 states and 125 transitions. Complement of second has 11 states. [2022-02-21 03:24:04,409 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:24:04,409 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:04,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 107 transitions. cyclomatic complexity: 23 [2022-02-21 03:24:04,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:04,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:04,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:04,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:04,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:04,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:04,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 125 transitions. [2022-02-21 03:24:04,410 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 03:24:04,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:04,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:04,411 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 87 states and 107 transitions. cyclomatic complexity: 23 [2022-02-21 03:24:04,413 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 23 examples of accepted words. [2022-02-21 03:24:04,414 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:04,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:04,414 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:04,414 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 101 states and 125 transitions. cyclomatic complexity: 28 [2022-02-21 03:24:04,417 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 23 examples of accepted words. [2022-02-21 03:24:04,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:04,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:04,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:04,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:04,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 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:24:04,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:04,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:04,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:04,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:04,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 101 letters. Loop has 101 letters. [2022-02-21 03:24:04,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 101 letters. Loop has 101 letters. [2022-02-21 03:24:04,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 101 letters. Loop has 101 letters. [2022-02-21 03:24:04,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 87 letters. Loop has 87 letters. [2022-02-21 03:24:04,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 87 letters. [2022-02-21 03:24:04,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 87 letters. Loop has 87 letters. [2022-02-21 03:24:04,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:04,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 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:24:04,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:04,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:04,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:04,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:04,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:04,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:04,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:04,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:04,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:04,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:04,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:04,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:04,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:04,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:04,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:04,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:04,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:04,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:04,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:04,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:04,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:04,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:04,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:04,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:04,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:04,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:04,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:04,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:04,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:04,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:04,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:04,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:04,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:04,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:04,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:04,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:04,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:04,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:04,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:04,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:04,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:04,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:04,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:04,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:04,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:04,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 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:24:04,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:04,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:04,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:04,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:04,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:04,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:04,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:04,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:04,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:04,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:04,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:04,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:04,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:04,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:04,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:04,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:04,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:04,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:04,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:04,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:04,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:04,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:04,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:04,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:04,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:04,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:04,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:04,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:04,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:04,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:04,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:04,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:04,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:04,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:04,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:04,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:04,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:04,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:04,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:04,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:04,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:04,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:04,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:04,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:04,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:04,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:04,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:04,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:04,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:04,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:04,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:04,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 107 transitions. cyclomatic complexity: 23 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:04,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:04,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 125 transitions. cyclomatic complexity: 28 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:04,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,482 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-02-21 03:24:04,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:04,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:04,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:04,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:04,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 125 transitions. cyclomatic complexity: 28 [2022-02-21 03:24:04,486 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 03:24:04,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 95 states and 118 transitions. [2022-02-21 03:24:04,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2022-02-21 03:24:04,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2022-02-21 03:24:04,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 118 transitions. [2022-02-21 03:24:04,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:04,488 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 118 transitions. [2022-02-21 03:24:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 118 transitions. [2022-02-21 03:24:04,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2022-02-21 03:24:04,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:04,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states and 118 transitions. Second operand has 93 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 23 states have call successors, (24), 16 states have call predecessors, (24), 15 states have return successors, (30), 17 states have call predecessors, (30), 21 states have call successors, (30) [2022-02-21 03:24:04,490 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states and 118 transitions. Second operand has 93 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 23 states have call successors, (24), 16 states have call predecessors, (24), 15 states have return successors, (30), 17 states have call predecessors, (30), 21 states have call successors, (30) [2022-02-21 03:24:04,491 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 93 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 23 states have call successors, (24), 16 states have call predecessors, (24), 15 states have return successors, (30), 17 states have call predecessors, (30), 21 states have call successors, (30) [2022-02-21 03:24:04,495 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:04,502 INFO L93 Difference]: Finished difference Result 228 states and 336 transitions. [2022-02-21 03:24:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 336 transitions. [2022-02-21 03:24:04,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:04,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:04,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 23 states have call successors, (24), 16 states have call predecessors, (24), 15 states have return successors, (30), 17 states have call predecessors, (30), 21 states have call successors, (30) Second operand 95 states and 118 transitions. [2022-02-21 03:24:04,504 INFO L87 Difference]: Start difference. First operand has 93 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 23 states have call successors, (24), 16 states have call predecessors, (24), 15 states have return successors, (30), 17 states have call predecessors, (30), 21 states have call successors, (30) Second operand 95 states and 118 transitions. [2022-02-21 03:24:04,504 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:04,511 INFO L93 Difference]: Finished difference Result 232 states and 339 transitions. [2022-02-21 03:24:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 339 transitions. [2022-02-21 03:24:04,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:04,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:04,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:04,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 23 states have call successors, (24), 16 states have call predecessors, (24), 15 states have return successors, (30), 17 states have call predecessors, (30), 21 states have call successors, (30) [2022-02-21 03:24:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2022-02-21 03:24:04,514 INFO L704 BuchiCegarLoop]: Abstraction has 93 states and 115 transitions. [2022-02-21 03:24:04,514 INFO L587 BuchiCegarLoop]: Abstraction has 93 states and 115 transitions. [2022-02-21 03:24:04,514 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:24:04,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 115 transitions. [2022-02-21 03:24:04,515 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 03:24:04,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:04,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:04,516 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:24:04,516 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-02-21 03:24:04,516 INFO L791 eck$LassoCheckResult]: Stem: 25000#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 25001#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 24998#L25 call main_#t~ret6#1 := rec2(main_~x~0#1);< 25011#rec2ENTRY ~j := #in~j; 25021#L18 assume !(~j <= 0); 25022#L20 call #t~ret3 := rec1(~j - 1);< 25053#rec1ENTRY ~i := #in~i; 25054#L12 assume !(~i <= 0); 25045#L14 call #t~ret0 := rec1(~i - 2);< 25051#rec1ENTRY ~i := #in~i; 25089#L12 assume !(~i <= 0); 25024#L14 call #t~ret0 := rec1(~i - 2);< 25032#rec1ENTRY ~i := #in~i; 25023#L12 assume ~i <= 0;#res := 0; 25025#rec1FINAL assume true; 25057#rec1EXIT >#28#return; 25056#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 25071#rec1ENTRY ~i := #in~i; 25079#L12 assume ~i <= 0;#res := 0; 25078#rec1FINAL assume true; 25070#rec1EXIT >#30#return; 25067#L14-2 call #t~ret2 := rec1(#t~ret1);< 25069#rec1ENTRY ~i := #in~i; 25083#L12 assume ~i <= 0;#res := 0; 25081#rec1FINAL assume true; 25066#rec1EXIT >#32#return; 25047#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 25062#rec1FINAL assume true; 25040#rec1EXIT >#28#return; 25041#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 25048#rec1ENTRY [2022-02-21 03:24:04,516 INFO L793 eck$LassoCheckResult]: Loop: 25048#rec1ENTRY ~i := #in~i; 25064#L12 assume !(~i <= 0); 25027#L14 call #t~ret0 := rec1(~i - 2);< 25063#rec1ENTRY ~i := #in~i; 25026#L12 assume !(~i <= 0); 25017#L14 call #t~ret0 := rec1(~i - 2);< 25033#rec1ENTRY ~i := #in~i; 25034#L12 assume ~i <= 0;#res := 0; 25016#rec1FINAL assume true; 25018#rec1EXIT >#28#return; 25056#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 25071#rec1ENTRY ~i := #in~i; 25079#L12 assume ~i <= 0;#res := 0; 25078#rec1FINAL assume true; 25070#rec1EXIT >#30#return; 25067#L14-2 call #t~ret2 := rec1(#t~ret1);< 25069#rec1ENTRY ~i := #in~i; 25083#L12 assume ~i <= 0;#res := 0; 25081#rec1FINAL assume true; 25066#rec1EXIT >#32#return; 25047#L14-3 #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; 25062#rec1FINAL assume true; 25040#rec1EXIT >#28#return; 25042#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 25048#rec1ENTRY [2022-02-21 03:24:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:04,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1060897207, now seen corresponding path program 1 times [2022-02-21 03:24:04,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:04,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766871260] [2022-02-21 03:24:04,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:04,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:04,525 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:04,534 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:04,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash 245881341, now seen corresponding path program 1 times [2022-02-21 03:24:04,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:04,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44422403] [2022-02-21 03:24:04,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:04,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:04,542 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:04,545 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:04,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2071488077, now seen corresponding path program 2 times [2022-02-21 03:24:04,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:04,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217708193] [2022-02-21 03:24:04,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 03:24:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:24:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26031#true} {26031#true} #28#return; {26031#true} is VALID [2022-02-21 03:24:04,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:24:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26031#true} {26031#true} #30#return; {26031#true} is VALID [2022-02-21 03:24:04,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:24:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:04,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26090#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:24:04,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {26090#(<= |rec1_#res| 0)} assume true; {26090#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:24:04,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26090#(<= |rec1_#res| 0)} {26031#true} #32#return; {26088#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:24:04,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {26031#true} assume !(~i <= 0); {26031#true} is VALID [2022-02-21 03:24:04,647 INFO L272 TraceCheckUtils]: 2: Hoare triple {26031#true} call #t~ret0 := rec1(~i - 2); {26031#true} is VALID [2022-02-21 03:24:04,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,648 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {26031#true} {26031#true} #28#return; {26031#true} is VALID [2022-02-21 03:24:04,648 INFO L272 TraceCheckUtils]: 7: Hoare triple {26031#true} call #t~ret1 := rec1(#t~ret0 - 1); {26031#true} is VALID [2022-02-21 03:24:04,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,648 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {26031#true} {26031#true} #30#return; {26031#true} is VALID [2022-02-21 03:24:04,648 INFO L272 TraceCheckUtils]: 12: Hoare triple {26031#true} call #t~ret2 := rec1(#t~ret1); {26031#true} is VALID [2022-02-21 03:24:04,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26090#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:24:04,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {26090#(<= |rec1_#res| 0)} assume true; {26090#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:24:04,649 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {26090#(<= |rec1_#res| 0)} {26031#true} #32#return; {26088#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:24:04,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {26088#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {26089#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:24:04,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {26089#(<= |rec1_#res| 1)} assume true; {26089#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:24:04,651 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {26089#(<= |rec1_#res| 1)} {26031#true} #28#return; {26053#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:24:04,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-21 03:24:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:24:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26031#true} {26031#true} #28#return; {26031#true} is VALID [2022-02-21 03:24:04,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 03:24:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26031#true} {26031#true} #30#return; {26031#true} is VALID [2022-02-21 03:24:04,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-21 03:24:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26031#true} {26031#true} #32#return; {26031#true} is VALID [2022-02-21 03:24:04,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {26031#true} assume !(~i <= 0); {26031#true} is VALID [2022-02-21 03:24:04,666 INFO L272 TraceCheckUtils]: 2: Hoare triple {26031#true} call #t~ret0 := rec1(~i - 2); {26031#true} is VALID [2022-02-21 03:24:04,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,667 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {26031#true} {26031#true} #28#return; {26031#true} is VALID [2022-02-21 03:24:04,667 INFO L272 TraceCheckUtils]: 7: Hoare triple {26031#true} call #t~ret1 := rec1(#t~ret0 - 1); {26031#true} is VALID [2022-02-21 03:24:04,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,667 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {26031#true} {26031#true} #30#return; {26031#true} is VALID [2022-02-21 03:24:04,667 INFO L272 TraceCheckUtils]: 12: Hoare triple {26031#true} call #t~ret2 := rec1(#t~ret1); {26031#true} is VALID [2022-02-21 03:24:04,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,668 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {26031#true} {26031#true} #32#return; {26031#true} is VALID [2022-02-21 03:24:04,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {26031#true} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {26031#true} is VALID [2022-02-21 03:24:04,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,668 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {26031#true} {26032#false} #28#return; {26032#false} is VALID [2022-02-21 03:24:04,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {26031#true} assume { :begin_inline_ULTIMATE.init } true; {26031#true} is VALID [2022-02-21 03:24:04,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {26031#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {26031#true} is VALID [2022-02-21 03:24:04,668 INFO L272 TraceCheckUtils]: 2: Hoare triple {26031#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {26031#true} is VALID [2022-02-21 03:24:04,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {26031#true} ~j := #in~j; {26031#true} is VALID [2022-02-21 03:24:04,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {26031#true} assume !(~j <= 0); {26031#true} is VALID [2022-02-21 03:24:04,669 INFO L272 TraceCheckUtils]: 5: Hoare triple {26031#true} call #t~ret3 := rec1(~j - 1); {26031#true} is VALID [2022-02-21 03:24:04,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {26031#true} assume !(~i <= 0); {26031#true} is VALID [2022-02-21 03:24:04,669 INFO L272 TraceCheckUtils]: 8: Hoare triple {26031#true} call #t~ret0 := rec1(~i - 2); {26031#true} is VALID [2022-02-21 03:24:04,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {26031#true} assume !(~i <= 0); {26031#true} is VALID [2022-02-21 03:24:04,669 INFO L272 TraceCheckUtils]: 11: Hoare triple {26031#true} call #t~ret0 := rec1(~i - 2); {26031#true} is VALID [2022-02-21 03:24:04,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,670 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26031#true} {26031#true} #28#return; {26031#true} is VALID [2022-02-21 03:24:04,670 INFO L272 TraceCheckUtils]: 16: Hoare triple {26031#true} call #t~ret1 := rec1(#t~ret0 - 1); {26031#true} is VALID [2022-02-21 03:24:04,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,670 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {26031#true} {26031#true} #30#return; {26031#true} is VALID [2022-02-21 03:24:04,671 INFO L272 TraceCheckUtils]: 21: Hoare triple {26031#true} call #t~ret2 := rec1(#t~ret1); {26031#true} is VALID [2022-02-21 03:24:04,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26090#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:24:04,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {26090#(<= |rec1_#res| 0)} assume true; {26090#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:24:04,672 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26090#(<= |rec1_#res| 0)} {26031#true} #32#return; {26088#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:24:04,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {26088#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {26089#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:24:04,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {26089#(<= |rec1_#res| 1)} assume true; {26089#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:24:04,673 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {26089#(<= |rec1_#res| 1)} {26031#true} #28#return; {26053#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:24:04,685 INFO L272 TraceCheckUtils]: 29: Hoare triple {26053#(<= |rec1_#t~ret0| 1)} call #t~ret1 := rec1(#t~ret0 - 1); {26054#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:24:04,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {26054#(<= |rec1_#in~i| 0)} ~i := #in~i; {26055#(<= rec1_~i 0)} is VALID [2022-02-21 03:24:04,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {26055#(<= rec1_~i 0)} assume !(~i <= 0); {26032#false} is VALID [2022-02-21 03:24:04,696 INFO L272 TraceCheckUtils]: 32: Hoare triple {26032#false} call #t~ret0 := rec1(~i - 2); {26031#true} is VALID [2022-02-21 03:24:04,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {26031#true} assume !(~i <= 0); {26031#true} is VALID [2022-02-21 03:24:04,697 INFO L272 TraceCheckUtils]: 35: Hoare triple {26031#true} call #t~ret0 := rec1(~i - 2); {26031#true} is VALID [2022-02-21 03:24:04,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,697 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26031#true} {26031#true} #28#return; {26031#true} is VALID [2022-02-21 03:24:04,697 INFO L272 TraceCheckUtils]: 40: Hoare triple {26031#true} call #t~ret1 := rec1(#t~ret0 - 1); {26031#true} is VALID [2022-02-21 03:24:04,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,698 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {26031#true} {26031#true} #30#return; {26031#true} is VALID [2022-02-21 03:24:04,698 INFO L272 TraceCheckUtils]: 45: Hoare triple {26031#true} call #t~ret2 := rec1(#t~ret1); {26031#true} is VALID [2022-02-21 03:24:04,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,698 INFO L290 TraceCheckUtils]: 47: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,698 INFO L290 TraceCheckUtils]: 48: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,698 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {26031#true} {26031#true} #32#return; {26031#true} is VALID [2022-02-21 03:24:04,698 INFO L290 TraceCheckUtils]: 50: Hoare triple {26031#true} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {26031#true} is VALID [2022-02-21 03:24:04,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,699 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {26031#true} {26032#false} #28#return; {26032#false} is VALID [2022-02-21 03:24:04,699 INFO L272 TraceCheckUtils]: 53: Hoare triple {26032#false} call #t~ret1 := rec1(#t~ret0 - 1); {26032#false} is VALID [2022-02-21 03:24:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 24 proven. 29 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-02-21 03:24:04,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:04,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217708193] [2022-02-21 03:24:04,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217708193] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:24:04,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136653635] [2022-02-21 03:24:04,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:24:04,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:24:04,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:04,712 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:24:04,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-02-21 03:24:04,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:24:04,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:24:04,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:24:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:04,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:04,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {26031#true} assume { :begin_inline_ULTIMATE.init } true; {26031#true} is VALID [2022-02-21 03:24:04,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {26031#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {26031#true} is VALID [2022-02-21 03:24:04,876 INFO L272 TraceCheckUtils]: 2: Hoare triple {26031#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {26031#true} is VALID [2022-02-21 03:24:04,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {26031#true} ~j := #in~j; {26031#true} is VALID [2022-02-21 03:24:04,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {26031#true} assume !(~j <= 0); {26031#true} is VALID [2022-02-21 03:24:04,876 INFO L272 TraceCheckUtils]: 5: Hoare triple {26031#true} call #t~ret3 := rec1(~j - 1); {26031#true} is VALID [2022-02-21 03:24:04,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {26031#true} assume !(~i <= 0); {26031#true} is VALID [2022-02-21 03:24:04,876 INFO L272 TraceCheckUtils]: 8: Hoare triple {26031#true} call #t~ret0 := rec1(~i - 2); {26031#true} is VALID [2022-02-21 03:24:04,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {26031#true} assume !(~i <= 0); {26031#true} is VALID [2022-02-21 03:24:04,877 INFO L272 TraceCheckUtils]: 11: Hoare triple {26031#true} call #t~ret0 := rec1(~i - 2); {26031#true} is VALID [2022-02-21 03:24:04,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,877 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26031#true} {26031#true} #28#return; {26031#true} is VALID [2022-02-21 03:24:04,877 INFO L272 TraceCheckUtils]: 16: Hoare triple {26031#true} call #t~ret1 := rec1(#t~ret0 - 1); {26031#true} is VALID [2022-02-21 03:24:04,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:04,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:04,878 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {26031#true} {26031#true} #30#return; {26031#true} is VALID [2022-02-21 03:24:04,878 INFO L272 TraceCheckUtils]: 21: Hoare triple {26031#true} call #t~ret2 := rec1(#t~ret1); {26031#true} is VALID [2022-02-21 03:24:04,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:04,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26090#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:24:04,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {26090#(<= |rec1_#res| 0)} assume true; {26090#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:24:04,879 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26090#(<= |rec1_#res| 0)} {26031#true} #32#return; {26088#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:24:04,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {26088#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {26089#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:24:04,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {26089#(<= |rec1_#res| 1)} assume true; {26089#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:24:04,880 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {26089#(<= |rec1_#res| 1)} {26031#true} #28#return; {26053#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:24:04,880 INFO L272 TraceCheckUtils]: 29: Hoare triple {26053#(<= |rec1_#t~ret0| 1)} call #t~ret1 := rec1(#t~ret0 - 1); {26054#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:24:04,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {26054#(<= |rec1_#in~i| 0)} ~i := #in~i; {26055#(<= rec1_~i 0)} is VALID [2022-02-21 03:24:04,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {26055#(<= rec1_~i 0)} assume !(~i <= 0); {26032#false} is VALID [2022-02-21 03:24:04,881 INFO L272 TraceCheckUtils]: 32: Hoare triple {26032#false} call #t~ret0 := rec1(~i - 2); {26032#false} is VALID [2022-02-21 03:24:04,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {26032#false} ~i := #in~i; {26032#false} is VALID [2022-02-21 03:24:04,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {26032#false} assume !(~i <= 0); {26032#false} is VALID [2022-02-21 03:24:04,881 INFO L272 TraceCheckUtils]: 35: Hoare triple {26032#false} call #t~ret0 := rec1(~i - 2); {26032#false} is VALID [2022-02-21 03:24:04,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {26032#false} ~i := #in~i; {26032#false} is VALID [2022-02-21 03:24:04,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {26032#false} assume ~i <= 0;#res := 0; {26032#false} is VALID [2022-02-21 03:24:04,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {26032#false} assume true; {26032#false} is VALID [2022-02-21 03:24:04,882 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26032#false} {26032#false} #28#return; {26032#false} is VALID [2022-02-21 03:24:04,882 INFO L272 TraceCheckUtils]: 40: Hoare triple {26032#false} call #t~ret1 := rec1(#t~ret0 - 1); {26032#false} is VALID [2022-02-21 03:24:04,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {26032#false} ~i := #in~i; {26032#false} is VALID [2022-02-21 03:24:04,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {26032#false} assume ~i <= 0;#res := 0; {26032#false} is VALID [2022-02-21 03:24:04,882 INFO L290 TraceCheckUtils]: 43: Hoare triple {26032#false} assume true; {26032#false} is VALID [2022-02-21 03:24:04,882 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {26032#false} {26032#false} #30#return; {26032#false} is VALID [2022-02-21 03:24:04,883 INFO L272 TraceCheckUtils]: 45: Hoare triple {26032#false} call #t~ret2 := rec1(#t~ret1); {26032#false} is VALID [2022-02-21 03:24:04,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {26032#false} ~i := #in~i; {26032#false} is VALID [2022-02-21 03:24:04,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {26032#false} assume ~i <= 0;#res := 0; {26032#false} is VALID [2022-02-21 03:24:04,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {26032#false} assume true; {26032#false} is VALID [2022-02-21 03:24:04,883 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {26032#false} {26032#false} #32#return; {26032#false} is VALID [2022-02-21 03:24:04,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {26032#false} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {26032#false} is VALID [2022-02-21 03:24:04,883 INFO L290 TraceCheckUtils]: 51: Hoare triple {26032#false} assume true; {26032#false} is VALID [2022-02-21 03:24:04,883 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {26032#false} {26032#false} #28#return; {26032#false} is VALID [2022-02-21 03:24:04,883 INFO L272 TraceCheckUtils]: 53: Hoare triple {26032#false} call #t~ret1 := rec1(#t~ret0 - 1); {26032#false} is VALID [2022-02-21 03:24:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-02-21 03:24:04,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:24:05,142 INFO L272 TraceCheckUtils]: 53: Hoare triple {26032#false} call #t~ret1 := rec1(#t~ret0 - 1); {26032#false} is VALID [2022-02-21 03:24:05,144 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {26031#true} {26032#false} #28#return; {26032#false} is VALID [2022-02-21 03:24:05,144 INFO L290 TraceCheckUtils]: 51: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:05,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {26031#true} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {26031#true} is VALID [2022-02-21 03:24:05,145 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {26031#true} {26031#true} #32#return; {26031#true} is VALID [2022-02-21 03:24:05,145 INFO L290 TraceCheckUtils]: 48: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:05,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:05,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:05,145 INFO L272 TraceCheckUtils]: 45: Hoare triple {26031#true} call #t~ret2 := rec1(#t~ret1); {26031#true} is VALID [2022-02-21 03:24:05,145 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {26031#true} {26031#true} #30#return; {26031#true} is VALID [2022-02-21 03:24:05,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:05,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:05,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:05,146 INFO L272 TraceCheckUtils]: 40: Hoare triple {26031#true} call #t~ret1 := rec1(#t~ret0 - 1); {26031#true} is VALID [2022-02-21 03:24:05,146 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26031#true} {26031#true} #28#return; {26031#true} is VALID [2022-02-21 03:24:05,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:05,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:05,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:05,146 INFO L272 TraceCheckUtils]: 35: Hoare triple {26031#true} call #t~ret0 := rec1(~i - 2); {26031#true} is VALID [2022-02-21 03:24:05,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {26031#true} assume !(~i <= 0); {26031#true} is VALID [2022-02-21 03:24:05,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:05,146 INFO L272 TraceCheckUtils]: 32: Hoare triple {26032#false} call #t~ret0 := rec1(~i - 2); {26031#true} is VALID [2022-02-21 03:24:05,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {26055#(<= rec1_~i 0)} assume !(~i <= 0); {26032#false} is VALID [2022-02-21 03:24:05,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {26054#(<= |rec1_#in~i| 0)} ~i := #in~i; {26055#(<= rec1_~i 0)} is VALID [2022-02-21 03:24:05,148 INFO L272 TraceCheckUtils]: 29: Hoare triple {26053#(<= |rec1_#t~ret0| 1)} call #t~ret1 := rec1(#t~ret0 - 1); {26054#(<= |rec1_#in~i| 0)} is VALID [2022-02-21 03:24:05,148 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {26089#(<= |rec1_#res| 1)} {26031#true} #28#return; {26053#(<= |rec1_#t~ret0| 1)} is VALID [2022-02-21 03:24:05,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {26089#(<= |rec1_#res| 1)} assume true; {26089#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:24:05,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {26088#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {26089#(<= |rec1_#res| 1)} is VALID [2022-02-21 03:24:05,149 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26090#(<= |rec1_#res| 0)} {26031#true} #32#return; {26088#(<= |rec1_#t~ret2| 0)} is VALID [2022-02-21 03:24:05,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {26090#(<= |rec1_#res| 0)} assume true; {26090#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:24:05,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26090#(<= |rec1_#res| 0)} is VALID [2022-02-21 03:24:05,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:05,150 INFO L272 TraceCheckUtils]: 21: Hoare triple {26031#true} call #t~ret2 := rec1(#t~ret1); {26031#true} is VALID [2022-02-21 03:24:05,150 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {26031#true} {26031#true} #30#return; {26031#true} is VALID [2022-02-21 03:24:05,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:05,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:05,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:05,151 INFO L272 TraceCheckUtils]: 16: Hoare triple {26031#true} call #t~ret1 := rec1(#t~ret0 - 1); {26031#true} is VALID [2022-02-21 03:24:05,151 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26031#true} {26031#true} #28#return; {26031#true} is VALID [2022-02-21 03:24:05,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {26031#true} assume true; {26031#true} is VALID [2022-02-21 03:24:05,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {26031#true} assume ~i <= 0;#res := 0; {26031#true} is VALID [2022-02-21 03:24:05,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:05,151 INFO L272 TraceCheckUtils]: 11: Hoare triple {26031#true} call #t~ret0 := rec1(~i - 2); {26031#true} is VALID [2022-02-21 03:24:05,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {26031#true} assume !(~i <= 0); {26031#true} is VALID [2022-02-21 03:24:05,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:05,151 INFO L272 TraceCheckUtils]: 8: Hoare triple {26031#true} call #t~ret0 := rec1(~i - 2); {26031#true} is VALID [2022-02-21 03:24:05,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {26031#true} assume !(~i <= 0); {26031#true} is VALID [2022-02-21 03:24:05,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {26031#true} ~i := #in~i; {26031#true} is VALID [2022-02-21 03:24:05,152 INFO L272 TraceCheckUtils]: 5: Hoare triple {26031#true} call #t~ret3 := rec1(~j - 1); {26031#true} is VALID [2022-02-21 03:24:05,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {26031#true} assume !(~j <= 0); {26031#true} is VALID [2022-02-21 03:24:05,152 INFO L290 TraceCheckUtils]: 3: Hoare triple {26031#true} ~j := #in~j; {26031#true} is VALID [2022-02-21 03:24:05,152 INFO L272 TraceCheckUtils]: 2: Hoare triple {26031#true} call main_#t~ret6#1 := rec2(main_~x~0#1); {26031#true} is VALID [2022-02-21 03:24:05,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {26031#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {26031#true} is VALID [2022-02-21 03:24:05,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {26031#true} assume { :begin_inline_ULTIMATE.init } true; {26031#true} is VALID [2022-02-21 03:24:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 24 proven. 29 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-02-21 03:24:05,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136653635] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:24:05,153 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:24:05,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2022-02-21 03:24:05,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776118027] [2022-02-21 03:24:05,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:24:05,554 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:05,555 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:05,555 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:05,555 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:05,555 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:05,555 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:05,555 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:05,555 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:05,555 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration8_Loop [2022-02-21 03:24:05,555 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:05,556 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:05,557 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:24:05,559 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:24:05,564 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:24:05,569 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:24:05,570 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:24:05,572 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:24:05,613 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:05,613 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:05,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:05,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:05,614 INFO L229 MonitoredProcess]: Starting monitored process 66 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:24:05,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 03:24:05,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:05,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:05,637 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:05,637 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:05,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-02-21 03:24:05,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:05,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:05,654 INFO L229 MonitoredProcess]: Starting monitored process 67 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:24:05,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 03:24:05,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:05,689 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:05,709 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:05,709 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:05,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-02-21 03:24:05,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:05,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:05,726 INFO L229 MonitoredProcess]: Starting monitored process 68 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:24:05,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 03:24:05,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:05,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:05,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-02-21 03:24:05,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:05,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:05,765 INFO L229 MonitoredProcess]: Starting monitored process 69 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:24:05,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:05,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:05,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 03:24:05,777 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:05,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:05,792 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:05,792 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:05,792 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:05,792 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:05,792 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:05,792 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:05,792 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:05,792 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:05,792 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1b.c_Iteration8_Loop [2022-02-21 03:24:05,792 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:05,792 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:05,793 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:24:05,796 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:24:05,798 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:24:05,802 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:24:05,805 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:24:05,806 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:24:05,841 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:05,841 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:05,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:05,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:05,851 INFO L229 MonitoredProcess]: Starting monitored process 70 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:24:05,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-02-21 03:24:05,853 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:24:05,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:05,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:05,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:05,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:05,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:05,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:05,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:05,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:05,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-02-21 03:24:05,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:05,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:05,883 INFO L229 MonitoredProcess]: Starting monitored process 71 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:24:05,902 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:24:05,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:05,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:05,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:05,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:05,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:05,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:05,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:05,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-02-21 03:24:05,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:05,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:05,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:05,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:05,937 INFO L229 MonitoredProcess]: Starting monitored process 72 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:24:05,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-02-21 03:24:05,940 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:24:05,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:05,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:05,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:05,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:05,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:05,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:05,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:05,950 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:05,952 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:24:05,952 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:05,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:05,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:05,953 INFO L229 MonitoredProcess]: Starting monitored process 73 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:24:05,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-02-21 03:24:05,955 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:05,955 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:05,955 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:05,955 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2022-02-21 03:24:05,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-02-21 03:24:05,975 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:05,978 INFO L390 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#28#return;" "call #t~ret1 := rec1(#t~ret0 - 1);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#30#return;" "call #t~ret2 := rec1(#t~ret1);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#32#return;" "#res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2;" "assume true;" >"#28#return;" "call #t~ret1 := rec1(#t~ret0 - 1);"< [2022-02-21 03:24:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:05,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:06,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:24:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:06,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:06,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {26421#unseeded} assume { :begin_inline_ULTIMATE.init } true; {26421#unseeded} is VALID [2022-02-21 03:24:06,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {26421#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {26421#unseeded} is VALID [2022-02-21 03:24:06,286 INFO L272 TraceCheckUtils]: 2: Hoare triple {26421#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {26421#unseeded} is VALID [2022-02-21 03:24:06,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {26421#unseeded} ~j := #in~j; {26421#unseeded} is VALID [2022-02-21 03:24:06,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {26421#unseeded} assume !(~j <= 0); {26421#unseeded} is VALID [2022-02-21 03:24:06,288 INFO L272 TraceCheckUtils]: 5: Hoare triple {26421#unseeded} call #t~ret3 := rec1(~j - 1); {26421#unseeded} is VALID [2022-02-21 03:24:06,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {26421#unseeded} ~i := #in~i; {26421#unseeded} is VALID [2022-02-21 03:24:06,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {26421#unseeded} assume !(~i <= 0); {26421#unseeded} is VALID [2022-02-21 03:24:06,289 INFO L272 TraceCheckUtils]: 8: Hoare triple {26421#unseeded} call #t~ret0 := rec1(~i - 2); {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,290 INFO L272 TraceCheckUtils]: 11: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,292 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,293 INFO L272 TraceCheckUtils]: 16: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,295 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,295 INFO L272 TraceCheckUtils]: 21: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,297 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:06,298 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {26463#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {26421#unseeded} #28#return; {26421#unseeded} is VALID [2022-02-21 03:24:06,299 INFO L272 TraceCheckUtils]: 29: Hoare triple {26421#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {26421#unseeded} is VALID [2022-02-21 03:24:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:06,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:24:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:06,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:06,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {26424#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {26527#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:24:06,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {26527#(<= rec1_~i oldRank0)} assume !(~i <= 0); {26527#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:24:06,731 INFO L272 TraceCheckUtils]: 2: Hoare triple {26527#(<= rec1_~i oldRank0)} call #t~ret0 := rec1(~i - 2); {26534#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:06,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {26534#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {26538#(and (<= rec1_~i |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:06,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {26538#(and (<= rec1_~i |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} assume !(~i <= 0); {26542#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:06,733 INFO L272 TraceCheckUtils]: 5: Hoare triple {26542#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret0 := rec1(~i - 2); {26534#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:06,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {26534#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {26534#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:06,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {26534#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {26534#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:06,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {26534#(<= |old(oldRank0)| oldRank0)} assume true; {26534#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:06,735 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {26534#(<= |old(oldRank0)| oldRank0)} {26542#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #28#return; {26542#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:06,735 INFO L272 TraceCheckUtils]: 10: Hoare triple {26542#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret1 := rec1(#t~ret0 - 1); {26534#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:06,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {26534#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {26534#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:06,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {26534#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {26534#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:06,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {26534#(<= |old(oldRank0)| oldRank0)} assume true; {26534#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:06,737 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {26534#(<= |old(oldRank0)| oldRank0)} {26542#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #30#return; {26542#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:06,738 INFO L272 TraceCheckUtils]: 15: Hoare triple {26542#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret2 := rec1(#t~ret1); {26534#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:06,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {26534#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {26534#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:06,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {26534#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {26582#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:06,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {26582#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {26582#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:06,740 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {26582#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} {26542#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #32#return; {26589#(and (<= |rec1_#t~ret2| 0) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:06,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {26589#(and (<= |rec1_#t~ret2| 0) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {26593#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:06,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {26593#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} assume true; {26593#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:06,742 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {26593#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} {26527#(<= rec1_~i oldRank0)} #28#return; {26600#(and (< 2 oldRank0) (<= |rec1_#t~ret0| 1))} is VALID [2022-02-21 03:24:06,742 INFO L272 TraceCheckUtils]: 23: Hoare triple {26600#(and (< 2 oldRank0) (<= |rec1_#t~ret0| 1))} call #t~ret1 := rec1(#t~ret0 - 1); {26434#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:24:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 03:24:06,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:06,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:06,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2022-02-21 03:24:06,790 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26 Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:06,894 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Result 101 states and 123 transitions. Complement of second has 7 states. [2022-02-21 03:24:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:06,894 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:06,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 115 transitions. cyclomatic complexity: 26 [2022-02-21 03:24:06,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:06,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:06,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:06,895 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:06,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:06,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 123 transitions. [2022-02-21 03:24:06,896 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 03:24:06,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:06,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:06,896 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 93 states and 115 transitions. cyclomatic complexity: 26 [2022-02-21 03:24:06,899 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 23 examples of accepted words. [2022-02-21 03:24:06,899 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:06,899 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:06,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 16 transitions. cyclomatic complexity: 15 [2022-02-21 03:24:06,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:06,899 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:06,899 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 101 states and 123 transitions. cyclomatic complexity: 26 [2022-02-21 03:24:06,902 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 23 examples of accepted words. [2022-02-21 03:24:06,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 101 letters. Loop has 101 letters. [2022-02-21 03:24:06,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 101 letters. Loop has 101 letters. [2022-02-21 03:24:06,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 101 letters. Loop has 101 letters. [2022-02-21 03:24:06,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:24:06,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:24:06,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:24:06,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:06,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:06,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:06,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:06,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:06,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:06,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:06,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:06,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:06,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:06,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:06,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:06,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:06,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:06,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:06,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:06,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:06,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:06,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:06,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:06,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:06,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:06,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:06,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:06,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:06,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:06,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:06,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:06,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:06,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:06,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:06,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:06,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:06,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:06,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:06,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:06,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:06,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:06,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:06,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:06,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:06,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:06,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:06,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:06,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:06,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:06,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:06,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:06,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:06,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:06,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:06,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:06,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:06,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:06,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:06,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:06,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:06,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:06,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:06,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:06,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:06,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:06,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:06,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:06,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:06,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:06,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:06,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:06,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:06,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:06,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:06,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:06,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:06,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:06,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:06,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:06,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:06,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:06,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:06,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:06,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:06,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:06,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:06,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:06,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:06,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:06,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:06,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:06,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:06,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:06,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:06,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:06,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:06,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:06,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:06,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:06,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:06,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:06,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:06,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:06,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:06,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,964 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:24:06,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:06,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:06,966 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:06,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-02-21 03:24:06,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:07,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:24:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:07,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:07,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {26421#unseeded} assume { :begin_inline_ULTIMATE.init } true; {26421#unseeded} is VALID [2022-02-21 03:24:07,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {26421#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {26421#unseeded} is VALID [2022-02-21 03:24:07,252 INFO L272 TraceCheckUtils]: 2: Hoare triple {26421#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {26421#unseeded} is VALID [2022-02-21 03:24:07,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {26421#unseeded} ~j := #in~j; {26421#unseeded} is VALID [2022-02-21 03:24:07,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {26421#unseeded} assume !(~j <= 0); {26421#unseeded} is VALID [2022-02-21 03:24:07,253 INFO L272 TraceCheckUtils]: 5: Hoare triple {26421#unseeded} call #t~ret3 := rec1(~j - 1); {26421#unseeded} is VALID [2022-02-21 03:24:07,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {26421#unseeded} ~i := #in~i; {26421#unseeded} is VALID [2022-02-21 03:24:07,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {26421#unseeded} assume !(~i <= 0); {26421#unseeded} is VALID [2022-02-21 03:24:07,254 INFO L272 TraceCheckUtils]: 8: Hoare triple {26421#unseeded} call #t~ret0 := rec1(~i - 2); {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,255 INFO L272 TraceCheckUtils]: 11: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,257 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,258 INFO L272 TraceCheckUtils]: 16: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,260 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,260 INFO L272 TraceCheckUtils]: 21: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,262 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,263 INFO L290 TraceCheckUtils]: 27: Hoare triple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:07,263 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {26745#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {26421#unseeded} #28#return; {26421#unseeded} is VALID [2022-02-21 03:24:07,263 INFO L272 TraceCheckUtils]: 29: Hoare triple {26421#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {26421#unseeded} is VALID [2022-02-21 03:24:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:07,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:24:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:07,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:07,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {26424#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {26809#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:24:07,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {26809#(<= rec1_~i oldRank0)} assume !(~i <= 0); {26809#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:24:07,618 INFO L272 TraceCheckUtils]: 2: Hoare triple {26809#(<= rec1_~i oldRank0)} call #t~ret0 := rec1(~i - 2); {26816#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:07,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {26816#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {26820#(and (<= rec1_~i |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:07,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {26820#(and (<= rec1_~i |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} assume !(~i <= 0); {26824#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:07,619 INFO L272 TraceCheckUtils]: 5: Hoare triple {26824#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret0 := rec1(~i - 2); {26816#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:07,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {26816#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {26816#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:07,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {26816#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {26816#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:07,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {26816#(<= |old(oldRank0)| oldRank0)} assume true; {26816#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:07,621 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {26816#(<= |old(oldRank0)| oldRank0)} {26824#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #28#return; {26824#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:07,621 INFO L272 TraceCheckUtils]: 10: Hoare triple {26824#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret1 := rec1(#t~ret0 - 1); {26816#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:07,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {26816#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {26816#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:07,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {26816#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {26816#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:07,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {26816#(<= |old(oldRank0)| oldRank0)} assume true; {26816#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:07,623 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {26816#(<= |old(oldRank0)| oldRank0)} {26824#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #30#return; {26824#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:07,623 INFO L272 TraceCheckUtils]: 15: Hoare triple {26824#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret2 := rec1(#t~ret1); {26816#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:07,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {26816#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {26816#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:07,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {26816#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {26864#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:07,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {26864#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {26864#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:07,625 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {26864#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} {26824#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #32#return; {26871#(and (<= |rec1_#t~ret2| 0) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:07,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {26871#(and (<= |rec1_#t~ret2| 0) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {26875#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:07,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {26875#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} assume true; {26875#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:07,626 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {26875#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} {26809#(<= rec1_~i oldRank0)} #28#return; {26882#(and (< 2 oldRank0) (<= |rec1_#t~ret0| 1))} is VALID [2022-02-21 03:24:07,627 INFO L272 TraceCheckUtils]: 23: Hoare triple {26882#(and (< 2 oldRank0) (<= |rec1_#t~ret0| 1))} call #t~ret1 := rec1(#t~ret0 - 1); {26434#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:24:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 03:24:07,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:07,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:07,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,666 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2022-02-21 03:24:07,666 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26 Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:07,733 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Result 101 states and 123 transitions. Complement of second has 7 states. [2022-02-21 03:24:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:07,734 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:07,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 115 transitions. cyclomatic complexity: 26 [2022-02-21 03:24:07,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:07,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:07,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:07,734 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:07,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:07,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 123 transitions. [2022-02-21 03:24:07,735 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2022-02-21 03:24:07,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:07,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:07,735 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 93 states and 115 transitions. cyclomatic complexity: 26 [2022-02-21 03:24:07,736 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 23 examples of accepted words. [2022-02-21 03:24:07,736 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:07,736 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:07,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 16 transitions. cyclomatic complexity: 15 [2022-02-21 03:24:07,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:07,736 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:07,736 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 101 states and 123 transitions. cyclomatic complexity: 26 [2022-02-21 03:24:07,739 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 23 examples of accepted words. [2022-02-21 03:24:07,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 101 letters. Loop has 101 letters. [2022-02-21 03:24:07,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 101 letters. Loop has 101 letters. [2022-02-21 03:24:07,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 101 letters. Loop has 101 letters. [2022-02-21 03:24:07,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:24:07,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:24:07,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:24:07,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:07,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:07,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:07,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:07,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:07,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:07,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:07,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:07,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:07,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:07,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:07,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:07,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:07,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:07,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:07,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:07,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:07,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:07,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:07,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:07,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:07,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:07,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:07,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:07,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:07,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:07,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:07,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:07,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:07,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:07,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:07,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:07,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:07,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:07,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:07,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:07,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:07,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:07,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:07,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:07,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:07,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:07,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:07,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:07,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:07,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:07,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:07,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:07,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:07,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:07,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:07,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:07,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:07,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:07,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:07,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:07,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:07,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:07,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:07,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:07,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:07,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:07,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:07,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:07,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:07,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:07,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:07,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:07,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:07,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:07,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:07,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:07,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:07,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:07,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:07,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:07,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:07,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:07,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:07,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:07,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:07,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:07,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:07,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:07,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:07,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:07,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:07,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:07,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:07,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:07,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:07,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:07,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:07,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:07,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:07,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:07,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:07,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:07,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:07,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:07,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 123 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:07,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,772 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:24:07,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:07,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:07,773 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:07,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:24:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:07,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:08,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {26421#unseeded} assume { :begin_inline_ULTIMATE.init } true; {26421#unseeded} is VALID [2022-02-21 03:24:08,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {26421#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {26421#unseeded} is VALID [2022-02-21 03:24:08,012 INFO L272 TraceCheckUtils]: 2: Hoare triple {26421#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {26421#unseeded} is VALID [2022-02-21 03:24:08,013 INFO L290 TraceCheckUtils]: 3: Hoare triple {26421#unseeded} ~j := #in~j; {26421#unseeded} is VALID [2022-02-21 03:24:08,014 INFO L290 TraceCheckUtils]: 4: Hoare triple {26421#unseeded} assume !(~j <= 0); {26421#unseeded} is VALID [2022-02-21 03:24:08,014 INFO L272 TraceCheckUtils]: 5: Hoare triple {26421#unseeded} call #t~ret3 := rec1(~j - 1); {26421#unseeded} is VALID [2022-02-21 03:24:08,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {26421#unseeded} ~i := #in~i; {26421#unseeded} is VALID [2022-02-21 03:24:08,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {26421#unseeded} assume !(~i <= 0); {26421#unseeded} is VALID [2022-02-21 03:24:08,015 INFO L272 TraceCheckUtils]: 8: Hoare triple {26421#unseeded} call #t~ret0 := rec1(~i - 2); {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,016 INFO L272 TraceCheckUtils]: 11: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,018 INFO L272 TraceCheckUtils]: 16: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,020 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,020 INFO L272 TraceCheckUtils]: 21: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,022 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:08,023 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {27027#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {26421#unseeded} #28#return; {26421#unseeded} is VALID [2022-02-21 03:24:08,024 INFO L272 TraceCheckUtils]: 29: Hoare triple {26421#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {26421#unseeded} is VALID [2022-02-21 03:24:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:08,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:24:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:08,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:08,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {26424#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {27091#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:24:08,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {27091#(<= rec1_~i oldRank0)} assume !(~i <= 0); {27091#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:24:08,348 INFO L272 TraceCheckUtils]: 2: Hoare triple {27091#(<= rec1_~i oldRank0)} call #t~ret0 := rec1(~i - 2); {27098#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:08,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {27098#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {27102#(and (<= rec1_~i |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:08,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {27102#(and (<= rec1_~i |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} assume !(~i <= 0); {27106#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:08,349 INFO L272 TraceCheckUtils]: 5: Hoare triple {27106#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret0 := rec1(~i - 2); {27098#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:08,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {27098#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {27098#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:08,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {27098#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {27098#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:08,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {27098#(<= |old(oldRank0)| oldRank0)} assume true; {27098#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:08,351 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {27098#(<= |old(oldRank0)| oldRank0)} {27106#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #28#return; {27106#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:08,351 INFO L272 TraceCheckUtils]: 10: Hoare triple {27106#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret1 := rec1(#t~ret0 - 1); {27098#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:08,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {27098#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {27098#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:08,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {27098#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {27098#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:08,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {27098#(<= |old(oldRank0)| oldRank0)} assume true; {27098#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:08,353 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {27098#(<= |old(oldRank0)| oldRank0)} {27106#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #30#return; {27106#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:08,353 INFO L272 TraceCheckUtils]: 15: Hoare triple {27106#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret2 := rec1(#t~ret1); {27098#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:08,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {27098#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {27098#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:08,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {27098#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {27146#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:08,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {27146#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {27146#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:08,355 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {27146#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} {27106#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #32#return; {27153#(and (<= |rec1_#t~ret2| 0) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:08,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {27153#(and (<= |rec1_#t~ret2| 0) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {27157#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:08,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {27157#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} assume true; {27157#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:08,356 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27157#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} {27091#(<= rec1_~i oldRank0)} #28#return; {27164#(and (< 2 oldRank0) (<= |rec1_#t~ret0| 1))} is VALID [2022-02-21 03:24:08,357 INFO L272 TraceCheckUtils]: 23: Hoare triple {27164#(and (< 2 oldRank0) (<= |rec1_#t~ret0| 1))} call #t~ret1 := rec1(#t~ret0 - 1); {26434#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:24:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 03:24:08,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:08,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:08,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,397 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2022-02-21 03:24:08,397 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26 Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:08,814 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Result 258 states and 304 transitions. Complement of second has 31 states. [2022-02-21 03:24:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:08,814 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:08,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 115 transitions. cyclomatic complexity: 26 [2022-02-21 03:24:08,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:08,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:08,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:08,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:08,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:08,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:08,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 304 transitions. [2022-02-21 03:24:08,817 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 42 [2022-02-21 03:24:08,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:08,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:08,817 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 93 states and 115 transitions. cyclomatic complexity: 26 [2022-02-21 03:24:08,817 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 23 examples of accepted words. [2022-02-21 03:24:08,817 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:08,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:08,818 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:08,818 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 258 states and 304 transitions. cyclomatic complexity: 50 [2022-02-21 03:24:08,824 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 35 examples of accepted words. [2022-02-21 03:24:08,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:24:08,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:24:08,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:24:08,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 258 letters. Loop has 258 letters. [2022-02-21 03:24:08,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 258 letters. Loop has 258 letters. [2022-02-21 03:24:08,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 258 letters. Loop has 258 letters. [2022-02-21 03:24:08,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:24:08,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:24:08,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:24:08,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:08,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:08,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:08,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:08,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:08,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:08,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:08,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:08,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:08,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:08,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:08,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:08,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:08,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:08,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:08,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:08,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:08,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:08,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:08,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:08,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:08,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:08,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:08,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:08,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:08,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:08,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:08,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:08,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:08,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:08,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:08,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:08,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:08,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:08,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:08,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:08,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:08,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:08,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:08,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:08,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:08,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:08,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:08,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:08,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:08,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:08,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:08,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:08,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:08,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:08,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:08,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:08,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:08,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:08,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:08,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:08,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:08,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:08,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:08,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:08,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:24:08,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:24:08,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:24:08,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 69 letters. Loop has 45 letters. [2022-02-21 03:24:08,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 69 letters. Loop has 45 letters. [2022-02-21 03:24:08,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 69 letters. Loop has 45 letters. [2022-02-21 03:24:08,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 67 letters. Loop has 45 letters. [2022-02-21 03:24:08,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 67 letters. Loop has 45 letters. [2022-02-21 03:24:08,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 67 letters. Loop has 45 letters. [2022-02-21 03:24:08,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 68 letters. Loop has 45 letters. [2022-02-21 03:24:08,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 68 letters. Loop has 45 letters. [2022-02-21 03:24:08,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 68 letters. Loop has 45 letters. [2022-02-21 03:24:08,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 69 letters. Loop has 45 letters. [2022-02-21 03:24:08,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 69 letters. Loop has 45 letters. [2022-02-21 03:24:08,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 69 letters. Loop has 45 letters. [2022-02-21 03:24:08,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 70 letters. Loop has 48 letters. [2022-02-21 03:24:08,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 70 letters. Loop has 48 letters. [2022-02-21 03:24:08,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 70 letters. Loop has 48 letters. [2022-02-21 03:24:08,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:08,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 48 letters. [2022-02-21 03:24:08,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 48 letters. [2022-02-21 03:24:08,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 48 letters. [2022-02-21 03:24:08,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:08,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:08,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:08,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 43 letters. [2022-02-21 03:24:08,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 43 letters. [2022-02-21 03:24:08,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 43 letters. [2022-02-21 03:24:08,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 69 letters. Loop has 45 letters. [2022-02-21 03:24:08,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 69 letters. Loop has 45 letters. [2022-02-21 03:24:08,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 69 letters. Loop has 45 letters. [2022-02-21 03:24:08,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 69 letters. Loop has 61 letters. [2022-02-21 03:24:08,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 69 letters. Loop has 61 letters. [2022-02-21 03:24:08,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 69 letters. Loop has 61 letters. [2022-02-21 03:24:08,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 30 letters. [2022-02-21 03:24:08,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 30 letters. [2022-02-21 03:24:08,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 30 letters. [2022-02-21 03:24:08,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 45 letters. [2022-02-21 03:24:08,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 45 letters. [2022-02-21 03:24:08,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 32 letters. Loop has 45 letters. [2022-02-21 03:24:08,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 118 letters. Loop has 24 letters. [2022-02-21 03:24:08,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 118 letters. Loop has 24 letters. [2022-02-21 03:24:08,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 118 letters. Loop has 24 letters. [2022-02-21 03:24:08,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 157 letters. Loop has 45 letters. [2022-02-21 03:24:08,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 157 letters. Loop has 45 letters. [2022-02-21 03:24:08,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 157 letters. Loop has 45 letters. [2022-02-21 03:24:08,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 24 letters. [2022-02-21 03:24:08,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 24 letters. [2022-02-21 03:24:08,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 120 letters. Loop has 24 letters. [2022-02-21 03:24:08,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 97 letters. Loop has 48 letters. [2022-02-21 03:24:08,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 97 letters. Loop has 48 letters. [2022-02-21 03:24:08,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 97 letters. Loop has 48 letters. [2022-02-21 03:24:08,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 155 letters. Loop has 45 letters. [2022-02-21 03:24:08,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 155 letters. Loop has 45 letters. [2022-02-21 03:24:08,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 155 letters. Loop has 45 letters. [2022-02-21 03:24:08,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 156 letters. Loop has 45 letters. [2022-02-21 03:24:08,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 156 letters. Loop has 45 letters. [2022-02-21 03:24:08,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 156 letters. Loop has 45 letters. [2022-02-21 03:24:08,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 157 letters. Loop has 45 letters. [2022-02-21 03:24:08,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 157 letters. Loop has 45 letters. [2022-02-21 03:24:08,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 157 letters. Loop has 45 letters. [2022-02-21 03:24:08,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 24 letters. [2022-02-21 03:24:08,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 24 letters. [2022-02-21 03:24:08,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 120 letters. Loop has 24 letters. [2022-02-21 03:24:08,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 157 letters. Loop has 61 letters. [2022-02-21 03:24:08,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 157 letters. Loop has 61 letters. [2022-02-21 03:24:08,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 157 letters. Loop has 61 letters. [2022-02-21 03:24:08,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 157 letters. Loop has 45 letters. [2022-02-21 03:24:08,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 157 letters. Loop has 45 letters. [2022-02-21 03:24:08,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 157 letters. Loop has 45 letters. [2022-02-21 03:24:08,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 48 letters. [2022-02-21 03:24:08,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 48 letters. [2022-02-21 03:24:08,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 120 letters. Loop has 48 letters. [2022-02-21 03:24:08,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 45 letters. [2022-02-21 03:24:08,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 45 letters. [2022-02-21 03:24:08,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 120 letters. Loop has 45 letters. [2022-02-21 03:24:08,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 30 letters. [2022-02-21 03:24:08,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 30 letters. [2022-02-21 03:24:08,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 120 letters. Loop has 30 letters. [2022-02-21 03:24:08,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 27 letters. [2022-02-21 03:24:08,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 27 letters. [2022-02-21 03:24:08,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 120 letters. Loop has 27 letters. [2022-02-21 03:24:08,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 43 letters. [2022-02-21 03:24:08,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 43 letters. [2022-02-21 03:24:08,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 120 letters. Loop has 43 letters. [2022-02-21 03:24:08,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 178 letters. Loop has 88 letters. [2022-02-21 03:24:08,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 178 letters. Loop has 88 letters. [2022-02-21 03:24:08,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 178 letters. Loop has 88 letters. [2022-02-21 03:24:08,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 92 letters. Loop has 88 letters. [2022-02-21 03:24:08,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 92 letters. Loop has 88 letters. [2022-02-21 03:24:08,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 92 letters. Loop has 88 letters. [2022-02-21 03:24:08,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 93 letters. Loop has 88 letters. [2022-02-21 03:24:08,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 93 letters. Loop has 88 letters. [2022-02-21 03:24:08,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 93 letters. Loop has 88 letters. [2022-02-21 03:24:08,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 91 letters. Loop has 88 letters. [2022-02-21 03:24:08,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 91 letters. Loop has 88 letters. [2022-02-21 03:24:08,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 91 letters. Loop has 88 letters. [2022-02-21 03:24:08,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 178 letters. Loop has 88 letters. [2022-02-21 03:24:08,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 178 letters. Loop has 88 letters. [2022-02-21 03:24:08,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 258 states and 304 transitions. cyclomatic complexity: 50 Stem has 178 letters. Loop has 88 letters. [2022-02-21 03:24:08,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,881 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-02-21 03:24:08,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 39 transitions. Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:08,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:08,882 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:08,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:08,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:24:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:08,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:09,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {26421#unseeded} assume { :begin_inline_ULTIMATE.init } true; {26421#unseeded} is VALID [2022-02-21 03:24:09,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {26421#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {26421#unseeded} is VALID [2022-02-21 03:24:09,122 INFO L272 TraceCheckUtils]: 2: Hoare triple {26421#unseeded} call main_#t~ret6#1 := rec2(main_~x~0#1); {26421#unseeded} is VALID [2022-02-21 03:24:09,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {26421#unseeded} ~j := #in~j; {26421#unseeded} is VALID [2022-02-21 03:24:09,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {26421#unseeded} assume !(~j <= 0); {26421#unseeded} is VALID [2022-02-21 03:24:09,122 INFO L272 TraceCheckUtils]: 5: Hoare triple {26421#unseeded} call #t~ret3 := rec1(~j - 1); {26421#unseeded} is VALID [2022-02-21 03:24:09,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {26421#unseeded} ~i := #in~i; {26421#unseeded} is VALID [2022-02-21 03:24:09,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {26421#unseeded} assume !(~i <= 0); {26421#unseeded} is VALID [2022-02-21 03:24:09,123 INFO L272 TraceCheckUtils]: 8: Hoare triple {26421#unseeded} call #t~ret0 := rec1(~i - 2); {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,125 INFO L272 TraceCheckUtils]: 11: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,127 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,127 INFO L272 TraceCheckUtils]: 16: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,129 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #30#return; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,129 INFO L272 TraceCheckUtils]: 21: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,131 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #32#return; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:24:09,132 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {27502#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {26421#unseeded} #28#return; {26421#unseeded} is VALID [2022-02-21 03:24:09,133 INFO L272 TraceCheckUtils]: 29: Hoare triple {26421#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {26421#unseeded} is VALID [2022-02-21 03:24:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:09,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:24:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:09,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:09,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {26424#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {27566#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:24:09,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {27566#(<= rec1_~i oldRank0)} assume !(~i <= 0); {27566#(<= rec1_~i oldRank0)} is VALID [2022-02-21 03:24:09,543 INFO L272 TraceCheckUtils]: 2: Hoare triple {27566#(<= rec1_~i oldRank0)} call #t~ret0 := rec1(~i - 2); {27573#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:09,543 INFO L290 TraceCheckUtils]: 3: Hoare triple {27573#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {27577#(and (<= rec1_~i |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:09,544 INFO L290 TraceCheckUtils]: 4: Hoare triple {27577#(and (<= rec1_~i |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} assume !(~i <= 0); {27581#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:09,544 INFO L272 TraceCheckUtils]: 5: Hoare triple {27581#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret0 := rec1(~i - 2); {27573#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:09,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {27573#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {27573#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:09,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {27573#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {27573#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:09,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {27573#(<= |old(oldRank0)| oldRank0)} assume true; {27573#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:09,546 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {27573#(<= |old(oldRank0)| oldRank0)} {27581#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #28#return; {27581#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:09,547 INFO L272 TraceCheckUtils]: 10: Hoare triple {27581#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret1 := rec1(#t~ret0 - 1); {27573#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:09,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {27573#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {27573#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:09,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {27573#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {27573#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:09,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {27573#(<= |old(oldRank0)| oldRank0)} assume true; {27573#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:09,549 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {27573#(<= |old(oldRank0)| oldRank0)} {27581#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #30#return; {27581#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:09,550 INFO L272 TraceCheckUtils]: 15: Hoare triple {27581#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} call #t~ret2 := rec1(#t~ret1); {27573#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:09,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {27573#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {27573#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:24:09,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {27573#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {27621#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:09,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {27621#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {27621#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:09,552 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {27621#(and (<= |rec1_#res| 0) (<= |old(oldRank0)| oldRank0))} {27581#(and (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #32#return; {27628#(and (<= |rec1_#t~ret2| 0) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:09,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {27628#(and (<= |rec1_#t~ret2| 0) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} #res := 1 + #t~ret2;havoc #t~ret0;havoc #t~ret1;havoc #t~ret2; {27632#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:09,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {27632#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} assume true; {27632#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:24:09,554 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27632#(and (<= |rec1_#res| 1) (< 0 |rec1_#in~i|) (<= |old(oldRank0)| oldRank0))} {27566#(<= rec1_~i oldRank0)} #28#return; {27639#(and (< 2 oldRank0) (<= |rec1_#t~ret0| 1))} is VALID [2022-02-21 03:24:09,554 INFO L272 TraceCheckUtils]: 23: Hoare triple {27639#(and (< 2 oldRank0) (<= |rec1_#t~ret0| 1))} call #t~ret1 := rec1(#t~ret0 - 1); {26434#(or (and (>= oldRank0 0) (> oldRank0 |rec1_#in~i|)) unseeded)} is VALID [2022-02-21 03:24:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 03:24:09,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:09,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:09,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:09,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:09,604 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2022-02-21 03:24:09,604 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26 Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:10,292 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 115 transitions. cyclomatic complexity: 26. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Result 410 states and 516 transitions. Complement of second has 80 states. [2022-02-21 03:24:10,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:10,292 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:10,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 115 transitions. cyclomatic complexity: 26 [2022-02-21 03:24:10,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:10,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:10,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:10,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:24:10,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:10,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:10,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 410 states and 516 transitions. [2022-02-21 03:24:10,296 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2022-02-21 03:24:10,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:10,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:10,296 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 93 states and 115 transitions. cyclomatic complexity: 26 [2022-02-21 03:24:10,297 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 23 examples of accepted words. [2022-02-21 03:24:10,297 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:10,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:24:10,307 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:10,307 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 410 states and 516 transitions. cyclomatic complexity: 112 [2022-02-21 03:24:10,323 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 57 examples of accepted words. [2022-02-21 03:24:10,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:10,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:10,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:10,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 11 letters. [2022-02-21 03:24:10,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 2 letters. Loop has 11 letters. [2022-02-21 03:24:10,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 2 letters. Loop has 11 letters. [2022-02-21 03:24:10,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 72 letters. [2022-02-21 03:24:10,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 72 letters. [2022-02-21 03:24:10,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 30 letters. Loop has 72 letters. [2022-02-21 03:24:10,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 410 letters. Loop has 410 letters. [2022-02-21 03:24:10,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 410 letters. Loop has 410 letters. [2022-02-21 03:24:10,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 410 letters. Loop has 410 letters. [2022-02-21 03:24:10,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:24:10,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:24:10,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 93 letters. Loop has 93 letters. [2022-02-21 03:24:10,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:10,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:10,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:10,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:10,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:10,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:10,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:10,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:10,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:10,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:10,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:10,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:10,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:10,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:10,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 33 letters. Loop has 27 letters. [2022-02-21 03:24:10,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:10,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:10,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 31 letters. Loop has 24 letters. [2022-02-21 03:24:10,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:10,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:10,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:10,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:10,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:10,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 53 letters. Loop has 45 letters. [2022-02-21 03:24:10,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:10,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:10,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 32 letters. Loop has 24 letters. [2022-02-21 03:24:10,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:10,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 32 letters. Loop has 27 letters. [2022-02-21 03:24:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:10,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:10,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:10,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:10,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 103 letters. Loop has 24 letters. [2022-02-21 03:24:10,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:10,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:10,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:10,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:10,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:10,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 81 letters. Loop has 27 letters. [2022-02-21 03:24:10,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:10,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:10,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 102 letters. Loop has 24 letters. [2022-02-21 03:24:10,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:10,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:10,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:10,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:10,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:10,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 104 letters. Loop has 24 letters. [2022-02-21 03:24:10,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:10,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:10,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 125 letters. Loop has 45 letters. [2022-02-21 03:24:10,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:10,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:10,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 104 letters. Loop has 27 letters. [2022-02-21 03:24:10,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:10,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:10,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:10,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:10,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:10,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 77 letters. Loop has 72 letters. [2022-02-21 03:24:10,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:10,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:10,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 75 letters. Loop has 72 letters. [2022-02-21 03:24:10,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:10,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:10,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 76 letters. Loop has 72 letters. [2022-02-21 03:24:10,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:10,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:10,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 74 letters. Loop has 72 letters. [2022-02-21 03:24:10,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 11 letters. [2022-02-21 03:24:10,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 2 letters. Loop has 11 letters. [2022-02-21 03:24:10,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 2 letters. Loop has 11 letters. [2022-02-21 03:24:10,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 70 letters. Loop has 48 letters. [2022-02-21 03:24:10,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 70 letters. Loop has 48 letters. [2022-02-21 03:24:10,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 48 letters. [2022-02-21 03:24:10,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 67 letters. Loop has 45 letters. [2022-02-21 03:24:10,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 67 letters. Loop has 45 letters. [2022-02-21 03:24:10,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 45 letters. [2022-02-21 03:24:10,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 68 letters. Loop has 45 letters. [2022-02-21 03:24:10,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 68 letters. Loop has 45 letters. [2022-02-21 03:24:10,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 45 letters. [2022-02-21 03:24:10,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 30 letters. Loop has 72 letters. [2022-02-21 03:24:10,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 30 letters. Loop has 72 letters. [2022-02-21 03:24:10,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 30 letters. Loop has 72 letters. [2022-02-21 03:24:10,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 45 letters. [2022-02-21 03:24:10,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 45 letters. [2022-02-21 03:24:10,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 45 letters. [2022-02-21 03:24:10,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 69 letters. Loop has 45 letters. [2022-02-21 03:24:10,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 69 letters. Loop has 45 letters. [2022-02-21 03:24:10,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 69 letters. Loop has 45 letters. [2022-02-21 03:24:10,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:24:10,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:24:10,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:24:10,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 99 letters. [2022-02-21 03:24:10,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 99 letters. [2022-02-21 03:24:10,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 32 letters. Loop has 99 letters. [2022-02-21 03:24:10,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 59 letters. [2022-02-21 03:24:10,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 59 letters. [2022-02-21 03:24:10,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 32 letters. Loop has 59 letters. [2022-02-21 03:24:10,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 157 letters. [2022-02-21 03:24:10,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 157 letters. [2022-02-21 03:24:10,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 157 letters. [2022-02-21 03:24:10,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 93 letters. [2022-02-21 03:24:10,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 93 letters. [2022-02-21 03:24:10,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 93 letters. [2022-02-21 03:24:10,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 160 letters. [2022-02-21 03:24:10,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 160 letters. [2022-02-21 03:24:10,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 160 letters. [2022-02-21 03:24:10,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 96 letters. [2022-02-21 03:24:10,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 96 letters. [2022-02-21 03:24:10,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 96 letters. [2022-02-21 03:24:10,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 133 letters. [2022-02-21 03:24:10,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 133 letters. [2022-02-21 03:24:10,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 133 letters. [2022-02-21 03:24:10,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 69 letters. [2022-02-21 03:24:10,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 69 letters. [2022-02-21 03:24:10,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 69 letters. [2022-02-21 03:24:10,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:24:10,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:24:10,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 32 letters. Loop has 72 letters. [2022-02-21 03:24:10,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 45 letters. [2022-02-21 03:24:10,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 45 letters. [2022-02-21 03:24:10,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 32 letters. Loop has 45 letters. [2022-02-21 03:24:10,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 45 letters. [2022-02-21 03:24:10,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 45 letters. [2022-02-21 03:24:10,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 45 letters. [2022-02-21 03:24:10,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 61 letters. [2022-02-21 03:24:10,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 61 letters. [2022-02-21 03:24:10,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 61 letters. [2022-02-21 03:24:10,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 136 letters. [2022-02-21 03:24:10,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 136 letters. [2022-02-21 03:24:10,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 136 letters. [2022-02-21 03:24:10,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 72 letters. [2022-02-21 03:24:10,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 72 letters. [2022-02-21 03:24:10,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 72 letters. [2022-02-21 03:24:10,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 96 letters. [2022-02-21 03:24:10,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 96 letters. [2022-02-21 03:24:10,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 32 letters. Loop has 96 letters. [2022-02-21 03:24:10,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 139 letters. [2022-02-21 03:24:10,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 139 letters. [2022-02-21 03:24:10,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 139 letters. [2022-02-21 03:24:10,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 138 letters. Loop has 75 letters. [2022-02-21 03:24:10,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 138 letters. Loop has 75 letters. [2022-02-21 03:24:10,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 138 letters. Loop has 75 letters. [2022-02-21 03:24:10,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 62 letters. [2022-02-21 03:24:10,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 62 letters. [2022-02-21 03:24:10,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 32 letters. Loop has 62 letters. [2022-02-21 03:24:10,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 48 letters. [2022-02-21 03:24:10,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 32 letters. Loop has 48 letters. [2022-02-21 03:24:10,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 32 letters. Loop has 48 letters. [2022-02-21 03:24:10,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 156 letters. Loop has 61 letters. [2022-02-21 03:24:10,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 156 letters. Loop has 61 letters. [2022-02-21 03:24:10,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 156 letters. Loop has 61 letters. [2022-02-21 03:24:10,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 118 letters. Loop has 72 letters. [2022-02-21 03:24:10,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 118 letters. Loop has 72 letters. [2022-02-21 03:24:10,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 118 letters. Loop has 72 letters. [2022-02-21 03:24:10,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 157 letters. Loop has 61 letters. [2022-02-21 03:24:10,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 157 letters. Loop has 61 letters. [2022-02-21 03:24:10,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 157 letters. Loop has 61 letters. [2022-02-21 03:24:10,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 61 letters. [2022-02-21 03:24:10,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 61 letters. [2022-02-21 03:24:10,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 61 letters. [2022-02-21 03:24:10,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 97 letters. Loop has 64 letters. [2022-02-21 03:24:10,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 97 letters. Loop has 64 letters. [2022-02-21 03:24:10,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 97 letters. Loop has 64 letters. [2022-02-21 03:24:10,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 72 letters. [2022-02-21 03:24:10,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 72 letters. [2022-02-21 03:24:10,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 120 letters. Loop has 72 letters. [2022-02-21 03:24:10,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 155 letters. Loop has 61 letters. [2022-02-21 03:24:10,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 155 letters. Loop has 61 letters. [2022-02-21 03:24:10,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 155 letters. Loop has 61 letters. [2022-02-21 03:24:10,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 59 letters. [2022-02-21 03:24:10,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 59 letters. [2022-02-21 03:24:10,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 120 letters. Loop has 59 letters. [2022-02-21 03:24:10,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 139 letters. [2022-02-21 03:24:10,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 139 letters. [2022-02-21 03:24:10,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 139 letters. [2022-02-21 03:24:10,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 75 letters. [2022-02-21 03:24:10,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 75 letters. [2022-02-21 03:24:10,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 75 letters. [2022-02-21 03:24:10,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 136 letters. [2022-02-21 03:24:10,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 136 letters. [2022-02-21 03:24:10,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 136 letters. [2022-02-21 03:24:10,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 72 letters. [2022-02-21 03:24:10,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 72 letters. [2022-02-21 03:24:10,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 72 letters. [2022-02-21 03:24:10,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 69 letters. [2022-02-21 03:24:10,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 69 letters. [2022-02-21 03:24:10,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 69 letters. [2022-02-21 03:24:10,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 133 letters. [2022-02-21 03:24:10,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 133 letters. [2022-02-21 03:24:10,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 133 letters. [2022-02-21 03:24:10,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 99 letters. [2022-02-21 03:24:10,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 99 letters. [2022-02-21 03:24:10,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 120 letters. Loop has 99 letters. [2022-02-21 03:24:10,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 62 letters. [2022-02-21 03:24:10,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 62 letters. [2022-02-21 03:24:10,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 120 letters. Loop has 62 letters. [2022-02-21 03:24:10,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 160 letters. [2022-02-21 03:24:10,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 160 letters. [2022-02-21 03:24:10,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 160 letters. [2022-02-21 03:24:10,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 96 letters. [2022-02-21 03:24:10,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 96 letters. [2022-02-21 03:24:10,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 96 letters. [2022-02-21 03:24:10,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 61 letters. [2022-02-21 03:24:10,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 61 letters. [2022-02-21 03:24:10,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 120 letters. Loop has 61 letters. [2022-02-21 03:24:10,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 72 letters. [2022-02-21 03:24:10,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 72 letters. [2022-02-21 03:24:10,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 120 letters. Loop has 72 letters. [2022-02-21 03:24:10,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 96 letters. [2022-02-21 03:24:10,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 96 letters. [2022-02-21 03:24:10,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 120 letters. Loop has 96 letters. [2022-02-21 03:24:10,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 61 letters. [2022-02-21 03:24:10,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 61 letters. [2022-02-21 03:24:10,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 61 letters. [2022-02-21 03:24:10,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 45 letters. [2022-02-21 03:24:10,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 45 letters. [2022-02-21 03:24:10,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 45 letters. [2022-02-21 03:24:10,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 120 letters. Loop has 64 letters. [2022-02-21 03:24:10,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 120 letters. Loop has 64 letters. [2022-02-21 03:24:10,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 120 letters. Loop has 64 letters. [2022-02-21 03:24:10,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 93 letters. [2022-02-21 03:24:10,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 93 letters. [2022-02-21 03:24:10,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 93 letters. [2022-02-21 03:24:10,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 226 letters. Loop has 157 letters. [2022-02-21 03:24:10,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 226 letters. Loop has 157 letters. [2022-02-21 03:24:10,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 226 letters. Loop has 157 letters. [2022-02-21 03:24:10,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 91 letters. Loop has 88 letters. [2022-02-21 03:24:10,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 91 letters. Loop has 88 letters. [2022-02-21 03:24:10,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 91 letters. Loop has 88 letters. [2022-02-21 03:24:10,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 92 letters. Loop has 88 letters. [2022-02-21 03:24:10,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 92 letters. Loop has 88 letters. [2022-02-21 03:24:10,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 92 letters. Loop has 88 letters. [2022-02-21 03:24:10,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 178 letters. Loop has 88 letters. [2022-02-21 03:24:10,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 178 letters. Loop has 88 letters. [2022-02-21 03:24:10,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 178 letters. Loop has 88 letters. [2022-02-21 03:24:10,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 93 letters. Loop has 88 letters. [2022-02-21 03:24:10,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 93 letters. Loop has 88 letters. [2022-02-21 03:24:10,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 93 letters. Loop has 88 letters. [2022-02-21 03:24:10,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 93 states and 115 transitions. cyclomatic complexity: 26 Stem has 178 letters. Loop has 88 letters. [2022-02-21 03:24:10,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Stem has 178 letters. Loop has 88 letters. [2022-02-21 03:24:10,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 516 transitions. cyclomatic complexity: 112 Stem has 178 letters. Loop has 88 letters. [2022-02-21 03:24:10,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,406 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-21 03:24:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 50 transitions. [2022-02-21 03:24:10,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 50 transitions. Stem has 30 letters. Loop has 24 letters. [2022-02-21 03:24:10,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 50 transitions. Stem has 54 letters. Loop has 24 letters. [2022-02-21 03:24:10,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 50 transitions. Stem has 30 letters. Loop has 48 letters. [2022-02-21 03:24:10,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:10,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 410 states and 516 transitions. cyclomatic complexity: 112 [2022-02-21 03:24:10,417 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2022-02-21 03:24:10,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 410 states to 254 states and 346 transitions. [2022-02-21 03:24:10,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2022-02-21 03:24:10,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2022-02-21 03:24:10,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 346 transitions. [2022-02-21 03:24:10,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:10,423 INFO L681 BuchiCegarLoop]: Abstraction has 254 states and 346 transitions. [2022-02-21 03:24:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 346 transitions. [2022-02-21 03:24:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2022-02-21 03:24:10,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:10,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states and 346 transitions. Second operand has 217 states, 127 states have (on average 1.125984251968504) internal successors, (143), 139 states have internal predecessors, (143), 51 states have call successors, (52), 34 states have call predecessors, (52), 39 states have return successors, (76), 43 states have call predecessors, (76), 49 states have call successors, (76) [2022-02-21 03:24:10,428 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states and 346 transitions. Second operand has 217 states, 127 states have (on average 1.125984251968504) internal successors, (143), 139 states have internal predecessors, (143), 51 states have call successors, (52), 34 states have call predecessors, (52), 39 states have return successors, (76), 43 states have call predecessors, (76), 49 states have call successors, (76) [2022-02-21 03:24:10,428 INFO L87 Difference]: Start difference. First operand 254 states and 346 transitions. Second operand has 217 states, 127 states have (on average 1.125984251968504) internal successors, (143), 139 states have internal predecessors, (143), 51 states have call successors, (52), 34 states have call predecessors, (52), 39 states have return successors, (76), 43 states have call predecessors, (76), 49 states have call successors, (76) [2022-02-21 03:24:10,428 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:10,443 INFO L93 Difference]: Finished difference Result 506 states and 745 transitions. [2022-02-21 03:24:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 745 transitions. [2022-02-21 03:24:10,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:10,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:10,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 127 states have (on average 1.125984251968504) internal successors, (143), 139 states have internal predecessors, (143), 51 states have call successors, (52), 34 states have call predecessors, (52), 39 states have return successors, (76), 43 states have call predecessors, (76), 49 states have call successors, (76) Second operand 254 states and 346 transitions. [2022-02-21 03:24:10,446 INFO L87 Difference]: Start difference. First operand has 217 states, 127 states have (on average 1.125984251968504) internal successors, (143), 139 states have internal predecessors, (143), 51 states have call successors, (52), 34 states have call predecessors, (52), 39 states have return successors, (76), 43 states have call predecessors, (76), 49 states have call successors, (76) Second operand 254 states and 346 transitions. [2022-02-21 03:24:10,446 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:10,472 INFO L93 Difference]: Finished difference Result 716 states and 1086 transitions. [2022-02-21 03:24:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1086 transitions. [2022-02-21 03:24:10,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:10,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:10,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:10,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 127 states have (on average 1.125984251968504) internal successors, (143), 139 states have internal predecessors, (143), 51 states have call successors, (52), 34 states have call predecessors, (52), 39 states have return successors, (76), 43 states have call predecessors, (76), 49 states have call successors, (76) [2022-02-21 03:24:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 271 transitions. [2022-02-21 03:24:10,479 INFO L704 BuchiCegarLoop]: Abstraction has 217 states and 271 transitions. [2022-02-21 03:24:10,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:10,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:24:10,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:24:10,480 INFO L87 Difference]: Start difference. First operand 217 states and 271 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-21 03:24:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:10,573 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-02-21 03:24:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:24:10,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-21 03:24:10,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:10,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 38 transitions. [2022-02-21 03:24:10,637 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:10,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2022-02-21 03:24:10,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:10,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:10,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:10,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:10,638 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:10,638 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:10,638 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:10,638 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:24:10,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:24:10,638 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:10,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:10,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:10 BoogieIcfgContainer [2022-02-21 03:24:10,653 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:24:10,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:24:10,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:24:10,683 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:24:10,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:43" (3/4) ... [2022-02-21 03:24:10,698 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:24:10,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:24:10,701 INFO L158 Benchmark]: Toolchain (without parser) took 27743.87ms. Allocated memory was 107.0MB in the beginning and 255.9MB in the end (delta: 148.9MB). Free memory was 67.0MB in the beginning and 88.2MB in the end (delta: -21.1MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:10,701 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 107.0MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:10,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.47ms. Allocated memory is still 107.0MB. Free memory was 66.8MB in the beginning and 82.6MB in the end (delta: -15.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:24:10,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.90ms. Allocated memory is still 107.0MB. Free memory was 82.6MB in the beginning and 81.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:10,701 INFO L158 Benchmark]: Boogie Preprocessor took 11.48ms. Allocated memory is still 107.0MB. Free memory was 81.1MB in the beginning and 80.2MB in the end (delta: 940.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:10,701 INFO L158 Benchmark]: RCFGBuilder took 228.54ms. Allocated memory is still 107.0MB. Free memory was 80.2MB in the beginning and 71.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:10,702 INFO L158 Benchmark]: BuchiAutomizer took 27224.67ms. Allocated memory was 107.0MB in the beginning and 255.9MB in the end (delta: 148.9MB). Free memory was 71.2MB in the beginning and 90.3MB in the end (delta: -19.1MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. [2022-02-21 03:24:10,702 INFO L158 Benchmark]: Witness Printer took 46.53ms. Allocated memory is still 255.9MB. Free memory was 90.3MB in the beginning and 88.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:10,703 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.16ms. Allocated memory is still 107.0MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.47ms. Allocated memory is still 107.0MB. Free memory was 66.8MB in the beginning and 82.6MB in the end (delta: -15.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.90ms. Allocated memory is still 107.0MB. Free memory was 82.6MB in the beginning and 81.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.48ms. Allocated memory is still 107.0MB. Free memory was 81.1MB in the beginning and 80.2MB in the end (delta: 940.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 228.54ms. Allocated memory is still 107.0MB. Free memory was 80.2MB in the beginning and 71.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 27224.67ms. Allocated memory was 107.0MB in the beginning and 255.9MB in the end (delta: 148.9MB). Free memory was 71.2MB in the beginning and 90.3MB in the end (delta: -19.1MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. * Witness Printer took 46.53ms. Allocated memory is still 255.9MB. Free memory was 90.3MB in the beginning and 88.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 12 terminating modules (5 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 11 locations. One deterministic module has affine ranking function \old(i) and consists of 4 locations. One deterministic module has affine ranking function \old(i) and consists of 5 locations. One deterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f248c20 and consists of 11 locations. One deterministic module has affine ranking function i and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 15 locations. 5 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.1s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 15.4s. Construction of modules took 1.4s. Büchi inclusion checks took 8.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 1.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 249 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 315 states and ocurred in iteration 5. Nontrivial modules had stage [5, 0, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 38/58 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 369 mSDsluCounter, 880 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 575 mSDsCounter, 410 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 945 IncrementalHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 410 mSolverCounterUnsat, 305 mSDtfsCounter, 945 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT3 conc0 concLT3 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf93 smp100 dnf100 smp100 tf111 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 21 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 8.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:24:10,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:10,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-02-21 03:24:11,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-02-21 03:24:11,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:11,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE