./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0068f83ad7eb3861b59041e8ebf2a38df44c3a60c0fafaf2450f6b793a60fbe --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:19:45,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:19:45,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:19:45,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:19:45,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:19:45,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:19:45,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:19:45,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:19:45,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:19:45,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:19:45,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:19:45,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:19:45,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:19:45,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:19:45,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:19:45,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:19:45,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:19:45,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:19:45,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:19:45,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:19:45,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:19:45,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:19:45,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:19:45,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:19:45,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:19:45,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:19:45,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:19:45,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:19:45,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:19:45,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:19:45,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:19:45,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:19:45,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:19:45,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:19:45,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:19:45,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:19:45,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:19:45,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:19:45,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:19:45,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:19:45,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:19:45,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:19:45,349 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:19:45,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:19:45,349 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:19:45,350 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:19:45,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:19:45,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:19:45,351 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:19:45,351 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:19:45,351 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:19:45,351 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:19:45,352 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:19:45,352 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:19:45,352 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:19:45,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:19:45,353 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:19:45,353 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:19:45,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:19:45,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:19:45,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:19:45,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:19:45,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:19:45,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:19:45,354 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:19:45,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:19:45,354 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:19:45,354 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:19:45,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:19:45,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:19:45,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:19:45,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:19:45,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:19:45,356 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:19:45,356 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0068f83ad7eb3861b59041e8ebf2a38df44c3a60c0fafaf2450f6b793a60fbe [2022-02-21 04:19:45,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:19:45,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:19:45,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:19:45,572 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:19:45,572 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:19:45,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c [2022-02-21 04:19:45,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e784ba7/d4455024f9b54a128b03a171215db5c1/FLAG5e96b8074 [2022-02-21 04:19:45,963 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:19:45,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c [2022-02-21 04:19:45,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e784ba7/d4455024f9b54a128b03a171215db5c1/FLAG5e96b8074 [2022-02-21 04:19:45,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e784ba7/d4455024f9b54a128b03a171215db5c1 [2022-02-21 04:19:45,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:19:45,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:19:45,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:19:45,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:19:46,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:19:46,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:19:45" (1/1) ... [2022-02-21 04:19:46,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b6d625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46, skipping insertion in model container [2022-02-21 04:19:46,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:19:45" (1/1) ... [2022-02-21 04:19:46,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:19:46,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:19:46,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c[946,959] [2022-02-21 04:19:46,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:19:46,179 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:19:46,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c[946,959] [2022-02-21 04:19:46,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:19:46,206 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:19:46,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46 WrapperNode [2022-02-21 04:19:46,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:19:46,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:19:46,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:19:46,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:19:46,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,231 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-02-21 04:19:46,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:19:46,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:19:46,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:19:46,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:19:46,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:19:46,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:19:46,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:19:46,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:19:46,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (1/1) ... [2022-02-21 04:19:46,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:46,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:46,331 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 04:19:46,333 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 04:19:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:19:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:19:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2022-02-21 04:19:46,358 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2022-02-21 04:19:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2022-02-21 04:19:46,358 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2022-02-21 04:19:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:19:46,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:19:46,396 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:19:46,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:19:46,476 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:19:46,481 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:19:46,481 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 04:19:46,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:46 BoogieIcfgContainer [2022-02-21 04:19:46,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:19:46,484 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:19:46,484 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:19:46,487 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:19:46,488 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:46,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:19:45" (1/3) ... [2022-02-21 04:19:46,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bff0e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:19:46, skipping insertion in model container [2022-02-21 04:19:46,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:46,489 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:46" (2/3) ... [2022-02-21 04:19:46,489 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bff0e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:19:46, skipping insertion in model container [2022-02-21 04:19:46,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:46,490 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:46" (3/3) ... [2022-02-21 04:19:46,491 INFO L388 chiAutomizerObserver]: Analyzing ICFG fibo_2calls_6-1.c [2022-02-21 04:19:46,535 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:19:46,535 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:19:46,535 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:19:46,535 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:19:46,536 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:19:46,536 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:19:46,536 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:19:46,536 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:19:46,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 04:19:46,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:46,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:46,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:46,579 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 04:19:46,579 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:46,579 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:19:46,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 04:19:46,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:46,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:46,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:46,596 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 04:19:46,596 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:46,601 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; 15#L39true call main_#t~ret8#1 := fibo1(main_~x~0#1);< 5#fibo1ENTRYtrue [2022-02-21 04:19:46,603 INFO L793 eck$LassoCheckResult]: Loop: 5#fibo1ENTRYtrue ~n := #in~n; 9#L10true assume !(~n < 1); 8#L12true assume !(1 == ~n); 10#L15true call #t~ret4 := fibo2(~n - 1);< 14#fibo2ENTRYtrue ~n := #in~n; 12#L20true assume !(~n < 1); 17#L22true assume !(1 == ~n); 23#L25true call #t~ret6 := fibo1(~n - 1);< 5#fibo1ENTRYtrue [2022-02-21 04:19:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash 29896, now seen corresponding path program 1 times [2022-02-21 04:19:46,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:46,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660576485] [2022-02-21 04:19:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:46,690 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:46,719 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:46,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:46,722 INFO L85 PathProgramCache]: Analyzing trace with hash 181289832, now seen corresponding path program 1 times [2022-02-21 04:19:46,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:46,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153616137] [2022-02-21 04:19:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:46,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:46,741 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:46,759 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:46,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1313669423, now seen corresponding path program 1 times [2022-02-21 04:19:46,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:46,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127269550] [2022-02-21 04:19:46,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:46,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:46,808 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:47,159 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:47,159 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:47,159 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:47,159 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:47,160 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:47,160 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,160 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:47,160 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:47,160 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-1.c_Iteration1_Loop [2022-02-21 04:19:47,160 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:47,161 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:47,170 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 04:19:47,175 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 04:19:47,180 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 04:19:47,184 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 04:19:47,187 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 04:19:47,191 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 04:19:47,193 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 04:19:47,196 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 04:19:47,199 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 04:19:47,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 04:19:47,295 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:47,295 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:47,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,300 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 04:19:47,302 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 04:19:47,302 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,303 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,322 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,322 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,340 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 04:19:47,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,342 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 04:19:47,344 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 04:19:47,345 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,345 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,366 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,366 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,385 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 04:19:47,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,386 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 04:19:47,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,412 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 04:19:47,421 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,421 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,440 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 04:19:47,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,442 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 04:19:47,443 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 04:19:47,444 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,444 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,465 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,466 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret4=0} Honda state: {fibo1_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,483 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 04:19:47,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,485 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 04:19:47,486 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 04:19:47,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,509 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,509 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret6=0} Honda state: {fibo2_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,527 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 04:19:47,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,529 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 04:19:47,530 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 04:19:47,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,553 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,553 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:47,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,588 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 04:19:47,589 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 04:19:47,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,611 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,612 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret5=0} Honda state: {fibo1_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,630 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 04:19:47,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,632 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 04:19:47,633 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 04:19:47,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,655 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:47,655 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret7=0} Honda state: {fibo2_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:47,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:47,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,687 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 04:19:47,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:47,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,703 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 04:19:47,727 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 04:19:47,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,728 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 04:19:47,728 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 04:19:47,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:47,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:47,776 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:47,779 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 04:19:47,779 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:47,779 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:47,780 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:47,780 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:47,780 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:47,780 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,780 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:47,780 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:47,780 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-1.c_Iteration1_Loop [2022-02-21 04:19:47,780 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:47,780 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:47,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 04:19:47,799 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 04:19:47,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 04:19:47,804 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 04:19:47,810 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 04:19:47,814 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 04:19:47,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 04:19:47,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 04:19:47,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 04:19:47,831 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 04:19:47,921 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:47,924 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:47,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:47,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:47,926 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 04:19:47,946 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 04:19:47,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:47,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:47,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:47,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:47,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:47,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:47,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:47,959 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 04:19:47,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,013 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 04:19:48,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,015 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 04:19:48,021 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 04:19:48,021 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 04:19:48,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,029 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:48,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,045 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 04:19:48,046 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 04:19:48,047 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 04:19:48,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,074 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 04:19:48,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,076 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 04:19:48,078 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 04:19:48,079 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 04:19:48,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,116 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 04:19:48,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,117 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 04:19:48,118 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 04:19:48,119 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 04:19:48,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,142 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 04:19:48,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,144 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 04:19:48,149 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 04:19:48,149 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 04:19:48,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:48,206 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 04:19:48,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,208 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 04:19:48,208 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 04:19:48,210 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 04:19:48,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:48,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:48,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:48,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:48,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:48,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:48,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:48,225 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:48,228 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:48,228 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:48,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:48,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:48,230 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 04:19:48,231 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 04:19:48,235 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:48,235 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:48,235 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:48,236 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_#in~n) = 1*fibo1_#in~n Supporting invariants [] [2022-02-21 04:19:48,254 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 04:19:48,267 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:48,271 INFO L390 LassoCheck]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< [2022-02-21 04:19:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:19:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:48,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {36#unseeded} is VALID [2022-02-21 04:19:48,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {36#unseeded} is VALID [2022-02-21 04:19:48,331 INFO L272 TraceCheckUtils]: 2: Hoare triple {36#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {36#unseeded} is VALID [2022-02-21 04:19:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:48,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:48,398 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 04:19:48,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(>= oldRank0 |fibo1_#in~n|)} ~n := #in~n; {60#(<= fibo1_~n oldRank0)} is VALID [2022-02-21 04:19:48,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(<= fibo1_~n oldRank0)} assume !(~n < 1); {60#(<= fibo1_~n oldRank0)} is VALID [2022-02-21 04:19:48,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#(<= fibo1_~n oldRank0)} assume !(1 == ~n); {60#(<= fibo1_~n oldRank0)} is VALID [2022-02-21 04:19:48,513 INFO L272 TraceCheckUtils]: 3: Hoare triple {60#(<= fibo1_~n oldRank0)} call #t~ret4 := fibo2(~n - 1); {70#(<= (+ |fibo2_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:19:48,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {70#(<= (+ |fibo2_#in~n| 1) oldRank0)} ~n := #in~n; {74#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:19:48,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {74#(<= (+ fibo2_~n 1) oldRank0)} assume !(~n < 1); {78#(and (not (< fibo2_~n 1)) (<= (+ fibo2_~n 1) oldRank0))} is VALID [2022-02-21 04:19:48,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {78#(and (not (< fibo2_~n 1)) (<= (+ fibo2_~n 1) oldRank0))} assume !(1 == ~n); {78#(and (not (< fibo2_~n 1)) (<= (+ fibo2_~n 1) oldRank0))} is VALID [2022-02-21 04:19:48,516 INFO L272 TraceCheckUtils]: 7: Hoare triple {78#(and (not (< fibo2_~n 1)) (<= (+ fibo2_~n 1) oldRank0))} call #t~ret6 := fibo1(~n - 1); {49#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo1_#in~n|)))} is VALID [2022-02-21 04:19:48,516 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 04:19:48,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:48,546 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 04:19:48,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:48,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,552 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-02-21 04:19:48,553 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:48,816 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5). Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 116 transitions. Complement of second has 24 states. [2022-02-21 04:19:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:48,816 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:48,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 04:19:48,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:48,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:48,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:48,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:48,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:48,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:48,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:48,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 116 transitions. [2022-02-21 04:19:48,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:48,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:48,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:48,827 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 04:19:48,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:48,831 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 04:19:48,847 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:48,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:48,849 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:48,849 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 84 states and 116 transitions. cyclomatic complexity: 34 [2022-02-21 04:19:48,854 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 04:19:48,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:48,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:48,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:48,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 1 letters. Loop has 5 letters. [2022-02-21 04:19:48,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 5 letters. [2022-02-21 04:19:48,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 5 letters. [2022-02-21 04:19:48,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 15 letters. Loop has 25 letters. [2022-02-21 04:19:48,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 25 letters. [2022-02-21 04:19:48,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 25 letters. [2022-02-21 04:19:48,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 84 letters. Loop has 84 letters. [2022-02-21 04:19:48,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 84 letters. [2022-02-21 04:19:48,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 84 letters. Loop has 84 letters. [2022-02-21 04:19:48,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:19:48,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:19:48,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 26 letters. Loop has 26 letters. [2022-02-21 04:19:48,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:19:48,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:19:48,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:19:48,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:48,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:48,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:48,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:19:48,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:19:48,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 8 letters. [2022-02-21 04:19:48,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 5 letters. Loop has 8 letters. [2022-02-21 04:19:48,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 8 letters. [2022-02-21 04:19:48,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 8 letters. [2022-02-21 04:19:48,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 4 letters. Loop has 8 letters. [2022-02-21 04:19:48,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 8 letters. [2022-02-21 04:19:48,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 8 letters. [2022-02-21 04:19:48,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 7 letters. Loop has 8 letters. [2022-02-21 04:19:48,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 8 letters. [2022-02-21 04:19:48,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 8 letters. [2022-02-21 04:19:48,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:48,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:48,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:48,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 11 letters. Loop has 13 letters. [2022-02-21 04:19:48,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 13 letters. [2022-02-21 04:19:48,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 13 letters. [2022-02-21 04:19:48,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 15 letters. Loop has 13 letters. [2022-02-21 04:19:48,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 13 letters. [2022-02-21 04:19:48,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 13 letters. [2022-02-21 04:19:48,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:19:48,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:19:48,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 8 letters. [2022-02-21 04:19:48,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 6 letters. Loop has 8 letters. [2022-02-21 04:19:48,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 8 letters. [2022-02-21 04:19:48,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 8 letters. [2022-02-21 04:19:48,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 15 letters. Loop has 13 letters. [2022-02-21 04:19:48,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 13 letters. [2022-02-21 04:19:48,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 13 letters. [2022-02-21 04:19:48,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 11 letters. Loop has 13 letters. [2022-02-21 04:19:48,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 13 letters. [2022-02-21 04:19:48,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 13 letters. [2022-02-21 04:19:48,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 1 letters. Loop has 5 letters. [2022-02-21 04:19:48,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 5 letters. [2022-02-21 04:19:48,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 5 letters. [2022-02-21 04:19:48,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:19:48,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:19:48,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:19:48,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 15 letters. Loop has 25 letters. [2022-02-21 04:19:48,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 25 letters. [2022-02-21 04:19:48,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 25 letters. [2022-02-21 04:19:48,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:19:48,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:19:48,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:19:48,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 35 letters. Loop has 25 letters. [2022-02-21 04:19:48,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 25 letters. [2022-02-21 04:19:48,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 35 letters. Loop has 25 letters. [2022-02-21 04:19:48,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:19:48,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:19:48,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:19:48,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:19:48,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:48,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 8 letters. [2022-02-21 04:19:48,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:19:48,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:19:48,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:19:48,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:19:48,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:19:48,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:19:48,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:19:48,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:19:48,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:19:48,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:19:48,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:19:48,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:19:48,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 15 letters. Loop has 49 letters. [2022-02-21 04:19:48,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 49 letters. [2022-02-21 04:19:48,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 49 letters. [2022-02-21 04:19:48,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Stem has 35 letters. Loop has 49 letters. [2022-02-21 04:19:48,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 49 letters. [2022-02-21 04:19:48,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 116 transitions. cyclomatic complexity: 34 Stem has 35 letters. Loop has 49 letters. [2022-02-21 04:19:48,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,889 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-02-21 04:19:48,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 8 letters. [2022-02-21 04:19:48,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2022-02-21 04:19:48,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 3 letters. Loop has 16 letters. [2022-02-21 04:19:48,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:48,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 116 transitions. cyclomatic complexity: 34 [2022-02-21 04:19:48,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:48,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 61 states and 82 transitions. [2022-02-21 04:19:48,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-02-21 04:19:48,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-02-21 04:19:48,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 82 transitions. [2022-02-21 04:19:48,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:48,912 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2022-02-21 04:19:48,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 82 transitions. [2022-02-21 04:19:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2022-02-21 04:19:48,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:48,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states and 82 transitions. Second operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 04:19:48,932 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states and 82 transitions. Second operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 04:19:48,933 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 04:19:48,935 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:48,943 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2022-02-21 04:19:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2022-02-21 04:19:48,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:48,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:48,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Second operand 61 states and 82 transitions. [2022-02-21 04:19:48,946 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Second operand 61 states and 82 transitions. [2022-02-21 04:19:48,946 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:48,955 INFO L93 Difference]: Finished difference Result 128 states and 169 transitions. [2022-02-21 04:19:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 169 transitions. [2022-02-21 04:19:48,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:48,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:48,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:48,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2022-02-21 04:19:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2022-02-21 04:19:48,961 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2022-02-21 04:19:48,961 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2022-02-21 04:19:48,961 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:19:48,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 72 transitions. [2022-02-21 04:19:48,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:48,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:48,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:48,962 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:48,962 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:48,962 INFO L791 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 203#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; 220#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 219#fibo1ENTRY ~n := #in~n; 221#L10 assume !(~n < 1); 232#L12 assume !(1 == ~n); 217#L15 call #t~ret4 := fibo2(~n - 1);< 237#fibo2ENTRY ~n := #in~n; 242#L20 assume !(~n < 1); 255#L22 assume !(1 == ~n); 210#L25 call #t~ret6 := fibo1(~n - 1);< 222#fibo1ENTRY ~n := #in~n; 224#L10 assume ~n < 1;#res := 0; 211#fibo1FINAL assume true; 212#fibo1EXIT >#46#return; 213#L25-1 [2022-02-21 04:19:48,963 INFO L793 eck$LassoCheckResult]: Loop: 213#L25-1 call #t~ret7 := fibo1(~n - 2);< 218#fibo1ENTRY ~n := #in~n; 246#L10 assume !(~n < 1); 247#L12 assume !(1 == ~n); 216#L15 call #t~ret4 := fibo2(~n - 1);< 249#fibo2ENTRY ~n := #in~n; 248#L20 assume !(~n < 1); 245#L22 assume !(1 == ~n); 225#L25 call #t~ret6 := fibo1(~n - 1);< 218#fibo1ENTRY ~n := #in~n; 246#L10 assume ~n < 1;#res := 0; 243#fibo1FINAL assume true; 244#fibo1EXIT >#46#return; 213#L25-1 [2022-02-21 04:19:48,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:48,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1888024054, now seen corresponding path program 1 times [2022-02-21 04:19:48,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:48,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340798802] [2022-02-21 04:19:48,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:48,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 04:19:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {743#true} ~n := #in~n; {751#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {751#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {752#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:49,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {752#(<= |fibo1_#in~n| 0)} assume true; {752#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:49,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {752#(<= |fibo1_#in~n| 0)} {746#(not (<= fibo2_~n 1))} #46#return; {744#false} is VALID [2022-02-21 04:19:49,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {743#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {743#true} is VALID [2022-02-21 04:19:49,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {743#true} is VALID [2022-02-21 04:19:49,066 INFO L272 TraceCheckUtils]: 2: Hoare triple {743#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {743#true} is VALID [2022-02-21 04:19:49,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {743#true} ~n := #in~n; {743#true} is VALID [2022-02-21 04:19:49,066 INFO L290 TraceCheckUtils]: 4: Hoare triple {743#true} assume !(~n < 1); {743#true} is VALID [2022-02-21 04:19:49,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#true} assume !(1 == ~n); {743#true} is VALID [2022-02-21 04:19:49,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {743#true} call #t~ret4 := fibo2(~n - 1); {743#true} is VALID [2022-02-21 04:19:49,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {743#true} ~n := #in~n; {743#true} is VALID [2022-02-21 04:19:49,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {743#true} assume !(~n < 1); {745#(< 0 fibo2_~n)} is VALID [2022-02-21 04:19:49,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {745#(< 0 fibo2_~n)} assume !(1 == ~n); {746#(not (<= fibo2_~n 1))} is VALID [2022-02-21 04:19:49,069 INFO L272 TraceCheckUtils]: 10: Hoare triple {746#(not (<= fibo2_~n 1))} call #t~ret6 := fibo1(~n - 1); {743#true} is VALID [2022-02-21 04:19:49,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {743#true} ~n := #in~n; {751#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {751#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {752#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:49,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {752#(<= |fibo1_#in~n| 0)} assume true; {752#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:49,071 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {752#(<= |fibo1_#in~n| 0)} {746#(not (<= fibo2_~n 1))} #46#return; {744#false} is VALID [2022-02-21 04:19:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:19:49,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:49,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340798802] [2022-02-21 04:19:49,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340798802] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:49,075 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:49,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:49,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721777783] [2022-02-21 04:19:49,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:49,079 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:49,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1730504828, now seen corresponding path program 1 times [2022-02-21 04:19:49,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:49,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314960026] [2022-02-21 04:19:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 04:19:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#true} ~n := #in~n; {761#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {761#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {762#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:49,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {762#(<= |fibo1_#in~n| 0)} assume true; {762#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:49,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {762#(<= |fibo1_#in~n| 0)} {756#(not (<= fibo2_~n 1))} #46#return; {754#false} is VALID [2022-02-21 04:19:49,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {753#true} call #t~ret7 := fibo1(~n - 2); {753#true} is VALID [2022-02-21 04:19:49,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#true} ~n := #in~n; {753#true} is VALID [2022-02-21 04:19:49,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {753#true} assume !(~n < 1); {753#true} is VALID [2022-02-21 04:19:49,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {753#true} assume !(1 == ~n); {753#true} is VALID [2022-02-21 04:19:49,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {753#true} call #t~ret4 := fibo2(~n - 1); {753#true} is VALID [2022-02-21 04:19:49,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {753#true} ~n := #in~n; {753#true} is VALID [2022-02-21 04:19:49,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {753#true} assume !(~n < 1); {755#(< 0 fibo2_~n)} is VALID [2022-02-21 04:19:49,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {755#(< 0 fibo2_~n)} assume !(1 == ~n); {756#(not (<= fibo2_~n 1))} is VALID [2022-02-21 04:19:49,148 INFO L272 TraceCheckUtils]: 8: Hoare triple {756#(not (<= fibo2_~n 1))} call #t~ret6 := fibo1(~n - 1); {753#true} is VALID [2022-02-21 04:19:49,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {753#true} ~n := #in~n; {761#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {761#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {762#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:49,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {762#(<= |fibo1_#in~n| 0)} assume true; {762#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:19:49,150 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {762#(<= |fibo1_#in~n| 0)} {756#(not (<= fibo2_~n 1))} #46#return; {754#false} is VALID [2022-02-21 04:19:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:19:49,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:49,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314960026] [2022-02-21 04:19:49,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314960026] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:49,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:49,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:49,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047588178] [2022-02-21 04:19:49,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:49,151 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:19:49,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:49,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 04:19:49,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 04:19:49,154 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. cyclomatic complexity: 20 Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 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 04:19:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:49,277 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2022-02-21 04:19:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:19:49,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 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 04:19:49,287 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 04:19:49,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2022-02-21 04:19:49,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:49,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 86 transitions. [2022-02-21 04:19:49,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-02-21 04:19:49,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-02-21 04:19:49,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 86 transitions. [2022-02-21 04:19:49,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:49,294 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 86 transitions. [2022-02-21 04:19:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 86 transitions. [2022-02-21 04:19:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2022-02-21 04:19:49,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:49,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states and 86 transitions. Second operand has 58 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 04:19:49,297 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states and 86 transitions. Second operand has 58 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 04:19:49,297 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 58 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 04:19:49,298 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:49,304 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-02-21 04:19:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-02-21 04:19:49,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:49,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:49,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) Second operand 66 states and 86 transitions. [2022-02-21 04:19:49,306 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) Second operand 66 states and 86 transitions. [2022-02-21 04:19:49,306 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:49,312 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-02-21 04:19:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2022-02-21 04:19:49,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:49,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:49,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:49,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (16), 7 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 04:19:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-02-21 04:19:49,315 INFO L704 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-02-21 04:19:49,315 INFO L587 BuchiCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-02-21 04:19:49,315 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:19:49,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. [2022-02-21 04:19:49,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2022-02-21 04:19:49,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:49,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:49,316 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:49,316 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:49,316 INFO L791 eck$LassoCheckResult]: Stem: 833#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 834#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; 856#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 874#fibo1ENTRY ~n := #in~n; 886#L10 assume !(~n < 1); 885#L12 assume !(1 == ~n); 846#L15 call #t~ret4 := fibo2(~n - 1);< 868#fibo2ENTRY ~n := #in~n; 889#L20 assume !(~n < 1); 890#L22 assume !(1 == ~n); 841#L25 call #t~ret6 := fibo1(~n - 1);< 852#fibo1ENTRY ~n := #in~n; 853#L10 assume !(~n < 1); 878#L12 assume 1 == ~n;#res := 1; 877#fibo1FINAL assume true; 876#fibo1EXIT >#46#return; 843#L25-1 [2022-02-21 04:19:49,316 INFO L793 eck$LassoCheckResult]: Loop: 843#L25-1 call #t~ret7 := fibo1(~n - 2);< 850#fibo1ENTRY ~n := #in~n; 851#L10 assume !(~n < 1); 860#L12 assume !(1 == ~n); 849#L15 call #t~ret4 := fibo2(~n - 1);< 883#fibo2ENTRY ~n := #in~n; 881#L20 assume !(~n < 1); 879#L22 assume !(1 == ~n); 844#L25 call #t~ret6 := fibo1(~n - 1);< 850#fibo1ENTRY ~n := #in~n; 851#L10 assume !(~n < 1); 860#L12 assume 1 == ~n;#res := 1; 861#fibo1FINAL assume true; 875#fibo1EXIT >#46#return; 843#L25-1 [2022-02-21 04:19:49,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1600771562, now seen corresponding path program 1 times [2022-02-21 04:19:49,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:49,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213177798] [2022-02-21 04:19:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 04:19:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} ~n := #in~n; {1408#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {1408#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1408#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {1408#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:49,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {1409#(<= |fibo1_#in~n| 1)} assume true; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:49,379 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1409#(<= |fibo1_#in~n| 1)} {1402#(<= 5 fibo2_~n)} #46#return; {1397#false} is VALID [2022-02-21 04:19:49,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1396#true} is VALID [2022-02-21 04:19:49,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {1398#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:49,381 INFO L272 TraceCheckUtils]: 2: Hoare triple {1398#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1399#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {1399#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {1400#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:49,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {1400#(<= 6 fibo1_~n)} assume !(~n < 1); {1400#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:49,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {1400#(<= 6 fibo1_~n)} assume !(1 == ~n); {1400#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:49,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {1400#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {1401#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:49,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {1401#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {1402#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:49,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(<= 5 fibo2_~n)} assume !(~n < 1); {1402#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:49,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(<= 5 fibo2_~n)} assume !(1 == ~n); {1402#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:49,383 INFO L272 TraceCheckUtils]: 10: Hoare triple {1402#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {1396#true} is VALID [2022-02-21 04:19:49,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#true} ~n := #in~n; {1408#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {1408#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {1408#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {1408#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:49,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {1409#(<= |fibo1_#in~n| 1)} assume true; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:49,385 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1409#(<= |fibo1_#in~n| 1)} {1402#(<= 5 fibo2_~n)} #46#return; {1397#false} is VALID [2022-02-21 04:19:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:49,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:49,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213177798] [2022-02-21 04:19:49,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213177798] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:49,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153277044] [2022-02-21 04:19:49,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:49,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:49,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:49,387 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:19:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-21 04:19:49,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:49,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:49,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1396#true} is VALID [2022-02-21 04:19:49,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {1398#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:49,523 INFO L272 TraceCheckUtils]: 2: Hoare triple {1398#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1399#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {1399#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {1400#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:49,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {1400#(<= 6 fibo1_~n)} assume !(~n < 1); {1400#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:49,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {1400#(<= 6 fibo1_~n)} assume !(1 == ~n); {1400#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:49,525 INFO L272 TraceCheckUtils]: 6: Hoare triple {1400#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {1401#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:49,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {1401#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {1402#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:49,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(<= 5 fibo2_~n)} assume !(~n < 1); {1402#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:49,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(<= 5 fibo2_~n)} assume !(1 == ~n); {1402#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:49,526 INFO L272 TraceCheckUtils]: 10: Hoare triple {1402#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {1396#true} is VALID [2022-02-21 04:19:49,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#true} ~n := #in~n; {1446#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:49,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {1446#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {1446#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:49,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {1446#(<= |fibo1_#in~n| fibo1_~n)} assume 1 == ~n;#res := 1; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:49,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {1409#(<= |fibo1_#in~n| 1)} assume true; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:49,528 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1409#(<= |fibo1_#in~n| 1)} {1402#(<= 5 fibo2_~n)} #46#return; {1397#false} is VALID [2022-02-21 04:19:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:49,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:49,793 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1409#(<= |fibo1_#in~n| 1)} {1459#(< 2 fibo2_~n)} #46#return; {1397#false} is VALID [2022-02-21 04:19:49,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {1409#(<= |fibo1_#in~n| 1)} assume true; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:49,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {1469#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} assume 1 == ~n;#res := 1; {1409#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:49,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {1469#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} assume !(~n < 1); {1469#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:49,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#true} ~n := #in~n; {1469#(or (<= |fibo1_#in~n| 1) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:49,795 INFO L272 TraceCheckUtils]: 10: Hoare triple {1459#(< 2 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {1396#true} is VALID [2022-02-21 04:19:49,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {1459#(< 2 fibo2_~n)} assume !(1 == ~n); {1459#(< 2 fibo2_~n)} is VALID [2022-02-21 04:19:49,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {1459#(< 2 fibo2_~n)} assume !(~n < 1); {1459#(< 2 fibo2_~n)} is VALID [2022-02-21 04:19:49,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {1485#(< 2 |fibo2_#in~n|)} ~n := #in~n; {1459#(< 2 fibo2_~n)} is VALID [2022-02-21 04:19:49,797 INFO L272 TraceCheckUtils]: 6: Hoare triple {1489#(< 3 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {1485#(< 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:49,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {1489#(< 3 fibo1_~n)} assume !(1 == ~n); {1489#(< 3 fibo1_~n)} is VALID [2022-02-21 04:19:49,798 INFO L290 TraceCheckUtils]: 4: Hoare triple {1489#(< 3 fibo1_~n)} assume !(~n < 1); {1489#(< 3 fibo1_~n)} is VALID [2022-02-21 04:19:49,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {1499#(< 3 |fibo1_#in~n|)} ~n := #in~n; {1489#(< 3 fibo1_~n)} is VALID [2022-02-21 04:19:49,799 INFO L272 TraceCheckUtils]: 2: Hoare triple {1503#(< 3 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1499#(< 3 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:49,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {1503#(< 3 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:49,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {1396#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1396#true} is VALID [2022-02-21 04:19:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:49,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153277044] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:49,800 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:49,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-02-21 04:19:49,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706933725] [2022-02-21 04:19:49,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:49,800 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:49,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:49,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2106067024, now seen corresponding path program 1 times [2022-02-21 04:19:49,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:49,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806636234] [2022-02-21 04:19:49,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:49,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:49,826 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:49,831 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:50,065 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:50,065 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:50,065 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:50,065 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:50,065 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:50,065 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,066 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:50,066 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:50,066 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-1.c_Iteration3_Loop [2022-02-21 04:19:50,066 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:50,066 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:50,066 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 04:19:50,068 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 04:19: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 04:19:50,071 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 04:19:50,072 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 04:19:50,074 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 04:19:50,076 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 04:19: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 04:19:50,084 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 04:19:50,162 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:50,162 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:50,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,163 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 04:19:50,164 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 04:19:50,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,187 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,187 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret4=0} Honda state: {fibo1_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:50,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 04:19:50,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,204 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 04:19:50,205 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 04:19:50,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,206 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,227 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,227 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret5=0} Honda state: {fibo1_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:50,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:50,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,246 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 04:19:50,250 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 04:19:50,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,250 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,256 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,256 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_~n=0} Honda state: {fibo1_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:50,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:50,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,289 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 04:19:50,290 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 04:19:50,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,313 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,313 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret7=0} Honda state: {fibo2_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:50,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:50,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,329 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 04:19:50,330 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 04:19:50,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,332 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,352 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,352 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:50,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 04:19:50,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,377 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 04:19:50,378 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,387 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 04:19:50,396 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,396 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:50,412 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 04:19:50,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,413 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 04:19:50,414 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 04:19:50,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,415 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,436 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:50,436 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:50,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 04:19:50,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,453 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 04:19:50,455 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 04:19:50,455 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:50,455 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:50,476 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 04:19:50,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:50,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:50,477 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 04:19:50,478 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 04:19:50,479 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:50,479 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:51,344 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:51,348 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 04:19:51,348 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:51,348 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:51,348 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:51,348 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:51,348 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:51,348 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,348 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:51,348 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:51,348 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-1.c_Iteration3_Loop [2022-02-21 04:19:51,348 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:51,349 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:51,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 04:19:51,359 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 04:19:51,360 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 04:19:51,362 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 04:19:51,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 04:19:51,366 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 04:19:51,368 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 04:19:51,372 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 04:19:51,375 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 04:19:51,441 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:51,442 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:51,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,443 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 04:19:51,444 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 04:19:51,445 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 04:19:51,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:51,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 04:19:51,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,483 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 04:19:51,483 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 04:19:51,485 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 04:19:51,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:51,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 04:19:51,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,507 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 04:19:51,508 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 04:19:51,510 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 04:19:51,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:51,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 04:19:51,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,540 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 04:19:51,541 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 04:19:51,543 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 04:19:51,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,557 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:51,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 04:19:51,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,573 INFO L229 MonitoredProcess]: Starting monitored process 34 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 04:19:51,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 04:19:51,576 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 04:19:51,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:51,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:51,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,613 INFO L229 MonitoredProcess]: Starting monitored process 35 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 04:19:51,619 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 04:19:51,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 04:19:51,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:51,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:51,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,669 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 04:19:51,672 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 04:19:51,673 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 04:19:51,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:51,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:51,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:51,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:51,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:51,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:51,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:51,696 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:51,699 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:51,699 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:51,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:51,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:51,701 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 04:19:51,702 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 04:19:51,703 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:51,703 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:51,703 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:51,703 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_~n) = 1*fibo2_~n Supporting invariants [] [2022-02-21 04:19:51,721 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 04:19:51,726 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:51,729 INFO L390 LassoCheck]: Loop: "call #t~ret7 := fibo1(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#46#return;" [2022-02-21 04:19:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:51,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:51,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {1509#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1509#unseeded} is VALID [2022-02-21 04:19:51,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {1509#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {1509#unseeded} is VALID [2022-02-21 04:19:51,899 INFO L272 TraceCheckUtils]: 2: Hoare triple {1509#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {1509#unseeded} is VALID [2022-02-21 04:19:51,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {1509#unseeded} ~n := #in~n; {1509#unseeded} is VALID [2022-02-21 04:19:51,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {1509#unseeded} assume !(~n < 1); {1509#unseeded} is VALID [2022-02-21 04:19:51,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {1509#unseeded} assume !(1 == ~n); {1509#unseeded} is VALID [2022-02-21 04:19:51,903 INFO L272 TraceCheckUtils]: 6: Hoare triple {1509#unseeded} call #t~ret4 := fibo2(~n - 1); {1509#unseeded} is VALID [2022-02-21 04:19:51,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {1509#unseeded} ~n := #in~n; {1509#unseeded} is VALID [2022-02-21 04:19:51,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {1509#unseeded} assume !(~n < 1); {1509#unseeded} is VALID [2022-02-21 04:19:51,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {1509#unseeded} assume !(1 == ~n); {1509#unseeded} is VALID [2022-02-21 04:19:51,905 INFO L272 TraceCheckUtils]: 10: Hoare triple {1509#unseeded} call #t~ret6 := fibo1(~n - 1); {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:51,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:51,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:51,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:51,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:51,912 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1557#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1509#unseeded} #46#return; {1509#unseeded} is VALID [2022-02-21 04:19:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:19:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:51,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:52,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {1512#(>= oldRank0 fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {1573#(<= (+ 2 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:19:52,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {1573#(<= (+ 2 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {1577#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:19:52,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {1577#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {1577#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:19:52,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {1577#(<= (+ fibo1_~n 2) oldRank0)} assume !(1 == ~n); {1577#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:19:52,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {1577#(<= (+ fibo1_~n 2) oldRank0)} call #t~ret4 := fibo2(~n - 1); {1587#(<= (+ 3 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:19:52,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {1587#(<= (+ 3 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {1591#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2022-02-21 04:19:52,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {1591#(<= (+ fibo2_~n 3) oldRank0)} assume !(~n < 1); {1591#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2022-02-21 04:19:52,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {1591#(<= (+ fibo2_~n 3) oldRank0)} assume !(1 == ~n); {1591#(<= (+ fibo2_~n 3) oldRank0)} is VALID [2022-02-21 04:19:52,138 INFO L272 TraceCheckUtils]: 8: Hoare triple {1591#(<= (+ fibo2_~n 3) oldRank0)} call #t~ret6 := fibo1(~n - 1); {1601#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:19:52,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {1601#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {1605#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:52,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {1605#(and (<= fibo1_~n |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {1609#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:52,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {1609#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:52,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {1609#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {1609#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:19:52,141 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1609#(and (<= 1 |fibo1_#in~n|) (<= |old(oldRank0)| oldRank0))} {1591#(<= (+ fibo2_~n 3) oldRank0)} #46#return; {1522#(or (and (>= oldRank0 0) (> oldRank0 fibo2_~n)) unseeded)} is VALID [2022-02-21 04:19:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:52,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:52,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:52,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:52,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,161 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2022-02-21 04:19:52,161 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 76 transitions. cyclomatic complexity: 20 Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:52,925 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 76 transitions. cyclomatic complexity: 20. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 191 states and 263 transitions. Complement of second has 40 states. [2022-02-21 04:19:52,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:52,925 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:52,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 76 transitions. cyclomatic complexity: 20 [2022-02-21 04:19:52,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:52,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:52,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:52,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:19:52,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:52,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:52,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 263 transitions. [2022-02-21 04:19:52,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:52,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:52,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:52,940 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 76 transitions. cyclomatic complexity: 20 [2022-02-21 04:19:52,945 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 04:19:52,945 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:52,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:19:52,950 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:52,950 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 191 states and 263 transitions. cyclomatic complexity: 77 [2022-02-21 04:19:52,960 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:52,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:52,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:52,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:52,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:19:52,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:19:52,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:19:52,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:52,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:52,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:52,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 191 letters. Loop has 191 letters. [2022-02-21 04:19:52,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 191 letters. Loop has 191 letters. [2022-02-21 04:19:52,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 191 letters. Loop has 191 letters. [2022-02-21 04:19:52,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 58 letters. Loop has 58 letters. [2022-02-21 04:19:52,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 58 letters. Loop has 58 letters. [2022-02-21 04:19:52,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 58 letters. Loop has 58 letters. [2022-02-21 04:19:52,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:19:52,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:19:52,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:19:52,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 26 letters. [2022-02-21 04:19:52,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 26 letters. [2022-02-21 04:19:52,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 26 letters. [2022-02-21 04:19:52,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:19:52,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:19:52,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 20 letters. Loop has 8 letters. [2022-02-21 04:19:52,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:19:52,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:19:52,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:19:52,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:19:52,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:19:52,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 17 letters. Loop has 8 letters. [2022-02-21 04:19:52,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:19:52,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:19:52,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 18 letters. Loop has 8 letters. [2022-02-21 04:19:52,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:19:52,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:19:52,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:19:52,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:52,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:52,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:52,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:19:52,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:19:52,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 19 letters. Loop has 8 letters. [2022-02-21 04:19:52,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 8 letters. [2022-02-21 04:19:52,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 8 letters. [2022-02-21 04:19:52,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 8 letters. [2022-02-21 04:19:52,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:19:52,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:19:52,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:19:52,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:52,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:52,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:52,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 26 letters. [2022-02-21 04:19:52,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 26 letters. [2022-02-21 04:19:52,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 26 letters. [2022-02-21 04:19:52,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:52,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:52,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:52,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:19:52,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:19:52,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:19:52,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 26 letters. Loop has 8 letters. [2022-02-21 04:19:52,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 26 letters. Loop has 8 letters. [2022-02-21 04:19:52,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 26 letters. Loop has 8 letters. [2022-02-21 04:19:52,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 30 letters. Loop has 8 letters. [2022-02-21 04:19:52,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 30 letters. Loop has 8 letters. [2022-02-21 04:19:52,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 30 letters. Loop has 8 letters. [2022-02-21 04:19:52,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 28 letters. Loop has 8 letters. [2022-02-21 04:19:52,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 28 letters. Loop has 8 letters. [2022-02-21 04:19:52,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 28 letters. Loop has 8 letters. [2022-02-21 04:19:52,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 32 letters. Loop has 8 letters. [2022-02-21 04:19:52,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 32 letters. Loop has 8 letters. [2022-02-21 04:19:52,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 32 letters. Loop has 8 letters. [2022-02-21 04:19:52,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 40 letters. Loop has 25 letters. [2022-02-21 04:19:52,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 40 letters. Loop has 25 letters. [2022-02-21 04:19:52,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 40 letters. Loop has 25 letters. [2022-02-21 04:19:52,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 25 letters. Loop has 8 letters. [2022-02-21 04:19:52,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 25 letters. Loop has 8 letters. [2022-02-21 04:19:52,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 25 letters. Loop has 8 letters. [2022-02-21 04:19:52,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 29 letters. Loop has 8 letters. [2022-02-21 04:19:52,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 29 letters. Loop has 8 letters. [2022-02-21 04:19:52,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 29 letters. Loop has 8 letters. [2022-02-21 04:19:52,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 27 letters. Loop has 8 letters. [2022-02-21 04:19:52,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 27 letters. Loop has 8 letters. [2022-02-21 04:19:52,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 27 letters. Loop has 8 letters. [2022-02-21 04:19:52,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 8 letters. [2022-02-21 04:19:52,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 31 letters. Loop has 8 letters. [2022-02-21 04:19:52,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 31 letters. Loop has 8 letters. [2022-02-21 04:19:52,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:52,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:52,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:52,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 40 letters. Loop has 25 letters. [2022-02-21 04:19:52,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 40 letters. Loop has 25 letters. [2022-02-21 04:19:52,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 40 letters. Loop has 25 letters. [2022-02-21 04:19:52,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:52,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:52,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 13 letters. [2022-02-21 04:19:52,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 24 letters. Loop has 49 letters. [2022-02-21 04:19:52,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 49 letters. [2022-02-21 04:19:52,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 24 letters. Loop has 49 letters. [2022-02-21 04:19:52,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 41 letters. Loop has 13 letters. [2022-02-21 04:19:52,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 41 letters. Loop has 13 letters. [2022-02-21 04:19:52,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 41 letters. Loop has 13 letters. [2022-02-21 04:19:52,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:52,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:52,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 36 letters. Loop has 8 letters. [2022-02-21 04:19:52,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 33 letters. Loop has 8 letters. [2022-02-21 04:19:52,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 33 letters. Loop has 8 letters. [2022-02-21 04:19:52,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 33 letters. Loop has 8 letters. [2022-02-21 04:19:52,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:52,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 32 letters. Loop has 8 letters. [2022-02-21 04:19:53,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 32 letters. Loop has 8 letters. [2022-02-21 04:19:53,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 32 letters. Loop has 8 letters. [2022-02-21 04:19:53,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:19:53,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:19:53,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:19:53,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 35 letters. Loop has 8 letters. [2022-02-21 04:19:53,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 35 letters. Loop has 8 letters. [2022-02-21 04:19:53,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 35 letters. Loop has 8 letters. [2022-02-21 04:19:53,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 8 letters. [2022-02-21 04:19:53,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 31 letters. Loop has 8 letters. [2022-02-21 04:19:53,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 31 letters. Loop has 8 letters. [2022-02-21 04:19:53,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 29 letters. Loop has 8 letters. [2022-02-21 04:19:53,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 29 letters. Loop has 8 letters. [2022-02-21 04:19:53,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 29 letters. Loop has 8 letters. [2022-02-21 04:19:53,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 34 letters. Loop has 8 letters. [2022-02-21 04:19:53,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 34 letters. Loop has 8 letters. [2022-02-21 04:19:53,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 34 letters. Loop has 8 letters. [2022-02-21 04:19:53,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 30 letters. Loop has 8 letters. [2022-02-21 04:19:53,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 30 letters. Loop has 8 letters. [2022-02-21 04:19:53,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 30 letters. Loop has 8 letters. [2022-02-21 04:19:53,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 41 letters. Loop has 13 letters. [2022-02-21 04:19:53,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 41 letters. Loop has 13 letters. [2022-02-21 04:19:53,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 41 letters. Loop has 13 letters. [2022-02-21 04:19:53,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 41 letters. Loop has 26 letters. [2022-02-21 04:19:53,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 41 letters. Loop has 26 letters. [2022-02-21 04:19:53,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 41 letters. Loop has 26 letters. [2022-02-21 04:19:53,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 76 transitions. cyclomatic complexity: 20 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:19:53,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:19:53,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 191 states and 263 transitions. cyclomatic complexity: 77 Stem has 38 letters. Loop has 14 letters. [2022-02-21 04:19:53,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,007 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2022-02-21 04:19:53,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 73 transitions. Stem has 16 letters. Loop has 14 letters. [2022-02-21 04:19:53,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 73 transitions. Stem has 30 letters. Loop has 14 letters. [2022-02-21 04:19:53,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 73 transitions. Stem has 16 letters. Loop has 28 letters. [2022-02-21 04:19:53,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:53,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 263 transitions. cyclomatic complexity: 77 [2022-02-21 04:19:53,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:53,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 169 states and 237 transitions. [2022-02-21 04:19:53,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2022-02-21 04:19:53,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2022-02-21 04:19:53,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 237 transitions. [2022-02-21 04:19:53,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:53,025 INFO L681 BuchiCegarLoop]: Abstraction has 169 states and 237 transitions. [2022-02-21 04:19:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 237 transitions. [2022-02-21 04:19:53,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2022-02-21 04:19:53,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:53,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states and 237 transitions. Second operand has 152 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 102 states have internal predecessors, (122), 35 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (48), 30 states have call predecessors, (48), 33 states have call successors, (48) [2022-02-21 04:19:53,032 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states and 237 transitions. Second operand has 152 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 102 states have internal predecessors, (122), 35 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (48), 30 states have call predecessors, (48), 33 states have call successors, (48) [2022-02-21 04:19:53,032 INFO L87 Difference]: Start difference. First operand 169 states and 237 transitions. Second operand has 152 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 102 states have internal predecessors, (122), 35 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (48), 30 states have call predecessors, (48), 33 states have call successors, (48) [2022-02-21 04:19:53,033 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:53,052 INFO L93 Difference]: Finished difference Result 364 states and 492 transitions. [2022-02-21 04:19:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 492 transitions. [2022-02-21 04:19:53,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:53,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:53,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 102 states have internal predecessors, (122), 35 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (48), 30 states have call predecessors, (48), 33 states have call successors, (48) Second operand 169 states and 237 transitions. [2022-02-21 04:19:53,056 INFO L87 Difference]: Start difference. First operand has 152 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 102 states have internal predecessors, (122), 35 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (48), 30 states have call predecessors, (48), 33 states have call successors, (48) Second operand 169 states and 237 transitions. [2022-02-21 04:19:53,056 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:53,080 INFO L93 Difference]: Finished difference Result 390 states and 526 transitions. [2022-02-21 04:19:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 526 transitions. [2022-02-21 04:19:53,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:53,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:53,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:53,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 102 states have internal predecessors, (122), 35 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (48), 30 states have call predecessors, (48), 33 states have call successors, (48) [2022-02-21 04:19:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 206 transitions. [2022-02-21 04:19:53,087 INFO L704 BuchiCegarLoop]: Abstraction has 152 states and 206 transitions. [2022-02-21 04:19:53,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:53,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 04:19:53,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-02-21 04:19:53,088 INFO L87 Difference]: Start difference. First operand 152 states and 206 transitions. Second operand has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:53,584 INFO L93 Difference]: Finished difference Result 209 states and 276 transitions. [2022-02-21 04:19:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 04:19:53,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 04:19:53,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:53,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 276 transitions. [2022-02-21 04:19:53,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:53,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 200 states and 267 transitions. [2022-02-21 04:19:53,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2022-02-21 04:19:53,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2022-02-21 04:19:53,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 200 states and 267 transitions. [2022-02-21 04:19:53,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:53,622 INFO L681 BuchiCegarLoop]: Abstraction has 200 states and 267 transitions. [2022-02-21 04:19:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states and 267 transitions. [2022-02-21 04:19:53,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 185. [2022-02-21 04:19:53,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:53,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states and 267 transitions. Second operand has 185 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 124 states have internal predecessors, (142), 43 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (62), 37 states have call predecessors, (62), 41 states have call successors, (62) [2022-02-21 04:19:53,653 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states and 267 transitions. Second operand has 185 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 124 states have internal predecessors, (142), 43 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (62), 37 states have call predecessors, (62), 41 states have call successors, (62) [2022-02-21 04:19:53,653 INFO L87 Difference]: Start difference. First operand 200 states and 267 transitions. Second operand has 185 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 124 states have internal predecessors, (142), 43 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (62), 37 states have call predecessors, (62), 41 states have call successors, (62) [2022-02-21 04:19:53,653 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:53,671 INFO L93 Difference]: Finished difference Result 449 states and 615 transitions. [2022-02-21 04:19:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 615 transitions. [2022-02-21 04:19:53,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:53,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:53,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 124 states have internal predecessors, (142), 43 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (62), 37 states have call predecessors, (62), 41 states have call successors, (62) Second operand 200 states and 267 transitions. [2022-02-21 04:19:53,674 INFO L87 Difference]: Start difference. First operand has 185 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 124 states have internal predecessors, (142), 43 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (62), 37 states have call predecessors, (62), 41 states have call successors, (62) Second operand 200 states and 267 transitions. [2022-02-21 04:19:53,674 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:53,690 INFO L93 Difference]: Finished difference Result 449 states and 615 transitions. [2022-02-21 04:19:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 615 transitions. [2022-02-21 04:19:53,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:53,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:53,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:53,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 124 states have internal predecessors, (142), 43 states have call successors, (45), 23 states have call predecessors, (45), 27 states have return successors, (62), 37 states have call predecessors, (62), 41 states have call successors, (62) [2022-02-21 04:19:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 249 transitions. [2022-02-21 04:19:53,696 INFO L704 BuchiCegarLoop]: Abstraction has 185 states and 249 transitions. [2022-02-21 04:19:53,696 INFO L587 BuchiCegarLoop]: Abstraction has 185 states and 249 transitions. [2022-02-21 04:19:53,696 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:19:53,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 249 transitions. [2022-02-21 04:19:53,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-02-21 04:19:53,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:53,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:53,698 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:53,698 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:53,699 INFO L791 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 3544#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; 3577#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 3610#fibo1ENTRY ~n := #in~n; 3649#L10 assume !(~n < 1); 3648#L12 assume !(1 == ~n); 3562#L15 call #t~ret4 := fibo2(~n - 1);< 3647#fibo2ENTRY ~n := #in~n; 3646#L20 assume !(~n < 1); 3645#L22 assume !(1 == ~n); 3573#L25 call #t~ret6 := fibo1(~n - 1);< 3572#fibo1ENTRY ~n := #in~n; 3574#L10 assume !(~n < 1); 3592#L12 assume !(1 == ~n); 3582#L15 call #t~ret4 := fibo2(~n - 1);< 3597#fibo2ENTRY ~n := #in~n; 3604#L20 assume !(~n < 1); 3605#L22 assume !(1 == ~n); 3579#L25 call #t~ret6 := fibo1(~n - 1);< 3643#fibo1ENTRY ~n := #in~n; 3644#L10 assume !(~n < 1); 3654#L12 assume !(1 == ~n); 3655#L15 call #t~ret4 := fibo2(~n - 1);< 3663#fibo2ENTRY ~n := #in~n; 3667#L20 assume ~n < 1;#res := 0; 3666#fibo2FINAL assume true; 3662#fibo2EXIT >#50#return; 3659#L15-1 call #t~ret5 := fibo2(~n - 2);< 3660#fibo2ENTRY ~n := #in~n; 3664#L20 assume ~n < 1;#res := 0; 3661#fibo2FINAL assume true; 3658#fibo2EXIT >#52#return; 3656#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 3657#fibo1FINAL assume true; 3723#fibo1EXIT >#46#return; 3555#L25-1 call #t~ret7 := fibo1(~n - 2);< 3642#fibo1ENTRY ~n := #in~n; 3676#L10 assume ~n < 1;#res := 0; 3554#fibo1FINAL assume true; 3557#fibo1EXIT >#48#return; 3575#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 3583#fibo2FINAL assume true; 3593#fibo2EXIT >#50#return; 3546#L15-1 call #t~ret5 := fibo2(~n - 2);< 3580#fibo2ENTRY [2022-02-21 04:19:53,699 INFO L793 eck$LassoCheckResult]: Loop: 3580#fibo2ENTRY ~n := #in~n; 3669#L20 assume !(~n < 1); 3545#L22 assume !(1 == ~n); 3550#L25 call #t~ret6 := fibo1(~n - 1);< 3563#fibo1ENTRY ~n := #in~n; 3571#L10 assume !(~n < 1); 3590#L12 assume !(1 == ~n); 3548#L15 call #t~ret4 := fibo2(~n - 1);< 3580#fibo2ENTRY [2022-02-21 04:19:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash -960039395, now seen corresponding path program 1 times [2022-02-21 04:19:53,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:53,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231751235] [2022-02-21 04:19:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:53,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 04:19:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} ~n := #in~n; {5382#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:53,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {5382#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:53,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {5383#(<= |fibo2_#in~n| 0)} assume true; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:53,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5383#(<= |fibo2_#in~n| 0)} {5373#(not (<= fibo1_~n 1))} #50#return; {5323#false} is VALID [2022-02-21 04:19:53,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 04:19:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:53,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:53,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5322#true} {5323#false} #52#return; {5323#false} is VALID [2022-02-21 04:19:53,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#true} assume !(~n < 1); {5372#(< 0 fibo1_~n)} is VALID [2022-02-21 04:19:53,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {5372#(< 0 fibo1_~n)} assume !(1 == ~n); {5373#(not (<= fibo1_~n 1))} is VALID [2022-02-21 04:19:53,782 INFO L272 TraceCheckUtils]: 3: Hoare triple {5373#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:53,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {5322#true} ~n := #in~n; {5382#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:53,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {5382#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:53,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {5383#(<= |fibo2_#in~n| 0)} assume true; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:53,783 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5383#(<= |fibo2_#in~n| 0)} {5373#(not (<= fibo1_~n 1))} #50#return; {5323#false} is VALID [2022-02-21 04:19:53,783 INFO L272 TraceCheckUtils]: 8: Hoare triple {5323#false} call #t~ret5 := fibo2(~n - 2); {5322#true} is VALID [2022-02-21 04:19:53,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:53,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:53,784 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5322#true} {5323#false} #52#return; {5323#false} is VALID [2022-02-21 04:19:53,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {5323#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5323#false} is VALID [2022-02-21 04:19:53,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {5323#false} assume true; {5323#false} is VALID [2022-02-21 04:19:53,784 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5323#false} {5322#true} #46#return; {5323#false} is VALID [2022-02-21 04:19:53,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 04:19:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:53,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:53,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5322#true} {5323#false} #48#return; {5323#false} is VALID [2022-02-21 04:19:53,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#true} assume !(~n < 1); {5322#true} is VALID [2022-02-21 04:19:53,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {5322#true} assume !(1 == ~n); {5322#true} is VALID [2022-02-21 04:19:53,790 INFO L272 TraceCheckUtils]: 3: Hoare triple {5322#true} call #t~ret6 := fibo1(~n - 1); {5322#true} is VALID [2022-02-21 04:19:53,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {5322#true} assume !(~n < 1); {5372#(< 0 fibo1_~n)} is VALID [2022-02-21 04:19:53,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {5372#(< 0 fibo1_~n)} assume !(1 == ~n); {5373#(not (<= fibo1_~n 1))} is VALID [2022-02-21 04:19:53,791 INFO L272 TraceCheckUtils]: 7: Hoare triple {5373#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:53,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {5322#true} ~n := #in~n; {5382#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:53,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {5382#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:53,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {5383#(<= |fibo2_#in~n| 0)} assume true; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:53,793 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5383#(<= |fibo2_#in~n| 0)} {5373#(not (<= fibo1_~n 1))} #50#return; {5323#false} is VALID [2022-02-21 04:19:53,793 INFO L272 TraceCheckUtils]: 12: Hoare triple {5323#false} call #t~ret5 := fibo2(~n - 2); {5322#true} is VALID [2022-02-21 04:19:53,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:53,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:53,793 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5322#true} {5323#false} #52#return; {5323#false} is VALID [2022-02-21 04:19:53,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {5323#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5323#false} is VALID [2022-02-21 04:19:53,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {5323#false} assume true; {5323#false} is VALID [2022-02-21 04:19:53,794 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5323#false} {5322#true} #46#return; {5323#false} is VALID [2022-02-21 04:19:53,794 INFO L272 TraceCheckUtils]: 20: Hoare triple {5323#false} call #t~ret7 := fibo1(~n - 2); {5322#true} is VALID [2022-02-21 04:19:53,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:53,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:53,795 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5322#true} {5323#false} #48#return; {5323#false} is VALID [2022-02-21 04:19:53,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {5323#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5323#false} is VALID [2022-02-21 04:19:53,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {5323#false} assume true; {5323#false} is VALID [2022-02-21 04:19:53,795 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5323#false} {5322#true} #50#return; {5323#false} is VALID [2022-02-21 04:19:53,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5322#true} is VALID [2022-02-21 04:19:53,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {5322#true} is VALID [2022-02-21 04:19:53,796 INFO L272 TraceCheckUtils]: 2: Hoare triple {5322#true} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5322#true} is VALID [2022-02-21 04:19:53,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {5322#true} assume !(~n < 1); {5322#true} is VALID [2022-02-21 04:19:53,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {5322#true} assume !(1 == ~n); {5322#true} is VALID [2022-02-21 04:19:53,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {5322#true} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:53,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {5322#true} assume !(~n < 1); {5322#true} is VALID [2022-02-21 04:19:53,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {5322#true} assume !(1 == ~n); {5322#true} is VALID [2022-02-21 04:19:53,797 INFO L272 TraceCheckUtils]: 10: Hoare triple {5322#true} call #t~ret6 := fibo1(~n - 1); {5322#true} is VALID [2022-02-21 04:19:53,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {5322#true} assume !(~n < 1); {5322#true} is VALID [2022-02-21 04:19:53,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {5322#true} assume !(1 == ~n); {5322#true} is VALID [2022-02-21 04:19:53,797 INFO L272 TraceCheckUtils]: 14: Hoare triple {5322#true} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:53,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {5322#true} assume !(~n < 1); {5322#true} is VALID [2022-02-21 04:19:53,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {5322#true} assume !(1 == ~n); {5322#true} is VALID [2022-02-21 04:19:53,798 INFO L272 TraceCheckUtils]: 18: Hoare triple {5322#true} call #t~ret6 := fibo1(~n - 1); {5322#true} is VALID [2022-02-21 04:19:53,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {5322#true} assume !(~n < 1); {5372#(< 0 fibo1_~n)} is VALID [2022-02-21 04:19:53,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {5372#(< 0 fibo1_~n)} assume !(1 == ~n); {5373#(not (<= fibo1_~n 1))} is VALID [2022-02-21 04:19:53,812 INFO L272 TraceCheckUtils]: 22: Hoare triple {5373#(not (<= fibo1_~n 1))} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:53,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {5322#true} ~n := #in~n; {5382#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:19:53,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {5382#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:53,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {5383#(<= |fibo2_#in~n| 0)} assume true; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:53,814 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5383#(<= |fibo2_#in~n| 0)} {5373#(not (<= fibo1_~n 1))} #50#return; {5323#false} is VALID [2022-02-21 04:19:53,814 INFO L272 TraceCheckUtils]: 27: Hoare triple {5323#false} call #t~ret5 := fibo2(~n - 2); {5322#true} is VALID [2022-02-21 04:19:53,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:53,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:53,814 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5322#true} {5323#false} #52#return; {5323#false} is VALID [2022-02-21 04:19:53,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {5323#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5323#false} is VALID [2022-02-21 04:19:53,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {5323#false} assume true; {5323#false} is VALID [2022-02-21 04:19:53,814 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5323#false} {5322#true} #46#return; {5323#false} is VALID [2022-02-21 04:19:53,814 INFO L272 TraceCheckUtils]: 35: Hoare triple {5323#false} call #t~ret7 := fibo1(~n - 2); {5322#true} is VALID [2022-02-21 04:19:53,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:53,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:53,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:53,815 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5322#true} {5323#false} #48#return; {5323#false} is VALID [2022-02-21 04:19:53,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {5323#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5323#false} is VALID [2022-02-21 04:19:53,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {5323#false} assume true; {5323#false} is VALID [2022-02-21 04:19:53,815 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5323#false} {5322#true} #50#return; {5323#false} is VALID [2022-02-21 04:19:53,815 INFO L272 TraceCheckUtils]: 43: Hoare triple {5323#false} call #t~ret5 := fibo2(~n - 2); {5323#false} is VALID [2022-02-21 04:19:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-21 04:19:53,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:53,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231751235] [2022-02-21 04:19:53,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231751235] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:19:53,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283786356] [2022-02-21 04:19:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:53,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:19:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:53,817 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:19:53,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-02-21 04:19:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:19:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:53,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:54,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5322#true} is VALID [2022-02-21 04:19:54,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {5390#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:54,129 INFO L272 TraceCheckUtils]: 2: Hoare triple {5390#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5394#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:54,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {5394#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {5398#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:54,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {5398#(<= 6 fibo1_~n)} assume !(~n < 1); {5398#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:54,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {5398#(<= 6 fibo1_~n)} assume !(1 == ~n); {5398#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:54,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {5398#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5408#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:54,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {5408#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {5412#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:54,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {5412#(<= 5 fibo2_~n)} assume !(~n < 1); {5412#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:54,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {5412#(<= 5 fibo2_~n)} assume !(1 == ~n); {5412#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:54,137 INFO L272 TraceCheckUtils]: 10: Hoare triple {5412#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {5422#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:54,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {5422#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {5426#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:54,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {5426#(<= 4 fibo1_~n)} assume !(~n < 1); {5426#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:54,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {5426#(<= 4 fibo1_~n)} assume !(1 == ~n); {5426#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:54,139 INFO L272 TraceCheckUtils]: 14: Hoare triple {5426#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {5322#true} ~n := #in~n; {5439#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:54,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {5439#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {5439#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:54,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {5439#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {5439#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:54,140 INFO L272 TraceCheckUtils]: 18: Hoare triple {5439#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {5322#true} ~n := #in~n; {5452#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:54,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {5452#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {5452#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:54,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {5452#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {5452#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:19:54,141 INFO L272 TraceCheckUtils]: 22: Hoare triple {5452#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:54,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {5322#true} ~n := #in~n; {5439#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:19:54,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {5439#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:54,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {5383#(<= |fibo2_#in~n| 0)} assume true; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:54,143 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5383#(<= |fibo2_#in~n| 0)} {5452#(<= |fibo1_#in~n| fibo1_~n)} #50#return; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:54,143 INFO L272 TraceCheckUtils]: 27: Hoare triple {5474#(<= |fibo1_#in~n| 1)} call #t~ret5 := fibo2(~n - 2); {5322#true} is VALID [2022-02-21 04:19:54,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:54,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:54,144 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5322#true} {5474#(<= |fibo1_#in~n| 1)} #52#return; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:54,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {5474#(<= |fibo1_#in~n| 1)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:54,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {5474#(<= |fibo1_#in~n| 1)} assume true; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:54,145 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5474#(<= |fibo1_#in~n| 1)} {5439#(<= |fibo2_#in~n| fibo2_~n)} #46#return; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:54,145 INFO L272 TraceCheckUtils]: 35: Hoare triple {5499#(<= |fibo2_#in~n| 2)} call #t~ret7 := fibo1(~n - 2); {5322#true} is VALID [2022-02-21 04:19:54,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:54,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:54,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:54,146 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5322#true} {5499#(<= |fibo2_#in~n| 2)} #48#return; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:54,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {5499#(<= |fibo2_#in~n| 2)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:54,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {5499#(<= |fibo2_#in~n| 2)} assume true; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:54,147 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5499#(<= |fibo2_#in~n| 2)} {5426#(<= 4 fibo1_~n)} #50#return; {5323#false} is VALID [2022-02-21 04:19:54,147 INFO L272 TraceCheckUtils]: 43: Hoare triple {5323#false} call #t~ret5 := fibo2(~n - 2); {5323#false} is VALID [2022-02-21 04:19:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 04:19:54,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:19:55,071 INFO L272 TraceCheckUtils]: 43: Hoare triple {5323#false} call #t~ret5 := fibo2(~n - 2); {5323#false} is VALID [2022-02-21 04:19:55,072 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5499#(<= |fibo2_#in~n| 2)} {5426#(<= 4 fibo1_~n)} #50#return; {5323#false} is VALID [2022-02-21 04:19:55,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {5499#(<= |fibo2_#in~n| 2)} assume true; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:55,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {5499#(<= |fibo2_#in~n| 2)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:55,073 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5322#true} {5499#(<= |fibo2_#in~n| 2)} #48#return; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:55,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:55,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:55,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:55,074 INFO L272 TraceCheckUtils]: 35: Hoare triple {5499#(<= |fibo2_#in~n| 2)} call #t~ret7 := fibo1(~n - 2); {5322#true} is VALID [2022-02-21 04:19:55,074 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5474#(<= |fibo1_#in~n| 1)} {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} #46#return; {5499#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:19:55,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {5474#(<= |fibo1_#in~n| 1)} assume true; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:55,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {5474#(<= |fibo1_#in~n| 1)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:55,075 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5322#true} {5474#(<= |fibo1_#in~n| 1)} #52#return; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:55,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {5322#true} assume true; {5322#true} is VALID [2022-02-21 04:19:55,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {5322#true} assume ~n < 1;#res := 0; {5322#true} is VALID [2022-02-21 04:19:55,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {5322#true} ~n := #in~n; {5322#true} is VALID [2022-02-21 04:19:55,076 INFO L272 TraceCheckUtils]: 27: Hoare triple {5474#(<= |fibo1_#in~n| 1)} call #t~ret5 := fibo2(~n - 2); {5322#true} is VALID [2022-02-21 04:19:55,076 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5383#(<= |fibo2_#in~n| 0)} {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} #50#return; {5474#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:19:55,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {5383#(<= |fibo2_#in~n| 0)} assume true; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:55,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {5595#(or (not (< fibo2_~n 1)) (<= |fibo2_#in~n| 0))} assume ~n < 1;#res := 0; {5383#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:19:55,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {5322#true} ~n := #in~n; {5595#(or (not (< fibo2_~n 1)) (<= |fibo2_#in~n| 0))} is VALID [2022-02-21 04:19:55,077 INFO L272 TraceCheckUtils]: 22: Hoare triple {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:55,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} assume !(1 == ~n); {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-21 04:19:55,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} assume !(~n < 1); {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-21 04:19:55,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {5322#true} ~n := #in~n; {5585#(or (<= |fibo1_#in~n| 1) (<= 2 fibo1_~n))} is VALID [2022-02-21 04:19:55,080 INFO L272 TraceCheckUtils]: 18: Hoare triple {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} call #t~ret6 := fibo1(~n - 1); {5322#true} is VALID [2022-02-21 04:19:55,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(1 == ~n); {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:55,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(~n < 1); {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:55,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {5322#true} ~n := #in~n; {5557#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:19:55,081 INFO L272 TraceCheckUtils]: 14: Hoare triple {5426#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5322#true} is VALID [2022-02-21 04:19:55,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {5426#(<= 4 fibo1_~n)} assume !(1 == ~n); {5426#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:55,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {5426#(<= 4 fibo1_~n)} assume !(~n < 1); {5426#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:55,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {5422#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {5426#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:19:55,083 INFO L272 TraceCheckUtils]: 10: Hoare triple {5412#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {5422#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:55,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {5412#(<= 5 fibo2_~n)} assume !(1 == ~n); {5412#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:55,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {5412#(<= 5 fibo2_~n)} assume !(~n < 1); {5412#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:55,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {5408#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {5412#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:19:55,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {5398#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {5408#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:19:55,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {5398#(<= 6 fibo1_~n)} assume !(1 == ~n); {5398#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:55,098 INFO L290 TraceCheckUtils]: 4: Hoare triple {5398#(<= 6 fibo1_~n)} assume !(~n < 1); {5398#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:55,098 INFO L290 TraceCheckUtils]: 3: Hoare triple {5394#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {5398#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:19:55,099 INFO L272 TraceCheckUtils]: 2: Hoare triple {5390#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5394#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:55,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {5390#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:19:55,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5322#true} is VALID [2022-02-21 04:19:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 04:19:55,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283786356] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:19:55,101 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:19:55,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 20 [2022-02-21 04:19:55,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528482899] [2022-02-21 04:19:55,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:19:55,102 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:19:55,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash -28526872, now seen corresponding path program 2 times [2022-02-21 04:19:55,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:55,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395517403] [2022-02-21 04:19:55,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:55,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:55,108 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:55,113 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:55,246 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:55,246 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:55,246 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:55,247 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:55,247 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:55,247 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,247 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:55,247 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:55,247 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-1.c_Iteration4_Loop [2022-02-21 04:19:55,247 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:55,247 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:55,248 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 04:19:55,250 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 04:19:55,251 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 04:19:55,253 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 04:19:55,255 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 04:19:55,261 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 04:19:55,263 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 04:19:55,264 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 04:19:55,265 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 04:19:55,267 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 04:19:55,337 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:55,337 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:55,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,339 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 04:19:55,339 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 04:19:55,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:55,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:55,347 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:55,347 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret4=0} Honda state: {fibo1_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:55,364 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 04:19:55,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,366 INFO L229 MonitoredProcess]: Starting monitored process 40 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 04:19:55,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 04:19:55,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:55,369 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:55,375 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:55,375 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:55,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 04:19:55,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,391 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 04:19:55,391 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 04:19:55,393 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:55,393 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:55,399 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:55,399 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#in~n=0} Honda state: {fibo1_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:55,413 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 04:19:55,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,415 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 04:19:55,415 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 04:19:55,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:55,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:55,423 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:55,423 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret7=0} Honda state: {fibo2_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:55,439 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 04:19:55,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,440 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 04:19:55,441 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 04:19:55,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:55,443 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:55,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 04:19:55,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,464 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 04:19:55,466 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 04:19:55,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:55,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:55,490 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:55,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 04:19:55,493 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:55,493 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:55,493 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:55,493 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:55,493 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:55,493 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,493 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:55,493 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:55,493 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-1.c_Iteration4_Loop [2022-02-21 04:19:55,493 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:55,493 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:55,494 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 04:19:55,496 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 04:19:55,497 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 04:19:55,499 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 04:19:55,501 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 04:19:55,506 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 04:19:55,522 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 04:19:55,524 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 04:19:55,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 04:19:55,527 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 04:19:55,592 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:55,592 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:55,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,593 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 04:19:55,594 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 04:19:55,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 04:19:55,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:55,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:55,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:55,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:55,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:55,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:55,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:55,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:55,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 04:19:55,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,628 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 04:19:55,629 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 04:19:55,632 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 04:19:55,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:55,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:55,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:55,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:55,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:55,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:55,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:55,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:55,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 04:19:55,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,656 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 04:19:55,657 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 04:19:55,657 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 04:19:55,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:55,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:55,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:55,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:55,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:55,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:55,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:55,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:55,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:55,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,680 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 04:19:55,680 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 04:19:55,682 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 04:19:55,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:55,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:55,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:55,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:55,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:55,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:55,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:55,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:55,703 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 04:19:55,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,704 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 04:19:55,704 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 04:19:55,706 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 04:19:55,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:55,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:55,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:55,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:55,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:55,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:55,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:55,719 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:55,722 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:19:55,722 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:19:55,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:55,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:55,724 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 04:19:55,724 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 04:19:55,726 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:55,726 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:55,726 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:55,726 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2022-02-21 04:19:55,741 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 04:19:55,747 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:55,749 INFO L390 LassoCheck]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< [2022-02-21 04:19:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:55,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:55,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:19:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:55,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:56,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {5658#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5658#unseeded} is VALID [2022-02-21 04:19:56,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {5658#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {5658#unseeded} is VALID [2022-02-21 04:19:56,130 INFO L272 TraceCheckUtils]: 2: Hoare triple {5658#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5658#unseeded} is VALID [2022-02-21 04:19:56,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:56,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:56,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:56,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {5658#unseeded} call #t~ret4 := fibo2(~n - 1); {5658#unseeded} is VALID [2022-02-21 04:19:56,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:56,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:56,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:56,132 INFO L272 TraceCheckUtils]: 10: Hoare triple {5658#unseeded} call #t~ret6 := fibo1(~n - 1); {5658#unseeded} is VALID [2022-02-21 04:19:56,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:56,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:56,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:56,133 INFO L272 TraceCheckUtils]: 14: Hoare triple {5658#unseeded} call #t~ret4 := fibo2(~n - 1); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,135 INFO L272 TraceCheckUtils]: 18: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,137 INFO L272 TraceCheckUtils]: 22: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,138 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,139 INFO L272 TraceCheckUtils]: 27: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,140 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,142 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,142 INFO L272 TraceCheckUtils]: 35: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,143 INFO L290 TraceCheckUtils]: 37: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,144 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:56,145 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5718#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5658#unseeded} #50#return; {5658#unseeded} is VALID [2022-02-21 04:19:56,146 INFO L272 TraceCheckUtils]: 43: Hoare triple {5658#unseeded} call #t~ret5 := fibo2(~n - 2); {5658#unseeded} is VALID [2022-02-21 04:19:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:56,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {5661#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {5806#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:56,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {5806#(<= fibo2_~n oldRank0)} assume !(~n < 1); {5806#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:56,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {5806#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {5806#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:56,241 INFO L272 TraceCheckUtils]: 3: Hoare triple {5806#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {5816#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:19:56,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {5816#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {5820#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:19:56,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {5820#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {5824#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:56,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {5824#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {5824#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:56,243 INFO L272 TraceCheckUtils]: 7: Hoare triple {5824#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {5671#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:19:56,243 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 04:19:56,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:56,279 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 04:19:56,291 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 04:19:56,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,292 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2022-02-21 04:19:56,292 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 185 states and 249 transitions. cyclomatic complexity: 69 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:56,594 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 185 states and 249 transitions. cyclomatic complexity: 69. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 691 states and 965 transitions. Complement of second has 26 states. [2022-02-21 04:19:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:56,594 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:56,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 249 transitions. cyclomatic complexity: 69 [2022-02-21 04:19:56,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:56,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:56,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:56,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:56,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:56,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:56,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 691 states and 965 transitions. [2022-02-21 04:19:56,600 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2022-02-21 04:19:56,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:56,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:56,601 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 185 states and 249 transitions. cyclomatic complexity: 69 [2022-02-21 04:19:56,607 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:56,607 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:56,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:56,608 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:56,608 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 691 states and 965 transitions. cyclomatic complexity: 290 [2022-02-21 04:19:56,614 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 36 examples of accepted words. [2022-02-21 04:19:56,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:56,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:56,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:56,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 691 letters. Loop has 691 letters. [2022-02-21 04:19:56,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 691 letters. Loop has 691 letters. [2022-02-21 04:19:56,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 691 letters. Loop has 691 letters. [2022-02-21 04:19:56,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:56,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:56,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:56,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:56,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:56,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:56,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:56,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:56,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:56,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:56,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:56,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:56,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:56,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:56,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:56,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:56,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:56,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:56,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:56,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:56,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:56,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:56,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:56,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:56,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:56,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:56,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:56,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:56,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:56,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:56,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:56,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:56,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:56,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:56,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:56,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:56,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:56,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:56,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:56,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:56,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:56,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:56,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:56,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:56,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:56,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:56,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:56,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:56,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:56,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:56,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:56,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:56,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:56,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:56,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:56,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:56,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:56,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:56,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:56,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:56,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:56,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:56,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:56,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:56,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:56,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:56,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:56,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:56,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:56,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:56,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:56,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:56,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:56,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:56,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:56,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:56,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:56,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:56,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:56,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:56,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:56,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:56,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:56,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:56,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:56,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:56,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:56,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:56,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:56,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:56,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:56,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:56,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:56,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:56,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:56,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:56,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:56,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:56,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:56,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:56,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:56,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:56,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:56,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:56,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:56,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:56,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:56,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:56,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:56,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:56,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:56,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:56,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:56,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:56,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:56,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:56,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:56,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:56,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:56,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:56,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:56,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:56,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:56,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:56,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:56,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:56,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:56,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:56,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:56,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:56,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:56,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:56,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:56,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,672 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-02-21 04:19:56,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:56,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:56,673 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:19:56,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:19:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:56,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:57,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {5658#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5658#unseeded} is VALID [2022-02-21 04:19:57,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {5658#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {5658#unseeded} is VALID [2022-02-21 04:19:57,058 INFO L272 TraceCheckUtils]: 2: Hoare triple {5658#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5658#unseeded} is VALID [2022-02-21 04:19:57,060 INFO L290 TraceCheckUtils]: 3: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:57,061 INFO L290 TraceCheckUtils]: 4: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:57,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {5658#unseeded} call #t~ret4 := fibo2(~n - 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:57,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:57,062 INFO L272 TraceCheckUtils]: 10: Hoare triple {5658#unseeded} call #t~ret6 := fibo1(~n - 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:57,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:57,064 INFO L272 TraceCheckUtils]: 14: Hoare triple {5658#unseeded} call #t~ret4 := fibo2(~n - 1); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,065 INFO L272 TraceCheckUtils]: 18: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,067 INFO L272 TraceCheckUtils]: 22: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,068 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,069 INFO L272 TraceCheckUtils]: 27: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,070 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,072 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,072 INFO L272 TraceCheckUtils]: 35: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,074 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,075 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5658#unseeded} #50#return; {5658#unseeded} is VALID [2022-02-21 04:19:57,075 INFO L272 TraceCheckUtils]: 43: Hoare triple {5658#unseeded} call #t~ret5 := fibo2(~n - 2); {5658#unseeded} is VALID [2022-02-21 04:19:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:57,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {5661#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {6693#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:57,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {6693#(<= fibo2_~n oldRank0)} assume !(~n < 1); {6693#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:57,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {6693#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {6693#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:57,179 INFO L272 TraceCheckUtils]: 3: Hoare triple {6693#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {6703#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:19:57,180 INFO L290 TraceCheckUtils]: 4: Hoare triple {6703#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {6707#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:19:57,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {6707#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {6711#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {6711#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {6711#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,181 INFO L272 TraceCheckUtils]: 7: Hoare triple {6711#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {5671#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:19:57,181 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 04:19:57,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:57,212 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 04:19:57,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,213 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2022-02-21 04:19:57,213 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 185 states and 249 transitions. cyclomatic complexity: 69 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:57,466 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 185 states and 249 transitions. cyclomatic complexity: 69. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 691 states and 965 transitions. Complement of second has 26 states. [2022-02-21 04:19:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:57,466 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:57,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 249 transitions. cyclomatic complexity: 69 [2022-02-21 04:19:57,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:57,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:57,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:57,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:57,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:57,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:57,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 691 states and 965 transitions. [2022-02-21 04:19:57,470 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2022-02-21 04:19:57,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:57,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:57,471 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 185 states and 249 transitions. cyclomatic complexity: 69 [2022-02-21 04:19:57,471 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:57,471 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:57,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:57,472 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:57,472 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 691 states and 965 transitions. cyclomatic complexity: 290 [2022-02-21 04:19:57,476 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 36 examples of accepted words. [2022-02-21 04:19:57,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:57,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:57,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:57,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 691 letters. Loop has 691 letters. [2022-02-21 04:19:57,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 691 letters. Loop has 691 letters. [2022-02-21 04:19:57,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 691 letters. Loop has 691 letters. [2022-02-21 04:19:57,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:57,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:57,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:57,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:57,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:57,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:57,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:57,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:57,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:57,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:57,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:57,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:57,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:57,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:57,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:57,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:57,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:57,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:57,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:57,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:57,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:57,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:57,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:57,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:57,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:57,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:57,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:57,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:57,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:57,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:57,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:57,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:57,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:57,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:57,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:57,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:57,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:57,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:57,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:57,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 13 letters. [2022-02-21 04:19:57,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:57,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:57,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 49 letters. [2022-02-21 04:19:57,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:57,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:57,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:57,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:57,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:57,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 68 letters. Loop has 25 letters. [2022-02-21 04:19:57,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:57,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:57,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:57,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:57,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:57,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:57,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:57,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:57,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:57,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:57,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:57,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:57,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:57,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 691 states and 965 transitions. cyclomatic complexity: 290 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:19:57,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,509 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-02-21 04:19:57,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:57,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:57,510 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:19:57,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:19:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:57,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {5658#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5658#unseeded} is VALID [2022-02-21 04:19:57,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {5658#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {5658#unseeded} is VALID [2022-02-21 04:19:57,856 INFO L272 TraceCheckUtils]: 2: Hoare triple {5658#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {5658#unseeded} is VALID [2022-02-21 04:19:57,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:57,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:57,857 INFO L272 TraceCheckUtils]: 6: Hoare triple {5658#unseeded} call #t~ret4 := fibo2(~n - 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:57,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:57,858 INFO L272 TraceCheckUtils]: 10: Hoare triple {5658#unseeded} call #t~ret6 := fibo1(~n - 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {5658#unseeded} ~n := #in~n; {5658#unseeded} is VALID [2022-02-21 04:19:57,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {5658#unseeded} assume !(~n < 1); {5658#unseeded} is VALID [2022-02-21 04:19:57,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {5658#unseeded} assume !(1 == ~n); {5658#unseeded} is VALID [2022-02-21 04:19:57,859 INFO L272 TraceCheckUtils]: 14: Hoare triple {5658#unseeded} call #t~ret4 := fibo2(~n - 1); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,861 INFO L272 TraceCheckUtils]: 18: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,862 INFO L272 TraceCheckUtils]: 22: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,864 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,864 INFO L272 TraceCheckUtils]: 27: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,866 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,867 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,868 INFO L272 TraceCheckUtils]: 35: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,869 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:57,871 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {5658#unseeded} #50#return; {5658#unseeded} is VALID [2022-02-21 04:19:57,871 INFO L272 TraceCheckUtils]: 43: Hoare triple {5658#unseeded} call #t~ret5 := fibo2(~n - 2); {5658#unseeded} is VALID [2022-02-21 04:19:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:19:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:57,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:57,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {5661#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {7580#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:57,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {7580#(<= fibo2_~n oldRank0)} assume !(~n < 1); {7580#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:57,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {7580#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {7580#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:19:57,990 INFO L272 TraceCheckUtils]: 3: Hoare triple {7580#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {7590#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:19:57,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {7590#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {7594#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:19:57,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {7594#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {7598#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {7598#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {7598#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:19:57,991 INFO L272 TraceCheckUtils]: 7: Hoare triple {7598#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {5671#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:19:57,992 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 04:19:57,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:58,028 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 04:19:58,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,029 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 5 loop predicates [2022-02-21 04:19:58,029 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 185 states and 249 transitions. cyclomatic complexity: 69 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:58,291 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 185 states and 249 transitions. cyclomatic complexity: 69. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 576 states and 790 transitions. Complement of second has 25 states. [2022-02-21 04:19:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:58,291 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:58,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 249 transitions. cyclomatic complexity: 69 [2022-02-21 04:19:58,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:58,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:58,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:58,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:58,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:58,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:58,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 576 states and 790 transitions. [2022-02-21 04:19:58,295 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2022-02-21 04:19:58,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:58,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:58,295 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 185 states and 249 transitions. cyclomatic complexity: 69 [2022-02-21 04:19:58,295 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 26 examples of accepted words. [2022-02-21 04:19:58,296 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:58,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:19:58,296 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:58,296 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 576 states and 790 transitions. cyclomatic complexity: 222 [2022-02-21 04:19:58,304 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 40 examples of accepted words. [2022-02-21 04:19:58,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:58,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:58,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:58,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 73 letters. [2022-02-21 04:19:58,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 73 letters. [2022-02-21 04:19:58,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 44 letters. Loop has 73 letters. [2022-02-21 04:19:58,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 576 letters. Loop has 576 letters. [2022-02-21 04:19:58,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 576 letters. Loop has 576 letters. [2022-02-21 04:19:58,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 576 letters. Loop has 576 letters. [2022-02-21 04:19:58,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:58,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:58,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 185 letters. Loop has 185 letters. [2022-02-21 04:19:58,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:58,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:58,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:19:58,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:58,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:58,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:58,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:58,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:58,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:58,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:58,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:58,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:58,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:19:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:19:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 77 letters. Loop has 13 letters. [2022-02-21 04:19:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:58,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:58,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 77 letters. Loop has 26 letters. [2022-02-21 04:19:58,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:58,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:58,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 69 letters. Loop has 25 letters. [2022-02-21 04:19:58,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:19:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:19:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:19:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:19:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:19:58,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 73 letters. [2022-02-21 04:19:58,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 73 letters. [2022-02-21 04:19:58,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 73 letters. [2022-02-21 04:19:58,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:19:58,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:19:58,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:19:58,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:19:58,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:19:58,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:19:58,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:19:58,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:19:58,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:19:58,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:19:58,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:19:58,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:19:58,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:19:58,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:19:58,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 70 letters. Loop has 8 letters. [2022-02-21 04:19:58,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:19:58,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:19:58,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:19:58,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:19:58,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:19:58,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:19:58,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 44 letters. Loop has 73 letters. [2022-02-21 04:19:58,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 44 letters. Loop has 73 letters. [2022-02-21 04:19:58,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 44 letters. Loop has 73 letters. [2022-02-21 04:19:58,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:58,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:58,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:58,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 13 letters. [2022-02-21 04:19:58,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 13 letters. [2022-02-21 04:19:58,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 13 letters. [2022-02-21 04:19:58,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 86 letters. [2022-02-21 04:19:58,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 86 letters. [2022-02-21 04:19:58,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 86 letters. [2022-02-21 04:19:58,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 19 letters. [2022-02-21 04:19:58,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 19 letters. [2022-02-21 04:19:58,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 19 letters. [2022-02-21 04:19:58,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 92 letters. [2022-02-21 04:19:58,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 92 letters. [2022-02-21 04:19:58,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 92 letters. [2022-02-21 04:19:58,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 61 letters. [2022-02-21 04:19:58,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 61 letters. [2022-02-21 04:19:58,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 68 letters. Loop has 61 letters. [2022-02-21 04:19:58,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:58,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:58,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:19:58,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 90 letters. [2022-02-21 04:19:58,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 90 letters. [2022-02-21 04:19:58,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 90 letters. [2022-02-21 04:19:58,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 40 letters. Loop has 175 letters. [2022-02-21 04:19:58,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 40 letters. Loop has 175 letters. [2022-02-21 04:19:58,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 40 letters. Loop has 175 letters. [2022-02-21 04:19:58,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 126 letters. [2022-02-21 04:19:58,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 126 letters. [2022-02-21 04:19:58,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 68 letters. Loop has 126 letters. [2022-02-21 04:19:58,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 68 letters. Loop has 134 letters. [2022-02-21 04:19:58,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 68 letters. Loop has 134 letters. [2022-02-21 04:19:58,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 68 letters. Loop has 134 letters. [2022-02-21 04:19:58,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:19:58,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:19:58,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:58,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:58,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:19:58,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 13 letters. [2022-02-21 04:19:58,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 13 letters. [2022-02-21 04:19:58,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 53 letters. Loop has 13 letters. [2022-02-21 04:19:58,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:19:58,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:58,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:58,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:19:58,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:58,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:58,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:19:58,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:19:58,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 134 letters. [2022-02-21 04:19:58,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 134 letters. [2022-02-21 04:19:58,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 57 letters. Loop has 134 letters. [2022-02-21 04:19:58,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 87 letters. [2022-02-21 04:19:58,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 87 letters. [2022-02-21 04:19:58,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 87 letters. [2022-02-21 04:19:58,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 13 letters. [2022-02-21 04:19:58,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 126 letters. [2022-02-21 04:19:58,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 126 letters. [2022-02-21 04:19:58,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 57 letters. Loop has 126 letters. [2022-02-21 04:19:58,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 93 letters. [2022-02-21 04:19:58,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 93 letters. [2022-02-21 04:19:58,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 93 letters. [2022-02-21 04:19:58,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 19 letters. [2022-02-21 04:19:58,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 19 letters. [2022-02-21 04:19:58,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 19 letters. [2022-02-21 04:19:58,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:19:58,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 185 states and 249 transitions. cyclomatic complexity: 69 Stem has 60 letters. Loop has 154 letters. [2022-02-21 04:19:58,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 154 letters. [2022-02-21 04:19:58,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 576 states and 790 transitions. cyclomatic complexity: 222 Stem has 60 letters. Loop has 154 letters. [2022-02-21 04:19:58,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,340 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:19:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-21 04:19:58,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 44 letters. Loop has 8 letters. [2022-02-21 04:19:58,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:19:58,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 44 letters. Loop has 16 letters. [2022-02-21 04:19:58,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:58,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 576 states and 790 transitions. cyclomatic complexity: 222 [2022-02-21 04:19:58,358 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2022-02-21 04:19:58,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 576 states to 465 states and 663 transitions. [2022-02-21 04:19:58,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 204 [2022-02-21 04:19:58,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235 [2022-02-21 04:19:58,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 465 states and 663 transitions. [2022-02-21 04:19:58,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:58,373 INFO L681 BuchiCegarLoop]: Abstraction has 465 states and 663 transitions. [2022-02-21 04:19:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states and 663 transitions. [2022-02-21 04:19:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 390. [2022-02-21 04:19:58,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:58,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 465 states and 663 transitions. Second operand has 390 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 282 states have internal predecessors, (329), 76 states have call successors, (79), 58 states have call predecessors, (79), 55 states have return successors, (123), 49 states have call predecessors, (123), 74 states have call successors, (123) [2022-02-21 04:19:58,383 INFO L74 IsIncluded]: Start isIncluded. First operand 465 states and 663 transitions. Second operand has 390 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 282 states have internal predecessors, (329), 76 states have call successors, (79), 58 states have call predecessors, (79), 55 states have return successors, (123), 49 states have call predecessors, (123), 74 states have call successors, (123) [2022-02-21 04:19:58,384 INFO L87 Difference]: Start difference. First operand 465 states and 663 transitions. Second operand has 390 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 282 states have internal predecessors, (329), 76 states have call successors, (79), 58 states have call predecessors, (79), 55 states have return successors, (123), 49 states have call predecessors, (123), 74 states have call successors, (123) [2022-02-21 04:19:58,384 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:58,418 INFO L93 Difference]: Finished difference Result 886 states and 1241 transitions. [2022-02-21 04:19:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1241 transitions. [2022-02-21 04:19:58,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:58,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:58,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 282 states have internal predecessors, (329), 76 states have call successors, (79), 58 states have call predecessors, (79), 55 states have return successors, (123), 49 states have call predecessors, (123), 74 states have call successors, (123) Second operand 465 states and 663 transitions. [2022-02-21 04:19:58,422 INFO L87 Difference]: Start difference. First operand has 390 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 282 states have internal predecessors, (329), 76 states have call successors, (79), 58 states have call predecessors, (79), 55 states have return successors, (123), 49 states have call predecessors, (123), 74 states have call successors, (123) Second operand 465 states and 663 transitions. [2022-02-21 04:19:58,422 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:58,495 INFO L93 Difference]: Finished difference Result 1237 states and 1712 transitions. [2022-02-21 04:19:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1712 transitions. [2022-02-21 04:19:58,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:58,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:58,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:58,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 259 states have (on average 1.2702702702702702) internal successors, (329), 282 states have internal predecessors, (329), 76 states have call successors, (79), 58 states have call predecessors, (79), 55 states have return successors, (123), 49 states have call predecessors, (123), 74 states have call successors, (123) [2022-02-21 04:19:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 531 transitions. [2022-02-21 04:19:58,508 INFO L704 BuchiCegarLoop]: Abstraction has 390 states and 531 transitions. [2022-02-21 04:19:58,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:58,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 04:19:58,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-02-21 04:19:58,509 INFO L87 Difference]: Start difference. First operand 390 states and 531 transitions. Second operand has 20 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 13 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (12), 3 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-21 04:19:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:59,612 INFO L93 Difference]: Finished difference Result 469 states and 660 transitions. [2022-02-21 04:19:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-21 04:19:59,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 states have internal predecessors, (50), 13 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (12), 3 states have call predecessors, (12), 10 states have call successors, (12) [2022-02-21 04:19:59,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:59,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 469 states and 660 transitions. [2022-02-21 04:19:59,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:19:59,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 469 states to 430 states and 616 transitions. [2022-02-21 04:19:59,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 237 [2022-02-21 04:19:59,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2022-02-21 04:19:59,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 430 states and 616 transitions. [2022-02-21 04:19:59,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:59,691 INFO L681 BuchiCegarLoop]: Abstraction has 430 states and 616 transitions. [2022-02-21 04:19:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states and 616 transitions. [2022-02-21 04:19:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 381. [2022-02-21 04:19:59,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:59,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 430 states and 616 transitions. Second operand has 381 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 276 states have internal predecessors, (303), 79 states have call successors, (82), 53 states have call predecessors, (82), 55 states have return successors, (138), 51 states have call predecessors, (138), 77 states have call successors, (138) [2022-02-21 04:19:59,700 INFO L74 IsIncluded]: Start isIncluded. First operand 430 states and 616 transitions. Second operand has 381 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 276 states have internal predecessors, (303), 79 states have call successors, (82), 53 states have call predecessors, (82), 55 states have return successors, (138), 51 states have call predecessors, (138), 77 states have call successors, (138) [2022-02-21 04:19:59,700 INFO L87 Difference]: Start difference. First operand 430 states and 616 transitions. Second operand has 381 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 276 states have internal predecessors, (303), 79 states have call successors, (82), 53 states have call predecessors, (82), 55 states have return successors, (138), 51 states have call predecessors, (138), 77 states have call successors, (138) [2022-02-21 04:19:59,701 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:59,747 INFO L93 Difference]: Finished difference Result 1049 states and 1507 transitions. [2022-02-21 04:19:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1507 transitions. [2022-02-21 04:19:59,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:59,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:59,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 276 states have internal predecessors, (303), 79 states have call successors, (82), 53 states have call predecessors, (82), 55 states have return successors, (138), 51 states have call predecessors, (138), 77 states have call successors, (138) Second operand 430 states and 616 transitions. [2022-02-21 04:19:59,751 INFO L87 Difference]: Start difference. First operand has 381 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 276 states have internal predecessors, (303), 79 states have call successors, (82), 53 states have call predecessors, (82), 55 states have return successors, (138), 51 states have call predecessors, (138), 77 states have call successors, (138) Second operand 430 states and 616 transitions. [2022-02-21 04:19:59,751 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:59,795 INFO L93 Difference]: Finished difference Result 1058 states and 1522 transitions. [2022-02-21 04:19:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1522 transitions. [2022-02-21 04:19:59,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:59,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:59,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:59,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 276 states have internal predecessors, (303), 79 states have call successors, (82), 53 states have call predecessors, (82), 55 states have return successors, (138), 51 states have call predecessors, (138), 77 states have call successors, (138) [2022-02-21 04:19:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 523 transitions. [2022-02-21 04:19:59,807 INFO L704 BuchiCegarLoop]: Abstraction has 381 states and 523 transitions. [2022-02-21 04:19:59,807 INFO L587 BuchiCegarLoop]: Abstraction has 381 states and 523 transitions. [2022-02-21 04:19:59,807 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:19:59,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 381 states and 523 transitions. [2022-02-21 04:19:59,809 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:19:59,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:59,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:59,809 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:59,809 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1] [2022-02-21 04:19:59,810 INFO L791 eck$LassoCheckResult]: Stem: 12497#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 12498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; 12526#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 12581#fibo1ENTRY ~n := #in~n; 12639#L10 assume !(~n < 1); 12638#L12 assume !(1 == ~n); 12634#L15 call #t~ret4 := fibo2(~n - 1);< 12637#fibo2ENTRY ~n := #in~n; 12636#L20 assume !(~n < 1); 12635#L22 assume !(1 == ~n); 12630#L25 call #t~ret6 := fibo1(~n - 1);< 12633#fibo1ENTRY ~n := #in~n; 12632#L10 assume !(~n < 1); 12631#L12 assume !(1 == ~n); 12621#L15 call #t~ret4 := fibo2(~n - 1);< 12628#fibo2ENTRY ~n := #in~n; 12627#L20 assume !(~n < 1); 12620#L22 assume !(1 == ~n); 12528#L25 call #t~ret6 := fibo1(~n - 1);< 12612#fibo1ENTRY ~n := #in~n; 12613#L10 assume !(~n < 1); 12785#L12 assume !(1 == ~n); 12691#L15 call #t~ret4 := fibo2(~n - 1);< 12777#fibo2ENTRY ~n := #in~n; 12787#L20 assume !(~n < 1); 12784#L22 assume 1 == ~n;#res := 1; 12782#fibo2FINAL assume true; 12776#fibo2EXIT >#50#return; 12527#L15-1 call #t~ret5 := fibo2(~n - 2);< 12531#fibo2ENTRY ~n := #in~n; 12805#L20 assume ~n < 1;#res := 0; 12803#fibo2FINAL assume true; 12800#fibo2EXIT >#52#return; 12797#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 12796#fibo1FINAL assume true; 12795#fibo1EXIT >#46#return; 12694#L25-1 call #t~ret7 := fibo1(~n - 2);< 12711#fibo1ENTRY ~n := #in~n; 12809#L10 assume ~n < 1;#res := 0; 12808#fibo1FINAL assume true; 12792#fibo1EXIT >#48#return; 12729#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 12762#fibo2FINAL assume true; 12754#fibo2EXIT >#50#return; 12564#L15-1 call #t~ret5 := fibo2(~n - 2);< 12750#fibo2ENTRY [2022-02-21 04:19:59,810 INFO L793 eck$LassoCheckResult]: Loop: 12750#fibo2ENTRY ~n := #in~n; 12563#L20 assume !(~n < 1); 12569#L22 assume !(1 == ~n); 12718#L25 call #t~ret6 := fibo1(~n - 1);< 12735#fibo1ENTRY ~n := #in~n; 12775#L10 assume !(~n < 1); 12774#L12 assume !(1 == ~n); 12566#L15 call #t~ret4 := fibo2(~n - 1);< 12573#fibo2ENTRY ~n := #in~n; 12563#L20 assume !(~n < 1); 12569#L22 assume !(1 == ~n); 12718#L25 call #t~ret6 := fibo1(~n - 1);< 12735#fibo1ENTRY ~n := #in~n; 12775#L10 assume !(~n < 1); 12774#L12 assume !(1 == ~n); 12566#L15 call #t~ret4 := fibo2(~n - 1);< 12573#fibo2ENTRY ~n := #in~n; 12574#L20 assume !(~n < 1); 12779#L22 assume 1 == ~n;#res := 1; 12778#fibo2FINAL assume true; 12759#fibo2EXIT >#50#return; 12568#L15-1 call #t~ret5 := fibo2(~n - 2);< 12750#fibo2ENTRY ~n := #in~n; 12771#L20 assume ~n < 1;#res := 0; 12755#fibo2FINAL assume true; 12751#fibo2EXIT >#52#return; 12747#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 12732#fibo1FINAL assume true; 12724#fibo1EXIT >#46#return; 12726#L25-1 call #t~ret7 := fibo1(~n - 2);< 12731#fibo1ENTRY ~n := #in~n; 12766#L10 assume !(~n < 1); 12763#L12 assume !(1 == ~n); 12733#L15 call #t~ret4 := fibo2(~n - 1);< 12743#fibo2ENTRY ~n := #in~n; 12740#L20 assume !(~n < 1); 12737#L22 assume !(1 == ~n); 12727#L25 call #t~ret6 := fibo1(~n - 1);< 12731#fibo1ENTRY ~n := #in~n; 12766#L10 assume !(~n < 1); 12763#L12 assume !(1 == ~n); 12733#L15 call #t~ret4 := fibo2(~n - 1);< 12743#fibo2ENTRY ~n := #in~n; 12740#L20 assume !(~n < 1); 12737#L22 assume 1 == ~n;#res := 1; 12738#fibo2FINAL assume true; 12760#fibo2EXIT >#50#return; 12568#L15-1 call #t~ret5 := fibo2(~n - 2);< 12750#fibo2ENTRY ~n := #in~n; 12771#L20 assume ~n < 1;#res := 0; 12755#fibo2FINAL assume true; 12751#fibo2EXIT >#52#return; 12747#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 12732#fibo1FINAL assume true; 12724#fibo1EXIT >#46#return; 12726#L25-1 call #t~ret7 := fibo1(~n - 2);< 12731#fibo1ENTRY ~n := #in~n; 12766#L10 assume ~n < 1;#res := 0; 12767#fibo1FINAL assume true; 12791#fibo1EXIT >#48#return; 12730#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 12802#fibo2FINAL assume true; 12753#fibo2EXIT >#50#return; 12568#L15-1 call #t~ret5 := fibo2(~n - 2);< 12750#fibo2ENTRY ~n := #in~n; 12771#L20 assume ~n < 1;#res := 0; 12755#fibo2FINAL assume true; 12751#fibo2EXIT >#52#return; 12747#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 12732#fibo1FINAL assume true; 12724#fibo1EXIT >#48#return; 12730#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 12802#fibo2FINAL assume true; 12753#fibo2EXIT >#50#return; 12568#L15-1 call #t~ret5 := fibo2(~n - 2);< 12750#fibo2ENTRY [2022-02-21 04:19:59,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:59,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1055972758, now seen corresponding path program 1 times [2022-02-21 04:19:59,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:59,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119490486] [2022-02-21 04:19:59,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:59,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 04:19:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:59,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:59,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:19:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:59,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:19:59,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:19:59,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {16289#true} assume 1 == ~n;#res := 1; {16289#true} is VALID [2022-02-21 04:19:59,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:19:59,977 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:59,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:19:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:59,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:19:59,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {16289#true} assume ~n < 1;#res := 0; {16289#true} is VALID [2022-02-21 04:19:59,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:19:59,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:59,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} ~n := #in~n; {16349#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:59,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {16349#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16350#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:19:59,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {16350#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:59,983 INFO L272 TraceCheckUtils]: 3: Hoare triple {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:19:59,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:19:59,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:19:59,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {16289#true} assume 1 == ~n;#res := 1; {16289#true} is VALID [2022-02-21 04:19:59,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:19:59,984 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:19:59,984 INFO L272 TraceCheckUtils]: 9: Hoare triple {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {16289#true} is VALID [2022-02-21 04:19:59,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:19:59,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {16289#true} assume ~n < 1;#res := 0; {16289#true} is VALID [2022-02-21 04:19:59,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:19:59,985 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:59,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {16361#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:59,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {16361#(<= 2 |fibo1_#in~n|)} assume true; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:19:59,986 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16361#(<= 2 |fibo1_#in~n|)} {16289#true} #46#return; {16344#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:19:59,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:19:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:59,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} ~n := #in~n; {16349#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:19:59,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {16349#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {16362#(<= |fibo1_#in~n| 0)} assume true; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16362#(<= |fibo1_#in~n| 0)} {16344#(<= 3 fibo2_~n)} #48#return; {16290#false} is VALID [2022-02-21 04:20:00,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {16289#true} assume !(1 == ~n); {16289#true} is VALID [2022-02-21 04:20:00,001 INFO L272 TraceCheckUtils]: 3: Hoare triple {16289#true} call #t~ret6 := fibo1(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,001 INFO L290 TraceCheckUtils]: 4: Hoare triple {16289#true} ~n := #in~n; {16349#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {16349#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16350#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:00,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {16350#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:00,002 INFO L272 TraceCheckUtils]: 7: Hoare triple {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {16289#true} assume 1 == ~n;#res := 1; {16289#true} is VALID [2022-02-21 04:20:00,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,002 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:00,003 INFO L272 TraceCheckUtils]: 13: Hoare triple {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {16289#true} assume ~n < 1;#res := 0; {16289#true} is VALID [2022-02-21 04:20:00,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,003 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {16361#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {16361#(<= 2 |fibo1_#in~n|)} assume true; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,004 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16361#(<= 2 |fibo1_#in~n|)} {16289#true} #46#return; {16344#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:20:00,004 INFO L272 TraceCheckUtils]: 21: Hoare triple {16344#(<= 3 fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {16289#true} ~n := #in~n; {16349#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {16349#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {16362#(<= |fibo1_#in~n| 0)} assume true; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,006 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16362#(<= |fibo1_#in~n| 0)} {16344#(<= 3 fibo2_~n)} #48#return; {16290#false} is VALID [2022-02-21 04:20:00,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {16290#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16290#false} is VALID [2022-02-21 04:20:00,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {16290#false} assume true; {16290#false} is VALID [2022-02-21 04:20:00,006 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16290#false} {16297#(<= 4 fibo1_~n)} #50#return; {16290#false} is VALID [2022-02-21 04:20:00,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {16289#true} is VALID [2022-02-21 04:20:00,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {16289#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {16291#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:20:00,007 INFO L272 TraceCheckUtils]: 2: Hoare triple {16291#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {16292#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {16292#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:00,008 INFO L290 TraceCheckUtils]: 4: Hoare triple {16293#(<= 6 fibo1_~n)} assume !(~n < 1); {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:00,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {16293#(<= 6 fibo1_~n)} assume !(1 == ~n); {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:00,008 INFO L272 TraceCheckUtils]: 6: Hoare triple {16293#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16294#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:00,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {16294#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:00,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {16295#(<= 5 fibo2_~n)} assume !(~n < 1); {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:00,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {16295#(<= 5 fibo2_~n)} assume !(1 == ~n); {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:00,009 INFO L272 TraceCheckUtils]: 10: Hoare triple {16295#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {16296#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {16296#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:00,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {16297#(<= 4 fibo1_~n)} assume !(~n < 1); {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:00,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {16297#(<= 4 fibo1_~n)} assume !(1 == ~n); {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:00,010 INFO L272 TraceCheckUtils]: 14: Hoare triple {16297#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {16289#true} assume !(1 == ~n); {16289#true} is VALID [2022-02-21 04:20:00,011 INFO L272 TraceCheckUtils]: 18: Hoare triple {16289#true} call #t~ret6 := fibo1(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {16289#true} ~n := #in~n; {16349#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {16349#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16350#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:00,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {16350#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:00,012 INFO L272 TraceCheckUtils]: 22: Hoare triple {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {16289#true} assume 1 == ~n;#res := 1; {16289#true} is VALID [2022-02-21 04:20:00,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,012 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:00,012 INFO L272 TraceCheckUtils]: 28: Hoare triple {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {16289#true} assume ~n < 1;#res := 0; {16289#true} is VALID [2022-02-21 04:20:00,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,013 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16289#true} {16351#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {16361#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {16361#(<= 2 |fibo1_#in~n|)} assume true; {16361#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,014 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16361#(<= 2 |fibo1_#in~n|)} {16289#true} #46#return; {16344#(<= 3 fibo2_~n)} is VALID [2022-02-21 04:20:00,014 INFO L272 TraceCheckUtils]: 36: Hoare triple {16344#(<= 3 fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {16289#true} ~n := #in~n; {16349#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {16349#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,015 INFO L290 TraceCheckUtils]: 39: Hoare triple {16362#(<= |fibo1_#in~n| 0)} assume true; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,016 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16362#(<= |fibo1_#in~n| 0)} {16344#(<= 3 fibo2_~n)} #48#return; {16290#false} is VALID [2022-02-21 04:20:00,016 INFO L290 TraceCheckUtils]: 41: Hoare triple {16290#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16290#false} is VALID [2022-02-21 04:20:00,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {16290#false} assume true; {16290#false} is VALID [2022-02-21 04:20:00,016 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16290#false} {16297#(<= 4 fibo1_~n)} #50#return; {16290#false} is VALID [2022-02-21 04:20:00,016 INFO L272 TraceCheckUtils]: 44: Hoare triple {16290#false} call #t~ret5 := fibo2(~n - 2); {16290#false} is VALID [2022-02-21 04:20:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 04:20:00,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:00,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119490486] [2022-02-21 04:20:00,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119490486] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:00,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455042333] [2022-02-21 04:20:00,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:00,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:00,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:00,017 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:20:00,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-02-21 04:20:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 04:20:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:00,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {16289#true} is VALID [2022-02-21 04:20:00,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {16289#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {16291#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:20:00,321 INFO L272 TraceCheckUtils]: 2: Hoare triple {16291#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {16292#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,322 INFO L290 TraceCheckUtils]: 3: Hoare triple {16292#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:00,322 INFO L290 TraceCheckUtils]: 4: Hoare triple {16293#(<= 6 fibo1_~n)} assume !(~n < 1); {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:00,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {16293#(<= 6 fibo1_~n)} assume !(1 == ~n); {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:00,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {16293#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16294#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:00,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {16294#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:00,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {16295#(<= 5 fibo2_~n)} assume !(~n < 1); {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:00,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {16295#(<= 5 fibo2_~n)} assume !(1 == ~n); {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:00,324 INFO L272 TraceCheckUtils]: 10: Hoare triple {16295#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {16296#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {16296#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:00,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {16297#(<= 4 fibo1_~n)} assume !(~n < 1); {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:00,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {16297#(<= 4 fibo1_~n)} assume !(1 == ~n); {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:00,325 INFO L272 TraceCheckUtils]: 14: Hoare triple {16297#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {16289#true} ~n := #in~n; {16411#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:00,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {16411#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {16411#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:00,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {16411#(<= |fibo2_#in~n| fibo2_~n)} assume !(1 == ~n); {16411#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:00,326 INFO L272 TraceCheckUtils]: 18: Hoare triple {16411#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {16289#true} assume !(1 == ~n); {16289#true} is VALID [2022-02-21 04:20:00,326 INFO L272 TraceCheckUtils]: 22: Hoare triple {16289#true} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {16289#true} assume 1 == ~n;#res := 1; {16289#true} is VALID [2022-02-21 04:20:00,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,326 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16289#true} {16289#true} #50#return; {16289#true} is VALID [2022-02-21 04:20:00,326 INFO L272 TraceCheckUtils]: 28: Hoare triple {16289#true} call #t~ret5 := fibo2(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {16289#true} assume ~n < 1;#res := 0; {16289#true} is VALID [2022-02-21 04:20:00,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,327 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16289#true} {16289#true} #52#return; {16289#true} is VALID [2022-02-21 04:20:00,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {16289#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16289#true} is VALID [2022-02-21 04:20:00,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,327 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16289#true} {16411#(<= |fibo2_#in~n| fibo2_~n)} #46#return; {16411#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:00,327 INFO L272 TraceCheckUtils]: 36: Hoare triple {16411#(<= |fibo2_#in~n| fibo2_~n)} call #t~ret7 := fibo1(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {16289#true} ~n := #in~n; {16478#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:00,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {16478#(<= |fibo1_#in~n| fibo1_~n)} assume ~n < 1;#res := 0; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {16362#(<= |fibo1_#in~n| 0)} assume true; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,329 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16362#(<= |fibo1_#in~n| 0)} {16411#(<= |fibo2_#in~n| fibo2_~n)} #48#return; {16488#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:00,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {16488#(<= |fibo2_#in~n| 2)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16488#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:00,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {16488#(<= |fibo2_#in~n| 2)} assume true; {16488#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:00,330 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16488#(<= |fibo2_#in~n| 2)} {16297#(<= 4 fibo1_~n)} #50#return; {16290#false} is VALID [2022-02-21 04:20:00,330 INFO L272 TraceCheckUtils]: 44: Hoare triple {16290#false} call #t~ret5 := fibo2(~n - 2); {16290#false} is VALID [2022-02-21 04:20:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 04:20:00,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:00,882 INFO L272 TraceCheckUtils]: 44: Hoare triple {16290#false} call #t~ret5 := fibo2(~n - 2); {16290#false} is VALID [2022-02-21 04:20:00,883 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16488#(<= |fibo2_#in~n| 2)} {16297#(<= 4 fibo1_~n)} #50#return; {16290#false} is VALID [2022-02-21 04:20:00,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {16488#(<= |fibo2_#in~n| 2)} assume true; {16488#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:00,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {16488#(<= |fibo2_#in~n| 2)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16488#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:00,884 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16362#(<= |fibo1_#in~n| 0)} {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} #48#return; {16488#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:00,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {16362#(<= |fibo1_#in~n| 0)} assume true; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {16526#(or (<= |fibo1_#in~n| 0) (not (< fibo1_~n 1)))} assume ~n < 1;#res := 0; {16362#(<= |fibo1_#in~n| 0)} is VALID [2022-02-21 04:20:00,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {16289#true} ~n := #in~n; {16526#(or (<= |fibo1_#in~n| 0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:00,885 INFO L272 TraceCheckUtils]: 36: Hoare triple {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} call #t~ret7 := fibo1(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,886 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16289#true} {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} #46#return; {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:20:00,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {16289#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16289#true} is VALID [2022-02-21 04:20:00,886 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16289#true} {16289#true} #52#return; {16289#true} is VALID [2022-02-21 04:20:00,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {16289#true} assume ~n < 1;#res := 0; {16289#true} is VALID [2022-02-21 04:20:00,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,886 INFO L272 TraceCheckUtils]: 28: Hoare triple {16289#true} call #t~ret5 := fibo2(~n - 2); {16289#true} is VALID [2022-02-21 04:20:00,887 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16289#true} {16289#true} #50#return; {16289#true} is VALID [2022-02-21 04:20:00,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {16289#true} assume true; {16289#true} is VALID [2022-02-21 04:20:00,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {16289#true} assume 1 == ~n;#res := 1; {16289#true} is VALID [2022-02-21 04:20:00,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,887 INFO L272 TraceCheckUtils]: 22: Hoare triple {16289#true} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {16289#true} assume !(1 == ~n); {16289#true} is VALID [2022-02-21 04:20:00,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {16289#true} assume !(~n < 1); {16289#true} is VALID [2022-02-21 04:20:00,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {16289#true} ~n := #in~n; {16289#true} is VALID [2022-02-21 04:20:00,888 INFO L272 TraceCheckUtils]: 18: Hoare triple {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} call #t~ret6 := fibo1(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(1 == ~n); {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:20:00,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} assume !(~n < 1); {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:20:00,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {16289#true} ~n := #in~n; {16516#(or (<= |fibo2_#in~n| 2) (<= 3 fibo2_~n))} is VALID [2022-02-21 04:20:00,889 INFO L272 TraceCheckUtils]: 14: Hoare triple {16297#(<= 4 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16289#true} is VALID [2022-02-21 04:20:00,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {16297#(<= 4 fibo1_~n)} assume !(1 == ~n); {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:00,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {16297#(<= 4 fibo1_~n)} assume !(~n < 1); {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:00,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {16296#(<= 4 |fibo1_#in~n|)} ~n := #in~n; {16297#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:00,890 INFO L272 TraceCheckUtils]: 10: Hoare triple {16295#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {16296#(<= 4 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {16295#(<= 5 fibo2_~n)} assume !(1 == ~n); {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:00,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {16295#(<= 5 fibo2_~n)} assume !(~n < 1); {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:00,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {16294#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {16295#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:00,891 INFO L272 TraceCheckUtils]: 6: Hoare triple {16293#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16294#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:00,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {16293#(<= 6 fibo1_~n)} assume !(1 == ~n); {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:00,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {16293#(<= 6 fibo1_~n)} assume !(~n < 1); {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:00,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {16292#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {16293#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:00,892 INFO L272 TraceCheckUtils]: 2: Hoare triple {16291#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {16292#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:00,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {16289#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {16291#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:20:00,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {16289#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {16289#true} is VALID [2022-02-21 04:20:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 04:20:00,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455042333] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:00,893 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:00,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 20 [2022-02-21 04:20:00,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247455975] [2022-02-21 04:20:00,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:00,894 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:00,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:00,895 INFO L85 PathProgramCache]: Analyzing trace with hash 688787707, now seen corresponding path program 1 times [2022-02-21 04:20:00,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:00,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407914849] [2022-02-21 04:20:00,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:00,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-21 04:20:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:00,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:01,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {16772#(<= |fibo2_#in~n| 1)} assume true; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:01,003 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16772#(<= |fibo2_#in~n| 1)} {16759#(= fibo1_~n |fibo1_#in~n|)} #50#return; {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:01,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16632#true} {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,009 INFO L272 TraceCheckUtils]: 3: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:01,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {16772#(<= |fibo2_#in~n| 1)} assume true; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:01,011 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16772#(<= |fibo2_#in~n| 1)} {16759#(= fibo1_~n |fibo1_#in~n|)} #50#return; {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:01,011 INFO L272 TraceCheckUtils]: 9: Hoare triple {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,011 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16632#true} {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {16770#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {16770#(<= |fibo1_#in~n| 2)} assume true; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,012 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16770#(<= |fibo1_#in~n| 2)} {16632#true} #46#return; {16717#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:01,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:01,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,084 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L272 TraceCheckUtils]: 3: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L272 TraceCheckUtils]: 9: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,089 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:01,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:01,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,089 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16632#true} {16632#true} #46#return; {16632#true} is VALID [2022-02-21 04:20:01,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16632#true} {16632#true} #48#return; {16632#true} is VALID [2022-02-21 04:20:01,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,092 INFO L272 TraceCheckUtils]: 3: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L272 TraceCheckUtils]: 7: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L272 TraceCheckUtils]: 13: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16632#true} {16632#true} #46#return; {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L272 TraceCheckUtils]: 21: Hoare triple {16632#true} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,094 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16632#true} {16632#true} #48#return; {16632#true} is VALID [2022-02-21 04:20:01,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {16632#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16632#true} is VALID [2022-02-21 04:20:01,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,094 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:01,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-21 04:20:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16773#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:01,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {16773#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:01,100 INFO L272 TraceCheckUtils]: 3: Hoare triple {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,100 INFO L272 TraceCheckUtils]: 7: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L272 TraceCheckUtils]: 17: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:01,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,102 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {16632#true} {16632#true} #46#return; {16632#true} is VALID [2022-02-21 04:20:01,102 INFO L272 TraceCheckUtils]: 25: Hoare triple {16632#true} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,102 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16632#true} {16632#true} #48#return; {16632#true} is VALID [2022-02-21 04:20:01,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {16632#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16632#true} is VALID [2022-02-21 04:20:01,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,102 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:01,103 INFO L272 TraceCheckUtils]: 33: Hoare triple {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,103 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} assume true; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,110 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16808#(<= 2 |fibo1_#in~n|)} {16717#(<= fibo2_~n 3)} #48#return; {16633#false} is VALID [2022-02-21 04:20:01,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,111 INFO L272 TraceCheckUtils]: 3: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,112 INFO L272 TraceCheckUtils]: 7: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {16632#true} ~n := #in~n; {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:01,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {16772#(<= |fibo2_#in~n| 1)} assume true; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:01,113 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16772#(<= |fibo2_#in~n| 1)} {16759#(= fibo1_~n |fibo1_#in~n|)} #50#return; {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:01,114 INFO L272 TraceCheckUtils]: 13: Hoare triple {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,114 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16632#true} {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {16770#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {16770#(<= |fibo1_#in~n| 2)} assume true; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,115 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16770#(<= |fibo1_#in~n| 2)} {16632#true} #46#return; {16717#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:01,115 INFO L272 TraceCheckUtils]: 21: Hoare triple {16717#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {16632#true} ~n := #in~n; {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16773#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:01,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {16773#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:01,116 INFO L272 TraceCheckUtils]: 25: Hoare triple {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,116 INFO L272 TraceCheckUtils]: 29: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L272 TraceCheckUtils]: 33: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L272 TraceCheckUtils]: 39: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L290 TraceCheckUtils]: 40: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L290 TraceCheckUtils]: 42: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,117 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16632#true} {16632#true} #46#return; {16632#true} is VALID [2022-02-21 04:20:01,118 INFO L272 TraceCheckUtils]: 47: Hoare triple {16632#true} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,118 INFO L290 TraceCheckUtils]: 48: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,118 INFO L290 TraceCheckUtils]: 49: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,118 INFO L290 TraceCheckUtils]: 50: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,118 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16632#true} {16632#true} #48#return; {16632#true} is VALID [2022-02-21 04:20:01,118 INFO L290 TraceCheckUtils]: 52: Hoare triple {16632#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16632#true} is VALID [2022-02-21 04:20:01,118 INFO L290 TraceCheckUtils]: 53: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,118 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:01,118 INFO L272 TraceCheckUtils]: 55: Hoare triple {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,119 INFO L290 TraceCheckUtils]: 57: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,119 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,119 INFO L290 TraceCheckUtils]: 60: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,120 INFO L290 TraceCheckUtils]: 61: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} assume true; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,120 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {16808#(<= 2 |fibo1_#in~n|)} {16717#(<= fibo2_~n 3)} #48#return; {16633#false} is VALID [2022-02-21 04:20:01,120 INFO L290 TraceCheckUtils]: 63: Hoare triple {16633#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16633#false} is VALID [2022-02-21 04:20:01,120 INFO L290 TraceCheckUtils]: 64: Hoare triple {16633#false} assume true; {16633#false} is VALID [2022-02-21 04:20:01,120 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {16633#false} {16632#true} #50#return; {16633#false} is VALID [2022-02-21 04:20:01,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,121 INFO L272 TraceCheckUtils]: 3: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,121 INFO L272 TraceCheckUtils]: 7: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,121 INFO L272 TraceCheckUtils]: 11: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {16632#true} ~n := #in~n; {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,122 INFO L272 TraceCheckUtils]: 15: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {16632#true} ~n := #in~n; {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {16771#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {16771#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:01,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {16772#(<= |fibo2_#in~n| 1)} assume true; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:01,124 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16772#(<= |fibo2_#in~n| 1)} {16759#(= fibo1_~n |fibo1_#in~n|)} #50#return; {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:01,124 INFO L272 TraceCheckUtils]: 21: Hoare triple {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,124 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16632#true} {16765#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {16770#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {16770#(<= |fibo1_#in~n| 2)} assume true; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,125 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16770#(<= |fibo1_#in~n| 2)} {16632#true} #46#return; {16717#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:01,125 INFO L272 TraceCheckUtils]: 29: Hoare triple {16717#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {16632#true} ~n := #in~n; {16759#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {16759#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16773#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:01,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {16773#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:01,126 INFO L272 TraceCheckUtils]: 33: Hoare triple {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,126 INFO L290 TraceCheckUtils]: 34: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L272 TraceCheckUtils]: 37: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L272 TraceCheckUtils]: 41: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L272 TraceCheckUtils]: 47: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L290 TraceCheckUtils]: 49: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L290 TraceCheckUtils]: 50: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:01,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,128 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16632#true} {16632#true} #46#return; {16632#true} is VALID [2022-02-21 04:20:01,128 INFO L272 TraceCheckUtils]: 55: Hoare triple {16632#true} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,128 INFO L290 TraceCheckUtils]: 56: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,128 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16632#true} {16632#true} #48#return; {16632#true} is VALID [2022-02-21 04:20:01,128 INFO L290 TraceCheckUtils]: 60: Hoare triple {16632#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16632#true} is VALID [2022-02-21 04:20:01,128 INFO L290 TraceCheckUtils]: 61: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,128 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:01,128 INFO L272 TraceCheckUtils]: 63: Hoare triple {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,128 INFO L290 TraceCheckUtils]: 64: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,129 INFO L290 TraceCheckUtils]: 65: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,129 INFO L290 TraceCheckUtils]: 66: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,129 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {16632#true} {16774#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,129 INFO L290 TraceCheckUtils]: 68: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,130 INFO L290 TraceCheckUtils]: 69: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} assume true; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,130 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16808#(<= 2 |fibo1_#in~n|)} {16717#(<= fibo2_~n 3)} #48#return; {16633#false} is VALID [2022-02-21 04:20:01,130 INFO L290 TraceCheckUtils]: 71: Hoare triple {16633#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16633#false} is VALID [2022-02-21 04:20:01,130 INFO L290 TraceCheckUtils]: 72: Hoare triple {16633#false} assume true; {16633#false} is VALID [2022-02-21 04:20:01,130 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16633#false} {16632#true} #50#return; {16633#false} is VALID [2022-02-21 04:20:01,130 INFO L272 TraceCheckUtils]: 74: Hoare triple {16633#false} call #t~ret5 := fibo2(~n - 2); {16633#false} is VALID [2022-02-21 04:20:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 34 proven. 36 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-02-21 04:20:01,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:01,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407914849] [2022-02-21 04:20:01,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407914849] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:01,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073615718] [2022-02-21 04:20:01,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:01,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:01,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:01,136 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:20:01,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-02-21 04:20:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:20:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:01,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:01,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,487 INFO L272 TraceCheckUtils]: 3: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,487 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,487 INFO L272 TraceCheckUtils]: 7: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,488 INFO L272 TraceCheckUtils]: 11: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {16632#true} ~n := #in~n; {16878#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:01,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {16878#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {16878#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:01,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {16878#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {16878#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:01,489 INFO L272 TraceCheckUtils]: 15: Hoare triple {16878#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {16632#true} ~n := #in~n; {16891#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:01,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {16891#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {16891#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:01,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {16891#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:01,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {16772#(<= |fibo2_#in~n| 1)} assume true; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:01,491 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16772#(<= |fibo2_#in~n| 1)} {16878#(<= |fibo1_#in~n| fibo1_~n)} #50#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,491 INFO L272 TraceCheckUtils]: 21: Hoare triple {16770#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,491 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16632#true} {16770#(<= |fibo1_#in~n| 2)} #52#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {16770#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {16770#(<= |fibo1_#in~n| 2)} assume true; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:01,492 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16770#(<= |fibo1_#in~n| 2)} {16632#true} #46#return; {16717#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:01,492 INFO L272 TraceCheckUtils]: 29: Hoare triple {16717#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {16632#true} ~n := #in~n; {16934#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {16934#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {16934#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {16934#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {16934#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,514 INFO L272 TraceCheckUtils]: 33: Hoare triple {16934#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {16632#true} ~n := #in~n; {16947#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {16947#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,515 INFO L272 TraceCheckUtils]: 37: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L272 TraceCheckUtils]: 41: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L272 TraceCheckUtils]: 47: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:01,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,517 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16632#true} {16951#(<= 1 |fibo2_#in~n|)} #46#return; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,517 INFO L272 TraceCheckUtils]: 55: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,517 INFO L290 TraceCheckUtils]: 56: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,517 INFO L290 TraceCheckUtils]: 57: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,518 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16632#true} {16951#(<= 1 |fibo2_#in~n|)} #48#return; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} assume true; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:01,519 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {16951#(<= 1 |fibo2_#in~n|)} {16934#(<= fibo1_~n |fibo1_#in~n|)} #50#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,519 INFO L272 TraceCheckUtils]: 63: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:01,519 INFO L290 TraceCheckUtils]: 64: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:01,519 INFO L290 TraceCheckUtils]: 65: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:01,519 INFO L290 TraceCheckUtils]: 66: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:01,520 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {16632#true} {16808#(<= 2 |fibo1_#in~n|)} #52#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,520 INFO L290 TraceCheckUtils]: 68: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,520 INFO L290 TraceCheckUtils]: 69: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} assume true; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:01,521 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16808#(<= 2 |fibo1_#in~n|)} {16717#(<= fibo2_~n 3)} #48#return; {16633#false} is VALID [2022-02-21 04:20:01,521 INFO L290 TraceCheckUtils]: 71: Hoare triple {16633#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16633#false} is VALID [2022-02-21 04:20:01,521 INFO L290 TraceCheckUtils]: 72: Hoare triple {16633#false} assume true; {16633#false} is VALID [2022-02-21 04:20:01,521 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16633#false} {16632#true} #50#return; {16633#false} is VALID [2022-02-21 04:20:01,521 INFO L272 TraceCheckUtils]: 74: Hoare triple {16633#false} call #t~ret5 := fibo2(~n - 2); {16633#false} is VALID [2022-02-21 04:20:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-02-21 04:20:01,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:02,714 INFO L272 TraceCheckUtils]: 74: Hoare triple {16633#false} call #t~ret5 := fibo2(~n - 2); {16633#false} is VALID [2022-02-21 04:20:02,714 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16633#false} {16632#true} #50#return; {16633#false} is VALID [2022-02-21 04:20:02,714 INFO L290 TraceCheckUtils]: 72: Hoare triple {16633#false} assume true; {16633#false} is VALID [2022-02-21 04:20:02,714 INFO L290 TraceCheckUtils]: 71: Hoare triple {16633#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16633#false} is VALID [2022-02-21 04:20:02,716 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16808#(<= 2 |fibo1_#in~n|)} {16717#(<= fibo2_~n 3)} #48#return; {16633#false} is VALID [2022-02-21 04:20:02,716 INFO L290 TraceCheckUtils]: 69: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} assume true; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,717 INFO L290 TraceCheckUtils]: 68: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,717 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {16632#true} {16808#(<= 2 |fibo1_#in~n|)} #52#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,717 INFO L290 TraceCheckUtils]: 66: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,717 INFO L290 TraceCheckUtils]: 65: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,717 INFO L290 TraceCheckUtils]: 64: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,717 INFO L272 TraceCheckUtils]: 63: Hoare triple {16808#(<= 2 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,718 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {16951#(<= 1 |fibo2_#in~n|)} {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} #50#return; {16808#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:02,718 INFO L290 TraceCheckUtils]: 61: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} assume true; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,718 INFO L290 TraceCheckUtils]: 60: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,719 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16632#true} {16951#(<= 1 |fibo2_#in~n|)} #48#return; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,719 INFO L272 TraceCheckUtils]: 55: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16632#true} {16951#(<= 1 |fibo2_#in~n|)} #46#return; {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {16632#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16632#true} {16632#true} #52#return; {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L272 TraceCheckUtils]: 47: Hoare triple {16632#true} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16632#true} {16632#true} #50#return; {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {16632#true} assume 1 == ~n;#res := 1; {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L272 TraceCheckUtils]: 41: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L290 TraceCheckUtils]: 40: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L290 TraceCheckUtils]: 39: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,721 INFO L272 TraceCheckUtils]: 37: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {16951#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {17196#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} assume !(~n < 1); {16951#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:02,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {16632#true} ~n := #in~n; {17196#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} is VALID [2022-02-21 04:20:02,731 INFO L272 TraceCheckUtils]: 33: Hoare triple {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} assume !(1 == ~n); {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:20:02,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} assume !(~n < 1); {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:20:02,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {16632#true} ~n := #in~n; {17111#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:20:02,732 INFO L272 TraceCheckUtils]: 29: Hoare triple {16717#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,733 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16770#(<= |fibo1_#in~n| 2)} {16632#true} #46#return; {16717#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:02,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {16770#(<= |fibo1_#in~n| 2)} assume true; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {16770#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,734 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16632#true} {16770#(<= |fibo1_#in~n| 2)} #52#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {16632#true} assume true; {16632#true} is VALID [2022-02-21 04:20:02,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {16632#true} assume ~n < 1;#res := 0; {16632#true} is VALID [2022-02-21 04:20:02,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,734 INFO L272 TraceCheckUtils]: 21: Hoare triple {16770#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {16632#true} is VALID [2022-02-21 04:20:02,735 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16772#(<= |fibo2_#in~n| 1)} {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} #50#return; {16770#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:02,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {16772#(<= |fibo2_#in~n| 1)} assume true; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:02,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {17249#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume 1 == ~n;#res := 1; {16772#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:02,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {17249#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume !(~n < 1); {17249#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:20:02,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {16632#true} ~n := #in~n; {17249#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:20:02,736 INFO L272 TraceCheckUtils]: 15: Hoare triple {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(1 == ~n); {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:20:02,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(~n < 1); {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:20:02,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {16632#true} ~n := #in~n; {17239#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:20:02,737 INFO L272 TraceCheckUtils]: 11: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,737 INFO L272 TraceCheckUtils]: 7: Hoare triple {16632#true} call #t~ret4 := fibo2(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,737 INFO L272 TraceCheckUtils]: 3: Hoare triple {16632#true} call #t~ret6 := fibo1(~n - 1); {16632#true} is VALID [2022-02-21 04:20:02,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {16632#true} assume !(1 == ~n); {16632#true} is VALID [2022-02-21 04:20:02,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {16632#true} assume !(~n < 1); {16632#true} is VALID [2022-02-21 04:20:02,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {16632#true} ~n := #in~n; {16632#true} is VALID [2022-02-21 04:20:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-02-21 04:20:02,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073615718] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:02,738 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:02,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-02-21 04:20:02,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524024713] [2022-02-21 04:20:02,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:02,739 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:20:02,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:02,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 04:20:02,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-02-21 04:20:02,740 INFO L87 Difference]: Start difference. First operand 381 states and 523 transitions. cyclomatic complexity: 149 Second operand has 20 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 10 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-21 04:20:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:03,641 INFO L93 Difference]: Finished difference Result 412 states and 577 transitions. [2022-02-21 04:20:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-21 04:20:03,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 10 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-21 04:20:03,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:03,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 412 states and 577 transitions. [2022-02-21 04:20:03,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:20:03,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 412 states to 412 states and 577 transitions. [2022-02-21 04:20:03,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2022-02-21 04:20:03,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2022-02-21 04:20:03,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 577 transitions. [2022-02-21 04:20:03,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:03,725 INFO L681 BuchiCegarLoop]: Abstraction has 412 states and 577 transitions. [2022-02-21 04:20:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 577 transitions. [2022-02-21 04:20:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 394. [2022-02-21 04:20:03,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:03,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 412 states and 577 transitions. Second operand has 394 states, 255 states have (on average 1.219607843137255) internal successors, (311), 286 states have internal predecessors, (311), 80 states have call successors, (83), 54 states have call predecessors, (83), 59 states have return successors, (145), 53 states have call predecessors, (145), 78 states have call successors, (145) [2022-02-21 04:20:03,732 INFO L74 IsIncluded]: Start isIncluded. First operand 412 states and 577 transitions. Second operand has 394 states, 255 states have (on average 1.219607843137255) internal successors, (311), 286 states have internal predecessors, (311), 80 states have call successors, (83), 54 states have call predecessors, (83), 59 states have return successors, (145), 53 states have call predecessors, (145), 78 states have call successors, (145) [2022-02-21 04:20:03,733 INFO L87 Difference]: Start difference. First operand 412 states and 577 transitions. Second operand has 394 states, 255 states have (on average 1.219607843137255) internal successors, (311), 286 states have internal predecessors, (311), 80 states have call successors, (83), 54 states have call predecessors, (83), 59 states have return successors, (145), 53 states have call predecessors, (145), 78 states have call successors, (145) [2022-02-21 04:20:03,733 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:03,773 INFO L93 Difference]: Finished difference Result 1013 states and 1418 transitions. [2022-02-21 04:20:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1418 transitions. [2022-02-21 04:20:03,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:03,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:03,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 394 states, 255 states have (on average 1.219607843137255) internal successors, (311), 286 states have internal predecessors, (311), 80 states have call successors, (83), 54 states have call predecessors, (83), 59 states have return successors, (145), 53 states have call predecessors, (145), 78 states have call successors, (145) Second operand 412 states and 577 transitions. [2022-02-21 04:20:03,779 INFO L87 Difference]: Start difference. First operand has 394 states, 255 states have (on average 1.219607843137255) internal successors, (311), 286 states have internal predecessors, (311), 80 states have call successors, (83), 54 states have call predecessors, (83), 59 states have return successors, (145), 53 states have call predecessors, (145), 78 states have call successors, (145) Second operand 412 states and 577 transitions. [2022-02-21 04:20:03,780 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:03,824 INFO L93 Difference]: Finished difference Result 1013 states and 1418 transitions. [2022-02-21 04:20:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1418 transitions. [2022-02-21 04:20:03,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:03,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:03,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:03,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 255 states have (on average 1.219607843137255) internal successors, (311), 286 states have internal predecessors, (311), 80 states have call successors, (83), 54 states have call predecessors, (83), 59 states have return successors, (145), 53 states have call predecessors, (145), 78 states have call successors, (145) [2022-02-21 04:20:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 539 transitions. [2022-02-21 04:20:03,837 INFO L704 BuchiCegarLoop]: Abstraction has 394 states and 539 transitions. [2022-02-21 04:20:03,837 INFO L587 BuchiCegarLoop]: Abstraction has 394 states and 539 transitions. [2022-02-21 04:20:03,837 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:20:03,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 394 states and 539 transitions. [2022-02-21 04:20:03,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 60 [2022-02-21 04:20:03,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:03,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:03,840 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:03,840 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1] [2022-02-21 04:20:03,841 INFO L791 eck$LassoCheckResult]: Stem: 17720#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 17721#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; 17754#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 17803#fibo1ENTRY ~n := #in~n; 17856#L10 assume !(~n < 1); 17855#L12 assume !(1 == ~n); 17851#L15 call #t~ret4 := fibo2(~n - 1);< 17854#fibo2ENTRY ~n := #in~n; 17853#L20 assume !(~n < 1); 17852#L22 assume !(1 == ~n); 17847#L25 call #t~ret6 := fibo1(~n - 1);< 17850#fibo1ENTRY ~n := #in~n; 17849#L10 assume !(~n < 1); 17848#L12 assume !(1 == ~n); 17839#L15 call #t~ret4 := fibo2(~n - 1);< 17845#fibo2ENTRY ~n := #in~n; 17844#L20 assume !(~n < 1); 17841#L22 assume !(1 == ~n); 17772#L25 call #t~ret6 := fibo1(~n - 1);< 17840#fibo1ENTRY ~n := #in~n; 17829#L10 assume !(~n < 1); 17830#L12 assume !(1 == ~n); 17816#L15 call #t~ret4 := fibo2(~n - 1);< 17817#fibo2ENTRY ~n := #in~n; 17831#L20 assume !(~n < 1); 17832#L22 assume !(1 == ~n); 17774#L25 call #t~ret6 := fibo1(~n - 1);< 17840#fibo1ENTRY ~n := #in~n; 17842#L10 assume !(~n < 1); 17952#L12 assume 1 == ~n;#res := 1; 17950#fibo1FINAL assume true; 17947#fibo1EXIT >#46#return; 17913#L25-1 call #t~ret7 := fibo1(~n - 2);< 17931#fibo1ENTRY ~n := #in~n; 18007#L10 assume ~n < 1;#res := 0; 18008#fibo1FINAL assume true; 18067#fibo1EXIT >#48#return; 18000#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 18054#fibo2FINAL assume true; 18020#fibo2EXIT >#50#return; 17936#L15-1 [2022-02-21 04:20:03,842 INFO L793 eck$LassoCheckResult]: Loop: 17936#L15-1 call #t~ret5 := fibo2(~n - 2);< 17940#fibo2ENTRY ~n := #in~n; 17796#L20 assume !(~n < 1); 17939#L22 assume !(1 == ~n); 17735#L25 call #t~ret6 := fibo1(~n - 1);< 17953#fibo1ENTRY ~n := #in~n; 17948#L10 assume !(~n < 1); 17949#L12 assume !(1 == ~n); 17795#L15 call #t~ret4 := fibo2(~n - 1);< 17793#fibo2ENTRY ~n := #in~n; 17796#L20 assume !(~n < 1); 17939#L22 assume !(1 == ~n); 17735#L25 call #t~ret6 := fibo1(~n - 1);< 17953#fibo1ENTRY ~n := #in~n; 17948#L10 assume !(~n < 1); 17949#L12 assume !(1 == ~n); 17795#L15 call #t~ret4 := fibo2(~n - 1);< 17793#fibo2ENTRY ~n := #in~n; 17797#L20 assume !(~n < 1); 18030#L22 assume 1 == ~n;#res := 1; 18027#fibo2FINAL assume true; 18021#fibo2EXIT >#50#return; 17936#L15-1 call #t~ret5 := fibo2(~n - 2);< 17940#fibo2ENTRY ~n := #in~n; 17941#L20 assume ~n < 1;#res := 0; 18031#fibo2FINAL assume true; 18018#fibo2EXIT >#52#return; 17987#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 17974#fibo1FINAL assume true; 17964#fibo1EXIT >#46#return; 17966#L25-1 call #t~ret7 := fibo1(~n - 2);< 17978#fibo1ENTRY ~n := #in~n; 18011#L10 assume !(~n < 1); 18013#L12 assume !(1 == ~n); 17977#L15 call #t~ret4 := fibo2(~n - 1);< 17998#fibo2ENTRY ~n := #in~n; 17984#L20 assume !(~n < 1); 17980#L22 assume !(1 == ~n); 17967#L25 call #t~ret6 := fibo1(~n - 1);< 17978#fibo1ENTRY ~n := #in~n; 18011#L10 assume !(~n < 1); 18013#L12 assume !(1 == ~n); 17977#L15 call #t~ret4 := fibo2(~n - 1);< 17998#fibo2ENTRY ~n := #in~n; 17984#L20 assume !(~n < 1); 17980#L22 assume 1 == ~n;#res := 1; 17981#fibo2FINAL assume true; 18024#fibo2EXIT >#50#return; 17936#L15-1 call #t~ret5 := fibo2(~n - 2);< 17940#fibo2ENTRY ~n := #in~n; 17941#L20 assume ~n < 1;#res := 0; 18031#fibo2FINAL assume true; 18018#fibo2EXIT >#52#return; 17987#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 17974#fibo1FINAL assume true; 17964#fibo1EXIT >#46#return; 17966#L25-1 call #t~ret7 := fibo1(~n - 2);< 17978#fibo1ENTRY ~n := #in~n; 18011#L10 assume !(~n < 1); 18013#L12 assume 1 == ~n;#res := 1; 18003#fibo1FINAL assume true; 18001#fibo1EXIT >#48#return; 17969#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 18049#fibo2FINAL assume true; 18019#fibo2EXIT >#50#return; 17936#L15-1 call #t~ret5 := fibo2(~n - 2);< 17940#fibo2ENTRY ~n := #in~n; 17941#L20 assume ~n < 1;#res := 0; 18031#fibo2FINAL assume true; 18018#fibo2EXIT >#52#return; 17987#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 17974#fibo1FINAL assume true; 17964#fibo1EXIT >#48#return; 17969#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 18049#fibo2FINAL assume true; 18019#fibo2EXIT >#50#return; 17936#L15-1 [2022-02-21 04:20:03,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1448014817, now seen corresponding path program 1 times [2022-02-21 04:20:03,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:03,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278036742] [2022-02-21 04:20:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:03,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:03,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-21 04:20:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:03,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:03,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:03,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {21436#true} assume !(~n < 1); {21436#true} is VALID [2022-02-21 04:20:03,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {21436#true} assume 1 == ~n;#res := 1; {21436#true} is VALID [2022-02-21 04:20:03,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:03,994 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21436#true} {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #46#return; {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:03,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:03,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:03,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {21436#true} assume ~n < 1;#res := 0; {21436#true} is VALID [2022-02-21 04:20:03,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:04,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21436#true} {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #48#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {21436#true} ~n := #in~n; {21466#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {21466#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21467#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:04,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {21467#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:04,002 INFO L272 TraceCheckUtils]: 3: Hoare triple {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret6 := fibo1(~n - 1); {21436#true} is VALID [2022-02-21 04:20:04,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:04,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {21436#true} assume !(~n < 1); {21436#true} is VALID [2022-02-21 04:20:04,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {21436#true} assume 1 == ~n;#res := 1; {21436#true} is VALID [2022-02-21 04:20:04,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:04,003 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {21436#true} {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #46#return; {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:04,003 INFO L272 TraceCheckUtils]: 9: Hoare triple {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {21436#true} is VALID [2022-02-21 04:20:04,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:04,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {21436#true} assume ~n < 1;#res := 0; {21436#true} is VALID [2022-02-21 04:20:04,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:04,004 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {21436#true} {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #48#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} assume true; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,005 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21478#(<= 2 |fibo2_#in~n|)} {21448#(<= fibo1_~n 2)} #50#return; {21437#false} is VALID [2022-02-21 04:20:04,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {21436#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21436#true} is VALID [2022-02-21 04:20:04,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {21436#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {21438#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:04,006 INFO L272 TraceCheckUtils]: 2: Hoare triple {21438#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {21439#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:04,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {21439#(<= |fibo1_#in~n| 6)} ~n := #in~n; {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:04,006 INFO L290 TraceCheckUtils]: 4: Hoare triple {21440#(<= fibo1_~n 6)} assume !(~n < 1); {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:04,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {21440#(<= fibo1_~n 6)} assume !(1 == ~n); {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:04,007 INFO L272 TraceCheckUtils]: 6: Hoare triple {21440#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {21441#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:04,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {21441#(<= |fibo2_#in~n| 5)} ~n := #in~n; {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:04,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {21442#(<= fibo2_~n 5)} assume !(~n < 1); {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:04,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {21442#(<= fibo2_~n 5)} assume !(1 == ~n); {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:04,008 INFO L272 TraceCheckUtils]: 10: Hoare triple {21442#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {21443#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:04,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {21443#(<= |fibo1_#in~n| 4)} ~n := #in~n; {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:04,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {21444#(<= fibo1_~n 4)} assume !(~n < 1); {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:04,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {21444#(<= fibo1_~n 4)} assume !(1 == ~n); {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:04,010 INFO L272 TraceCheckUtils]: 14: Hoare triple {21444#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {21445#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:04,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {21445#(<= |fibo2_#in~n| 3)} ~n := #in~n; {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:04,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {21446#(<= fibo2_~n 3)} assume !(~n < 1); {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:04,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {21446#(<= fibo2_~n 3)} assume !(1 == ~n); {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:04,011 INFO L272 TraceCheckUtils]: 18: Hoare triple {21446#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {21447#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:04,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {21447#(<= |fibo1_#in~n| 2)} ~n := #in~n; {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:04,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {21448#(<= fibo1_~n 2)} assume !(~n < 1); {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:04,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {21448#(<= fibo1_~n 2)} assume !(1 == ~n); {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:04,012 INFO L272 TraceCheckUtils]: 22: Hoare triple {21448#(<= fibo1_~n 2)} call #t~ret4 := fibo2(~n - 1); {21436#true} is VALID [2022-02-21 04:20:04,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {21436#true} ~n := #in~n; {21466#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {21466#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21467#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:04,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {21467#(and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} assume !(1 == ~n); {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:04,013 INFO L272 TraceCheckUtils]: 26: Hoare triple {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret6 := fibo1(~n - 1); {21436#true} is VALID [2022-02-21 04:20:04,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:04,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {21436#true} assume !(~n < 1); {21436#true} is VALID [2022-02-21 04:20:04,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {21436#true} assume 1 == ~n;#res := 1; {21436#true} is VALID [2022-02-21 04:20:04,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:04,014 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21436#true} {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #46#return; {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:04,014 INFO L272 TraceCheckUtils]: 32: Hoare triple {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {21436#true} is VALID [2022-02-21 04:20:04,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:04,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {21436#true} assume ~n < 1;#res := 0; {21436#true} is VALID [2022-02-21 04:20:04,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:04,015 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21436#true} {21468#(and (not (<= fibo2_~n 1)) (= fibo2_~n |fibo2_#in~n|))} #48#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} assume true; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,016 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21478#(<= 2 |fibo2_#in~n|)} {21448#(<= fibo1_~n 2)} #50#return; {21437#false} is VALID [2022-02-21 04:20:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 04:20:04,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:04,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278036742] [2022-02-21 04:20:04,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278036742] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:04,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847787159] [2022-02-21 04:20:04,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:04,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:04,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:04,019 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:20:04,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-02-21 04:20:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 04:20:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:04,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {21436#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21436#true} is VALID [2022-02-21 04:20:04,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {21436#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {21438#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:04,306 INFO L272 TraceCheckUtils]: 2: Hoare triple {21438#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {21439#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:04,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {21439#(<= |fibo1_#in~n| 6)} ~n := #in~n; {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:04,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {21440#(<= fibo1_~n 6)} assume !(~n < 1); {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:04,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {21440#(<= fibo1_~n 6)} assume !(1 == ~n); {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:04,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {21440#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {21441#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:04,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {21441#(<= |fibo2_#in~n| 5)} ~n := #in~n; {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:04,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {21442#(<= fibo2_~n 5)} assume !(~n < 1); {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:04,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {21442#(<= fibo2_~n 5)} assume !(1 == ~n); {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:04,308 INFO L272 TraceCheckUtils]: 10: Hoare triple {21442#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {21443#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:04,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {21443#(<= |fibo1_#in~n| 4)} ~n := #in~n; {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:04,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {21444#(<= fibo1_~n 4)} assume !(~n < 1); {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:04,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {21444#(<= fibo1_~n 4)} assume !(1 == ~n); {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:04,309 INFO L272 TraceCheckUtils]: 14: Hoare triple {21444#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {21445#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:04,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {21445#(<= |fibo2_#in~n| 3)} ~n := #in~n; {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:04,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {21446#(<= fibo2_~n 3)} assume !(~n < 1); {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:04,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {21446#(<= fibo2_~n 3)} assume !(1 == ~n); {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:04,311 INFO L272 TraceCheckUtils]: 18: Hoare triple {21446#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {21447#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:04,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {21447#(<= |fibo1_#in~n| 2)} ~n := #in~n; {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:04,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {21448#(<= fibo1_~n 2)} assume !(~n < 1); {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:04,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {21448#(<= fibo1_~n 2)} assume !(1 == ~n); {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:04,311 INFO L272 TraceCheckUtils]: 22: Hoare triple {21448#(<= fibo1_~n 2)} call #t~ret4 := fibo2(~n - 1); {21436#true} is VALID [2022-02-21 04:20:04,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {21436#true} ~n := #in~n; {21551#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {21551#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21551#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {21551#(<= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {21551#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,312 INFO L272 TraceCheckUtils]: 26: Hoare triple {21551#(<= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {21436#true} is VALID [2022-02-21 04:20:04,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {21436#true} ~n := #in~n; {21564#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:04,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {21564#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21568#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:04,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {21568#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {21568#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:04,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {21568#(<= 1 |fibo1_#in~n|)} assume true; {21568#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:04,314 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21568#(<= 1 |fibo1_#in~n|)} {21551#(<= fibo2_~n |fibo2_#in~n|)} #46#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,314 INFO L272 TraceCheckUtils]: 32: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {21436#true} is VALID [2022-02-21 04:20:04,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:04,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {21436#true} assume ~n < 1;#res := 0; {21436#true} is VALID [2022-02-21 04:20:04,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:04,315 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21436#true} {21478#(<= 2 |fibo2_#in~n|)} #48#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} assume true; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,316 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21478#(<= 2 |fibo2_#in~n|)} {21448#(<= fibo1_~n 2)} #50#return; {21437#false} is VALID [2022-02-21 04:20:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:20:04,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:04,797 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21478#(<= 2 |fibo2_#in~n|)} {21448#(<= fibo1_~n 2)} #50#return; {21437#false} is VALID [2022-02-21 04:20:04,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} assume true; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,799 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21436#true} {21478#(<= 2 |fibo2_#in~n|)} #48#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {21436#true} assume true; {21436#true} is VALID [2022-02-21 04:20:04,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {21436#true} assume ~n < 1;#res := 0; {21436#true} is VALID [2022-02-21 04:20:04,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {21436#true} ~n := #in~n; {21436#true} is VALID [2022-02-21 04:20:04,799 INFO L272 TraceCheckUtils]: 32: Hoare triple {21478#(<= 2 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {21436#true} is VALID [2022-02-21 04:20:04,799 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21568#(<= 1 |fibo1_#in~n|)} {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} #46#return; {21478#(<= 2 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {21568#(<= 1 |fibo1_#in~n|)} assume true; {21568#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:04,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {21568#(<= 1 |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {21568#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:04,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {21642#(or (< fibo1_~n 1) (<= 1 |fibo1_#in~n|))} assume !(~n < 1); {21568#(<= 1 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:04,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {21436#true} ~n := #in~n; {21642#(or (< fibo1_~n 1) (<= 1 |fibo1_#in~n|))} is VALID [2022-02-21 04:20:04,801 INFO L272 TraceCheckUtils]: 26: Hoare triple {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} call #t~ret6 := fibo1(~n - 1); {21436#true} is VALID [2022-02-21 04:20:04,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} assume !(1 == ~n); {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} is VALID [2022-02-21 04:20:04,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} assume !(~n < 1); {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} is VALID [2022-02-21 04:20:04,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {21436#true} ~n := #in~n; {21629#(or (< fibo2_~n 2) (<= 2 |fibo2_#in~n|))} is VALID [2022-02-21 04:20:04,804 INFO L272 TraceCheckUtils]: 22: Hoare triple {21448#(<= fibo1_~n 2)} call #t~ret4 := fibo2(~n - 1); {21436#true} is VALID [2022-02-21 04:20:04,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {21448#(<= fibo1_~n 2)} assume !(1 == ~n); {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:04,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {21448#(<= fibo1_~n 2)} assume !(~n < 1); {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:04,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {21447#(<= |fibo1_#in~n| 2)} ~n := #in~n; {21448#(<= fibo1_~n 2)} is VALID [2022-02-21 04:20:04,805 INFO L272 TraceCheckUtils]: 18: Hoare triple {21446#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {21447#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:04,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {21446#(<= fibo2_~n 3)} assume !(1 == ~n); {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:04,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {21446#(<= fibo2_~n 3)} assume !(~n < 1); {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:04,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {21445#(<= |fibo2_#in~n| 3)} ~n := #in~n; {21446#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:04,807 INFO L272 TraceCheckUtils]: 14: Hoare triple {21444#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {21445#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:04,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {21444#(<= fibo1_~n 4)} assume !(1 == ~n); {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:04,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {21444#(<= fibo1_~n 4)} assume !(~n < 1); {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:04,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {21443#(<= |fibo1_#in~n| 4)} ~n := #in~n; {21444#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:04,808 INFO L272 TraceCheckUtils]: 10: Hoare triple {21442#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {21443#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:04,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {21442#(<= fibo2_~n 5)} assume !(1 == ~n); {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:04,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {21442#(<= fibo2_~n 5)} assume !(~n < 1); {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:04,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {21441#(<= |fibo2_#in~n| 5)} ~n := #in~n; {21442#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:04,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {21440#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {21441#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:04,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {21440#(<= fibo1_~n 6)} assume !(1 == ~n); {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:04,810 INFO L290 TraceCheckUtils]: 4: Hoare triple {21440#(<= fibo1_~n 6)} assume !(~n < 1); {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:04,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {21439#(<= |fibo1_#in~n| 6)} ~n := #in~n; {21440#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:04,810 INFO L272 TraceCheckUtils]: 2: Hoare triple {21438#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {21439#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:04,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {21436#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {21438#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:04,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {21436#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21436#true} is VALID [2022-02-21 04:20:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:20:04,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847787159] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:04,811 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:04,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 21 [2022-02-21 04:20:04,811 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609601558] [2022-02-21 04:20:04,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:04,812 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash 651349219, now seen corresponding path program 1 times [2022-02-21 04:20:04,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:04,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120016375] [2022-02-21 04:20:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:04,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-21 04:20:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:04,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {21860#(<= |fibo2_#in~n| 1)} assume true; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:04,902 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21860#(<= |fibo2_#in~n| 1)} {21847#(= fibo1_~n |fibo1_#in~n|)} #50#return; {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:04,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:04,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21718#true} {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:04,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:04,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:04,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:04,912 INFO L272 TraceCheckUtils]: 3: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:04,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {21718#true} ~n := #in~n; {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:04,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:04,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {21860#(<= |fibo2_#in~n| 1)} assume true; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:04,913 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {21860#(<= |fibo2_#in~n| 1)} {21847#(= fibo1_~n |fibo1_#in~n|)} #50#return; {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:04,914 INFO L272 TraceCheckUtils]: 9: Hoare triple {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:04,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:04,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,914 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {21718#true} {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:04,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {21858#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:04,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {21858#(<= |fibo1_#in~n| 2)} assume true; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:04,915 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21858#(<= |fibo1_#in~n| 2)} {21718#true} #46#return; {21804#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:04,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:04,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:04,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,980 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:04,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:04,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:04,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:04,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L272 TraceCheckUtils]: 3: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L272 TraceCheckUtils]: 9: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,984 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21718#true} {21718#true} #46#return; {21718#true} is VALID [2022-02-21 04:20:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:04,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21718#true} {21718#true} #48#return; {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L272 TraceCheckUtils]: 3: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L272 TraceCheckUtils]: 7: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,989 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L272 TraceCheckUtils]: 13: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21718#true} {21718#true} #46#return; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L272 TraceCheckUtils]: 21: Hoare triple {21718#true} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21718#true} {21718#true} #48#return; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {21718#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21718#true} is VALID [2022-02-21 04:20:04,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,991 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-21 04:20:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:04,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:04,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:04,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:04,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21861#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:04,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {21861#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:04,998 INFO L272 TraceCheckUtils]: 3: Hoare triple {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L272 TraceCheckUtils]: 7: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L272 TraceCheckUtils]: 11: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,998 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L272 TraceCheckUtils]: 17: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {21718#true} {21718#true} #46#return; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L272 TraceCheckUtils]: 25: Hoare triple {21718#true} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {21718#true} {21718#true} #48#return; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {21718#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21718#true} is VALID [2022-02-21 04:20:04,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,000 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:05,000 INFO L272 TraceCheckUtils]: 34: Hoare triple {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:05,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,001 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,001 INFO L290 TraceCheckUtils]: 39: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,001 INFO L290 TraceCheckUtils]: 40: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} assume true; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,002 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21897#(<= 2 |fibo1_#in~n|)} {21804#(<= fibo2_~n 3)} #48#return; {21719#false} is VALID [2022-02-21 04:20:05,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:05,002 INFO L272 TraceCheckUtils]: 3: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {21718#true} ~n := #in~n; {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,003 INFO L272 TraceCheckUtils]: 7: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {21718#true} ~n := #in~n; {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:05,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {21860#(<= |fibo2_#in~n| 1)} assume true; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:05,005 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {21860#(<= |fibo2_#in~n| 1)} {21847#(= fibo1_~n |fibo1_#in~n|)} #50#return; {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:05,005 INFO L272 TraceCheckUtils]: 13: Hoare triple {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:05,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,005 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21718#true} {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:05,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {21858#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:05,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {21858#(<= |fibo1_#in~n| 2)} assume true; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:05,006 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21858#(<= |fibo1_#in~n| 2)} {21718#true} #46#return; {21804#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:05,006 INFO L272 TraceCheckUtils]: 21: Hoare triple {21804#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {21718#true} ~n := #in~n; {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21861#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:05,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {21861#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:05,007 INFO L272 TraceCheckUtils]: 25: Hoare triple {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L272 TraceCheckUtils]: 29: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L272 TraceCheckUtils]: 33: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 35: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L272 TraceCheckUtils]: 39: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:05,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,009 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:05,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:05,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,009 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21718#true} {21718#true} #46#return; {21718#true} is VALID [2022-02-21 04:20:05,009 INFO L272 TraceCheckUtils]: 47: Hoare triple {21718#true} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:05,009 INFO L290 TraceCheckUtils]: 51: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,009 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21718#true} {21718#true} #48#return; {21718#true} is VALID [2022-02-21 04:20:05,009 INFO L290 TraceCheckUtils]: 53: Hoare triple {21718#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21718#true} is VALID [2022-02-21 04:20:05,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,010 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:05,010 INFO L272 TraceCheckUtils]: 56: Hoare triple {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,010 INFO L290 TraceCheckUtils]: 57: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,010 INFO L290 TraceCheckUtils]: 58: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:05,010 INFO L290 TraceCheckUtils]: 59: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,010 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,011 INFO L290 TraceCheckUtils]: 61: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,011 INFO L290 TraceCheckUtils]: 62: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} assume true; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,011 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21897#(<= 2 |fibo1_#in~n|)} {21804#(<= fibo2_~n 3)} #48#return; {21719#false} is VALID [2022-02-21 04:20:05,011 INFO L290 TraceCheckUtils]: 64: Hoare triple {21719#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21719#false} is VALID [2022-02-21 04:20:05,012 INFO L290 TraceCheckUtils]: 65: Hoare triple {21719#false} assume true; {21719#false} is VALID [2022-02-21 04:20:05,012 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21719#false} {21718#true} #50#return; {21719#false} is VALID [2022-02-21 04:20:05,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:05,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:05,012 INFO L272 TraceCheckUtils]: 8: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:05,012 INFO L272 TraceCheckUtils]: 12: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {21718#true} ~n := #in~n; {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,013 INFO L272 TraceCheckUtils]: 16: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {21718#true} ~n := #in~n; {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {21859#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {21859#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:05,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {21860#(<= |fibo2_#in~n| 1)} assume true; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:05,015 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21860#(<= |fibo2_#in~n| 1)} {21847#(= fibo1_~n |fibo1_#in~n|)} #50#return; {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} is VALID [2022-02-21 04:20:05,015 INFO L272 TraceCheckUtils]: 22: Hoare triple {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:05,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,016 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21718#true} {21853#(and (<= fibo1_~n 2) (= fibo1_~n |fibo1_#in~n|))} #52#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:05,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {21858#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:05,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {21858#(<= |fibo1_#in~n| 2)} assume true; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:05,017 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21858#(<= |fibo1_#in~n| 2)} {21718#true} #46#return; {21804#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:05,017 INFO L272 TraceCheckUtils]: 30: Hoare triple {21804#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {21718#true} ~n := #in~n; {21847#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {21847#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {21861#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:05,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {21861#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:05,018 INFO L272 TraceCheckUtils]: 34: Hoare triple {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L272 TraceCheckUtils]: 38: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L272 TraceCheckUtils]: 42: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:05,018 INFO L272 TraceCheckUtils]: 48: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L290 TraceCheckUtils]: 49: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L290 TraceCheckUtils]: 53: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L290 TraceCheckUtils]: 54: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21718#true} {21718#true} #46#return; {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L272 TraceCheckUtils]: 56: Hoare triple {21718#true} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L290 TraceCheckUtils]: 59: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L290 TraceCheckUtils]: 60: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {21718#true} {21718#true} #48#return; {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L290 TraceCheckUtils]: 62: Hoare triple {21718#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21718#true} is VALID [2022-02-21 04:20:05,019 INFO L290 TraceCheckUtils]: 63: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,020 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:05,020 INFO L272 TraceCheckUtils]: 65: Hoare triple {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,020 INFO L290 TraceCheckUtils]: 66: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,020 INFO L290 TraceCheckUtils]: 67: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:05,020 INFO L290 TraceCheckUtils]: 68: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,021 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {21718#true} {21862#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,021 INFO L290 TraceCheckUtils]: 70: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,021 INFO L290 TraceCheckUtils]: 71: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} assume true; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,022 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21897#(<= 2 |fibo1_#in~n|)} {21804#(<= fibo2_~n 3)} #48#return; {21719#false} is VALID [2022-02-21 04:20:05,022 INFO L290 TraceCheckUtils]: 73: Hoare triple {21719#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21719#false} is VALID [2022-02-21 04:20:05,022 INFO L290 TraceCheckUtils]: 74: Hoare triple {21719#false} assume true; {21719#false} is VALID [2022-02-21 04:20:05,022 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {21719#false} {21718#true} #50#return; {21719#false} is VALID [2022-02-21 04:20:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 33 proven. 38 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-02-21 04:20:05,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:05,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120016375] [2022-02-21 04:20:05,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120016375] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:05,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882933118] [2022-02-21 04:20:05,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:05,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:05,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:05,024 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:20:05,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-02-21 04:20:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:05,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:20:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:05,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:05,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:05,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:05,318 INFO L272 TraceCheckUtils]: 8: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:05,318 INFO L272 TraceCheckUtils]: 12: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {21718#true} ~n := #in~n; {21971#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:05,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {21971#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {21971#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:05,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {21971#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {21971#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:05,327 INFO L272 TraceCheckUtils]: 16: Hoare triple {21971#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {21718#true} ~n := #in~n; {21984#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:05,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {21984#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {21984#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:05,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {21984#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:05,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {21860#(<= |fibo2_#in~n| 1)} assume true; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:05,329 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21860#(<= |fibo2_#in~n| 1)} {21971#(<= |fibo1_#in~n| fibo1_~n)} #50#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:05,329 INFO L272 TraceCheckUtils]: 22: Hoare triple {21858#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:05,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,329 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21718#true} {21858#(<= |fibo1_#in~n| 2)} #52#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:05,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {21858#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:05,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {21858#(<= |fibo1_#in~n| 2)} assume true; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:05,330 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21858#(<= |fibo1_#in~n| 2)} {21718#true} #46#return; {21804#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:05,331 INFO L272 TraceCheckUtils]: 30: Hoare triple {21804#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {21718#true} ~n := #in~n; {22027#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {22027#(<= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {22027#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {22027#(<= fibo1_~n |fibo1_#in~n|)} assume !(1 == ~n); {22027#(<= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,331 INFO L272 TraceCheckUtils]: 34: Hoare triple {22027#(<= fibo1_~n |fibo1_#in~n|)} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {21718#true} ~n := #in~n; {22040#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {22040#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,332 INFO L290 TraceCheckUtils]: 37: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,332 INFO L272 TraceCheckUtils]: 38: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,332 INFO L290 TraceCheckUtils]: 40: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L272 TraceCheckUtils]: 42: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L272 TraceCheckUtils]: 48: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:05,333 INFO L290 TraceCheckUtils]: 54: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,334 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21718#true} {22044#(<= 1 |fibo2_#in~n|)} #46#return; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,334 INFO L272 TraceCheckUtils]: 56: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,334 INFO L290 TraceCheckUtils]: 57: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,334 INFO L290 TraceCheckUtils]: 58: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:05,334 INFO L290 TraceCheckUtils]: 59: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:05,334 INFO L290 TraceCheckUtils]: 60: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,334 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {21718#true} {22044#(<= 1 |fibo2_#in~n|)} #48#return; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,335 INFO L290 TraceCheckUtils]: 62: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,335 INFO L290 TraceCheckUtils]: 63: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} assume true; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:05,336 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22044#(<= 1 |fibo2_#in~n|)} {22027#(<= fibo1_~n |fibo1_#in~n|)} #50#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,336 INFO L272 TraceCheckUtils]: 65: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:05,336 INFO L290 TraceCheckUtils]: 66: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:05,336 INFO L290 TraceCheckUtils]: 67: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:05,336 INFO L290 TraceCheckUtils]: 68: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:05,336 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {21718#true} {21897#(<= 2 |fibo1_#in~n|)} #52#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,337 INFO L290 TraceCheckUtils]: 70: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,337 INFO L290 TraceCheckUtils]: 71: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} assume true; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:05,337 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21897#(<= 2 |fibo1_#in~n|)} {21804#(<= fibo2_~n 3)} #48#return; {21719#false} is VALID [2022-02-21 04:20:05,337 INFO L290 TraceCheckUtils]: 73: Hoare triple {21719#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21719#false} is VALID [2022-02-21 04:20:05,338 INFO L290 TraceCheckUtils]: 74: Hoare triple {21719#false} assume true; {21719#false} is VALID [2022-02-21 04:20:05,338 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {21719#false} {21718#true} #50#return; {21719#false} is VALID [2022-02-21 04:20:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 44 proven. 47 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-02-21 04:20:05,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:06,456 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {21719#false} {21718#true} #50#return; {21719#false} is VALID [2022-02-21 04:20:06,456 INFO L290 TraceCheckUtils]: 74: Hoare triple {21719#false} assume true; {21719#false} is VALID [2022-02-21 04:20:06,456 INFO L290 TraceCheckUtils]: 73: Hoare triple {21719#false} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {21719#false} is VALID [2022-02-21 04:20:06,457 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21897#(<= 2 |fibo1_#in~n|)} {21804#(<= fibo2_~n 3)} #48#return; {21719#false} is VALID [2022-02-21 04:20:06,457 INFO L290 TraceCheckUtils]: 71: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} assume true; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,458 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {21718#true} {21897#(<= 2 |fibo1_#in~n|)} #52#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,458 INFO L290 TraceCheckUtils]: 68: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,458 INFO L290 TraceCheckUtils]: 67: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,458 INFO L290 TraceCheckUtils]: 66: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,458 INFO L272 TraceCheckUtils]: 65: Hoare triple {21897#(<= 2 |fibo1_#in~n|)} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,480 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22044#(<= 1 |fibo2_#in~n|)} {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} #50#return; {21897#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:06,481 INFO L290 TraceCheckUtils]: 63: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} assume true; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,481 INFO L290 TraceCheckUtils]: 62: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,482 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {21718#true} {22044#(<= 1 |fibo2_#in~n|)} #48#return; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,482 INFO L290 TraceCheckUtils]: 60: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,482 INFO L290 TraceCheckUtils]: 59: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,482 INFO L290 TraceCheckUtils]: 58: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,482 INFO L290 TraceCheckUtils]: 57: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,482 INFO L272 TraceCheckUtils]: 56: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,483 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21718#true} {22044#(<= 1 |fibo2_#in~n|)} #46#return; {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,483 INFO L290 TraceCheckUtils]: 54: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,483 INFO L290 TraceCheckUtils]: 53: Hoare triple {21718#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21718#true} is VALID [2022-02-21 04:20:06,483 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21718#true} {21718#true} #52#return; {21718#true} is VALID [2022-02-21 04:20:06,483 INFO L290 TraceCheckUtils]: 51: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,484 INFO L290 TraceCheckUtils]: 50: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,484 INFO L290 TraceCheckUtils]: 49: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,484 INFO L272 TraceCheckUtils]: 48: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,484 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21718#true} {21718#true} #50#return; {21718#true} is VALID [2022-02-21 04:20:06,484 INFO L290 TraceCheckUtils]: 46: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {21718#true} assume 1 == ~n;#res := 1; {21718#true} is VALID [2022-02-21 04:20:06,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,484 INFO L272 TraceCheckUtils]: 42: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,485 INFO L272 TraceCheckUtils]: 38: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {22044#(<= 1 |fibo2_#in~n|)} assume !(1 == ~n); {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {22289#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} assume !(~n < 1); {22044#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:06,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {21718#true} ~n := #in~n; {22289#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} is VALID [2022-02-21 04:20:06,486 INFO L272 TraceCheckUtils]: 34: Hoare triple {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} assume !(1 == ~n); {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:20:06,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} assume !(~n < 1); {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:20:06,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {21718#true} ~n := #in~n; {22201#(or (<= 2 |fibo1_#in~n|) (< fibo1_~n 2))} is VALID [2022-02-21 04:20:06,487 INFO L272 TraceCheckUtils]: 30: Hoare triple {21804#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,487 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {21858#(<= |fibo1_#in~n| 2)} {21718#true} #46#return; {21804#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:06,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {21858#(<= |fibo1_#in~n| 2)} assume true; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {21858#(<= |fibo1_#in~n| 2)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,488 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21718#true} {21858#(<= |fibo1_#in~n| 2)} #52#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {21718#true} assume true; {21718#true} is VALID [2022-02-21 04:20:06,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {21718#true} assume ~n < 1;#res := 0; {21718#true} is VALID [2022-02-21 04:20:06,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,489 INFO L272 TraceCheckUtils]: 22: Hoare triple {21858#(<= |fibo1_#in~n| 2)} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,489 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21860#(<= |fibo2_#in~n| 1)} {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} #50#return; {21858#(<= |fibo1_#in~n| 2)} is VALID [2022-02-21 04:20:06,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {21860#(<= |fibo2_#in~n| 1)} assume true; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:06,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {22342#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume 1 == ~n;#res := 1; {21860#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:06,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {22342#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume !(~n < 1); {22342#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:20:06,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {21718#true} ~n := #in~n; {22342#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:20:06,490 INFO L272 TraceCheckUtils]: 16: Hoare triple {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(1 == ~n); {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:20:06,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} assume !(~n < 1); {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:20:06,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {21718#true} ~n := #in~n; {22332#(or (< 2 fibo1_~n) (<= |fibo1_#in~n| 2))} is VALID [2022-02-21 04:20:06,491 INFO L272 TraceCheckUtils]: 12: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,492 INFO L272 TraceCheckUtils]: 8: Hoare triple {21718#true} call #t~ret4 := fibo2(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {21718#true} call #t~ret6 := fibo1(~n - 1); {21718#true} is VALID [2022-02-21 04:20:06,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {21718#true} assume !(1 == ~n); {21718#true} is VALID [2022-02-21 04:20:06,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {21718#true} assume !(~n < 1); {21718#true} is VALID [2022-02-21 04:20:06,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {21718#true} ~n := #in~n; {21718#true} is VALID [2022-02-21 04:20:06,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {21718#true} call #t~ret5 := fibo2(~n - 2); {21718#true} is VALID [2022-02-21 04:20:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 44 proven. 47 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-02-21 04:20:06,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882933118] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:06,492 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:06,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-02-21 04:20:06,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290773416] [2022-02-21 04:20:06,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:06,493 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:20:06,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:06,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-21 04:20:06,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2022-02-21 04:20:06,494 INFO L87 Difference]: Start difference. First operand 394 states and 539 transitions. cyclomatic complexity: 152 Second operand has 22 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 10 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 04:20:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:07,426 INFO L93 Difference]: Finished difference Result 445 states and 553 transitions. [2022-02-21 04:20:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 04:20:07,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 10 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 04:20:07,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:07,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 445 states and 553 transitions. [2022-02-21 04:20:07,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2022-02-21 04:20:07,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 445 states to 299 states and 359 transitions. [2022-02-21 04:20:07,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2022-02-21 04:20:07,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2022-02-21 04:20:07,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 299 states and 359 transitions. [2022-02-21 04:20:07,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:07,490 INFO L681 BuchiCegarLoop]: Abstraction has 299 states and 359 transitions. [2022-02-21 04:20:07,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states and 359 transitions. [2022-02-21 04:20:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 277. [2022-02-21 04:20:07,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:07,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states and 359 transitions. Second operand has 277 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 199 states have internal predecessors, (211), 59 states have call successors, (60), 42 states have call predecessors, (60), 37 states have return successors, (61), 35 states have call predecessors, (61), 44 states have call successors, (61) [2022-02-21 04:20:07,495 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states and 359 transitions. Second operand has 277 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 199 states have internal predecessors, (211), 59 states have call successors, (60), 42 states have call predecessors, (60), 37 states have return successors, (61), 35 states have call predecessors, (61), 44 states have call successors, (61) [2022-02-21 04:20:07,496 INFO L87 Difference]: Start difference. First operand 299 states and 359 transitions. Second operand has 277 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 199 states have internal predecessors, (211), 59 states have call successors, (60), 42 states have call predecessors, (60), 37 states have return successors, (61), 35 states have call predecessors, (61), 44 states have call successors, (61) [2022-02-21 04:20:07,496 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:07,514 INFO L93 Difference]: Finished difference Result 620 states and 758 transitions. [2022-02-21 04:20:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 758 transitions. [2022-02-21 04:20:07,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:07,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:07,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 199 states have internal predecessors, (211), 59 states have call successors, (60), 42 states have call predecessors, (60), 37 states have return successors, (61), 35 states have call predecessors, (61), 44 states have call successors, (61) Second operand 299 states and 359 transitions. [2022-02-21 04:20:07,517 INFO L87 Difference]: Start difference. First operand has 277 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 199 states have internal predecessors, (211), 59 states have call successors, (60), 42 states have call predecessors, (60), 37 states have return successors, (61), 35 states have call predecessors, (61), 44 states have call successors, (61) Second operand 299 states and 359 transitions. [2022-02-21 04:20:07,518 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:07,542 INFO L93 Difference]: Finished difference Result 630 states and 774 transitions. [2022-02-21 04:20:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 774 transitions. [2022-02-21 04:20:07,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:07,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:07,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:07,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 199 states have internal predecessors, (211), 59 states have call successors, (60), 42 states have call predecessors, (60), 37 states have return successors, (61), 35 states have call predecessors, (61), 44 states have call successors, (61) [2022-02-21 04:20:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 332 transitions. [2022-02-21 04:20:07,553 INFO L704 BuchiCegarLoop]: Abstraction has 277 states and 332 transitions. [2022-02-21 04:20:07,553 INFO L587 BuchiCegarLoop]: Abstraction has 277 states and 332 transitions. [2022-02-21 04:20:07,553 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:20:07,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 277 states and 332 transitions. [2022-02-21 04:20:07,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2022-02-21 04:20:07,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:07,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:07,556 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:07,556 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:07,556 INFO L791 eck$LassoCheckResult]: Stem: 22868#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 22869#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; 22900#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 22951#fibo1ENTRY ~n := #in~n; 23006#L10 assume !(~n < 1); 23005#L12 assume !(1 == ~n); 23001#L15 call #t~ret4 := fibo2(~n - 1);< 23004#fibo2ENTRY ~n := #in~n; 23003#L20 assume !(~n < 1); 23002#L22 assume !(1 == ~n); 22997#L25 call #t~ret6 := fibo1(~n - 1);< 23000#fibo1ENTRY ~n := #in~n; 22999#L10 assume !(~n < 1); 22998#L12 assume !(1 == ~n); 22989#L15 call #t~ret4 := fibo2(~n - 1);< 22996#fibo2ENTRY ~n := #in~n; 22995#L20 assume !(~n < 1); 22988#L22 assume !(1 == ~n); 22902#L25 call #t~ret6 := fibo1(~n - 1);< 22972#fibo1ENTRY ~n := #in~n; 22973#L10 assume !(~n < 1); 23082#L12 assume !(1 == ~n); 22943#L15 call #t~ret4 := fibo2(~n - 1);< 22942#fibo2ENTRY ~n := #in~n; 22944#L20 assume !(~n < 1); 23136#L22 assume 1 == ~n;#res := 1; 23134#fibo2FINAL assume true; 23124#fibo2EXIT >#50#return; 22901#L15-1 call #t~ret5 := fibo2(~n - 2);< 22905#fibo2ENTRY ~n := #in~n; 23073#L20 assume ~n < 1;#res := 0; 23072#fibo2FINAL assume true; 23071#fibo2EXIT >#52#return; 23070#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 23069#fibo1FINAL assume true; 23068#fibo1EXIT >#46#return; 23009#L25-1 call #t~ret7 := fibo1(~n - 2);< 23066#fibo1ENTRY ~n := #in~n; 23011#L10 assume !(~n < 1); 23007#L12 assume !(1 == ~n); 22910#L15 call #t~ret4 := fibo2(~n - 1);< 22983#fibo2ENTRY ~n := #in~n; 22984#L20 assume !(~n < 1); 22976#L22 assume 1 == ~n;#res := 1; 22977#fibo2FINAL assume true; 23105#fibo2EXIT >#50#return; 22920#L15-1 [2022-02-21 04:20:07,556 INFO L793 eck$LassoCheckResult]: Loop: 22920#L15-1 call #t~ret5 := fibo2(~n - 2);< 23037#fibo2ENTRY ~n := #in~n; 23064#L20 assume !(~n < 1); 23022#L22 assume !(1 == ~n); 22898#L25 call #t~ret6 := fibo1(~n - 1);< 23087#fibo1ENTRY ~n := #in~n; 23078#L10 assume !(~n < 1); 23079#L12 assume !(1 == ~n); 22923#L15 call #t~ret4 := fibo2(~n - 1);< 23043#fibo2ENTRY ~n := #in~n; 23062#L20 assume !(~n < 1); 23058#L22 assume 1 == ~n;#res := 1; 23050#fibo2FINAL assume true; 23041#fibo2EXIT >#50#return; 22920#L15-1 [2022-02-21 04:20:07,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash 881386511, now seen corresponding path program 1 times [2022-02-21 04:20:07,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:07,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342300070] [2022-02-21 04:20:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:07,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:07,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-21 04:20:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:07,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:07,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:07,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:07,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,695 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25454#true} {25454#true} #50#return; {25454#true} is VALID [2022-02-21 04:20:07,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:07,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#true} assume ~n < 1;#res := 0; {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25454#true} {25454#true} #52#return; {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {25454#true} assume !(1 == ~n); {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L272 TraceCheckUtils]: 3: Hoare triple {25454#true} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L290 TraceCheckUtils]: 4: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {25454#true} {25454#true} #50#return; {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L272 TraceCheckUtils]: 9: Hoare triple {25454#true} call #t~ret5 := fibo2(~n - 2); {25454#true} is VALID [2022-02-21 04:20:07,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {25454#true} assume ~n < 1;#res := 0; {25454#true} is VALID [2022-02-21 04:20:07,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,699 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {25454#true} {25454#true} #52#return; {25454#true} is VALID [2022-02-21 04:20:07,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {25454#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25454#true} is VALID [2022-02-21 04:20:07,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,699 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25454#true} {25464#(<= fibo2_~n 3)} #46#return; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-21 04:20:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:07,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:07,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:07,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,702 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25454#true} {25455#false} #50#return; {25455#false} is VALID [2022-02-21 04:20:07,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25454#true} is VALID [2022-02-21 04:20:07,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {25456#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:07,703 INFO L272 TraceCheckUtils]: 2: Hoare triple {25456#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {25457#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:07,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {25457#(<= |fibo1_#in~n| 6)} ~n := #in~n; {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:07,704 INFO L290 TraceCheckUtils]: 4: Hoare triple {25458#(<= fibo1_~n 6)} assume !(~n < 1); {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:07,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {25458#(<= fibo1_~n 6)} assume !(1 == ~n); {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:07,705 INFO L272 TraceCheckUtils]: 6: Hoare triple {25458#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {25459#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:07,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {25459#(<= |fibo2_#in~n| 5)} ~n := #in~n; {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:07,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {25460#(<= fibo2_~n 5)} assume !(~n < 1); {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:07,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {25460#(<= fibo2_~n 5)} assume !(1 == ~n); {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:07,706 INFO L272 TraceCheckUtils]: 10: Hoare triple {25460#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {25461#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:07,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {25461#(<= |fibo1_#in~n| 4)} ~n := #in~n; {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:07,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {25462#(<= fibo1_~n 4)} assume !(~n < 1); {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:07,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {25462#(<= fibo1_~n 4)} assume !(1 == ~n); {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:07,707 INFO L272 TraceCheckUtils]: 14: Hoare triple {25462#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {25463#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:07,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {25463#(<= |fibo2_#in~n| 3)} ~n := #in~n; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {25464#(<= fibo2_~n 3)} assume !(~n < 1); {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {25464#(<= fibo2_~n 3)} assume !(1 == ~n); {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,708 INFO L272 TraceCheckUtils]: 18: Hoare triple {25464#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {25454#true} is VALID [2022-02-21 04:20:07,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:07,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {25454#true} assume !(1 == ~n); {25454#true} is VALID [2022-02-21 04:20:07,708 INFO L272 TraceCheckUtils]: 22: Hoare triple {25454#true} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:07,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:07,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:07,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,709 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25454#true} {25454#true} #50#return; {25454#true} is VALID [2022-02-21 04:20:07,709 INFO L272 TraceCheckUtils]: 28: Hoare triple {25454#true} call #t~ret5 := fibo2(~n - 2); {25454#true} is VALID [2022-02-21 04:20:07,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {25454#true} assume ~n < 1;#res := 0; {25454#true} is VALID [2022-02-21 04:20:07,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,709 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25454#true} {25454#true} #52#return; {25454#true} is VALID [2022-02-21 04:20:07,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {25454#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25454#true} is VALID [2022-02-21 04:20:07,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,709 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {25454#true} {25464#(<= fibo2_~n 3)} #46#return; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,710 INFO L272 TraceCheckUtils]: 36: Hoare triple {25464#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {25482#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:07,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {25482#(<= |fibo1_#in~n| 1)} ~n := #in~n; {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:07,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {25483#(<= fibo1_~n 1)} assume !(~n < 1); {25484#(and (<= fibo1_~n 1) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:07,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {25484#(and (<= fibo1_~n 1) (< 0 fibo1_~n))} assume !(1 == ~n); {25455#false} is VALID [2022-02-21 04:20:07,711 INFO L272 TraceCheckUtils]: 40: Hoare triple {25455#false} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:07,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:07,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:07,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,711 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25454#true} {25455#false} #50#return; {25455#false} is VALID [2022-02-21 04:20:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 04:20:07,712 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:07,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342300070] [2022-02-21 04:20:07,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342300070] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:07,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112641545] [2022-02-21 04:20:07,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:07,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:07,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:07,715 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:20:07,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-02-21 04:20:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:07,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:07,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:07,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25454#true} is VALID [2022-02-21 04:20:07,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {25456#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:07,962 INFO L272 TraceCheckUtils]: 2: Hoare triple {25456#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {25457#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:07,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {25457#(<= |fibo1_#in~n| 6)} ~n := #in~n; {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:07,963 INFO L290 TraceCheckUtils]: 4: Hoare triple {25458#(<= fibo1_~n 6)} assume !(~n < 1); {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:07,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {25458#(<= fibo1_~n 6)} assume !(1 == ~n); {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:07,963 INFO L272 TraceCheckUtils]: 6: Hoare triple {25458#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {25459#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:07,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {25459#(<= |fibo2_#in~n| 5)} ~n := #in~n; {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:07,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {25460#(<= fibo2_~n 5)} assume !(~n < 1); {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:07,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {25460#(<= fibo2_~n 5)} assume !(1 == ~n); {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:07,965 INFO L272 TraceCheckUtils]: 10: Hoare triple {25460#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {25461#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:07,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {25461#(<= |fibo1_#in~n| 4)} ~n := #in~n; {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:07,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {25462#(<= fibo1_~n 4)} assume !(~n < 1); {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:07,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {25462#(<= fibo1_~n 4)} assume !(1 == ~n); {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:07,966 INFO L272 TraceCheckUtils]: 14: Hoare triple {25462#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {25463#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:07,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {25463#(<= |fibo2_#in~n| 3)} ~n := #in~n; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {25464#(<= fibo2_~n 3)} assume !(~n < 1); {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {25464#(<= fibo2_~n 3)} assume !(1 == ~n); {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,967 INFO L272 TraceCheckUtils]: 18: Hoare triple {25464#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {25454#true} assume !(1 == ~n); {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L272 TraceCheckUtils]: 22: Hoare triple {25454#true} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25454#true} {25454#true} #50#return; {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L272 TraceCheckUtils]: 28: Hoare triple {25454#true} call #t~ret5 := fibo2(~n - 2); {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {25454#true} assume ~n < 1;#res := 0; {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25454#true} {25454#true} #52#return; {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {25454#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25454#true} is VALID [2022-02-21 04:20:07,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:07,968 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {25454#true} {25464#(<= fibo2_~n 3)} #46#return; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:07,968 INFO L272 TraceCheckUtils]: 36: Hoare triple {25464#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {25482#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:07,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {25482#(<= |fibo1_#in~n| 1)} ~n := #in~n; {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:07,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {25483#(<= fibo1_~n 1)} assume !(~n < 1); {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:07,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {25483#(<= fibo1_~n 1)} assume !(1 == ~n); {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:07,969 INFO L272 TraceCheckUtils]: 40: Hoare triple {25483#(<= fibo1_~n 1)} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:07,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {25454#true} ~n := #in~n; {25625#(<= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {25625#(<= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {25629#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {25629#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {25629#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {25629#(<= 1 |fibo2_#in~n|)} assume true; {25629#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:07,971 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25629#(<= 1 |fibo2_#in~n|)} {25483#(<= fibo1_~n 1)} #50#return; {25455#false} is VALID [2022-02-21 04:20:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 04:20:07,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:08,239 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25629#(<= 1 |fibo2_#in~n|)} {25483#(<= fibo1_~n 1)} #50#return; {25455#false} is VALID [2022-02-21 04:20:08,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {25629#(<= 1 |fibo2_#in~n|)} assume true; {25629#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:08,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {25629#(<= 1 |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {25629#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:08,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {25651#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} assume !(~n < 1); {25629#(<= 1 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:08,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {25454#true} ~n := #in~n; {25651#(or (<= 1 |fibo2_#in~n|) (< fibo2_~n 1))} is VALID [2022-02-21 04:20:08,240 INFO L272 TraceCheckUtils]: 40: Hoare triple {25483#(<= fibo1_~n 1)} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:08,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {25483#(<= fibo1_~n 1)} assume !(1 == ~n); {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:08,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {25483#(<= fibo1_~n 1)} assume !(~n < 1); {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:08,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {25482#(<= |fibo1_#in~n| 1)} ~n := #in~n; {25483#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:08,242 INFO L272 TraceCheckUtils]: 36: Hoare triple {25464#(<= fibo2_~n 3)} call #t~ret7 := fibo1(~n - 2); {25482#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:08,242 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {25454#true} {25464#(<= fibo2_~n 3)} #46#return; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:08,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:08,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {25454#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25454#true} is VALID [2022-02-21 04:20:08,242 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25454#true} {25454#true} #52#return; {25454#true} is VALID [2022-02-21 04:20:08,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:08,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {25454#true} assume ~n < 1;#res := 0; {25454#true} is VALID [2022-02-21 04:20:08,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:08,243 INFO L272 TraceCheckUtils]: 28: Hoare triple {25454#true} call #t~ret5 := fibo2(~n - 2); {25454#true} is VALID [2022-02-21 04:20:08,243 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25454#true} {25454#true} #50#return; {25454#true} is VALID [2022-02-21 04:20:08,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {25454#true} assume true; {25454#true} is VALID [2022-02-21 04:20:08,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {25454#true} assume 1 == ~n;#res := 1; {25454#true} is VALID [2022-02-21 04:20:08,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:08,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:08,243 INFO L272 TraceCheckUtils]: 22: Hoare triple {25454#true} call #t~ret4 := fibo2(~n - 1); {25454#true} is VALID [2022-02-21 04:20:08,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {25454#true} assume !(1 == ~n); {25454#true} is VALID [2022-02-21 04:20:08,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {25454#true} assume !(~n < 1); {25454#true} is VALID [2022-02-21 04:20:08,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {25454#true} ~n := #in~n; {25454#true} is VALID [2022-02-21 04:20:08,244 INFO L272 TraceCheckUtils]: 18: Hoare triple {25464#(<= fibo2_~n 3)} call #t~ret6 := fibo1(~n - 1); {25454#true} is VALID [2022-02-21 04:20:08,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {25464#(<= fibo2_~n 3)} assume !(1 == ~n); {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:08,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {25464#(<= fibo2_~n 3)} assume !(~n < 1); {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:08,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {25463#(<= |fibo2_#in~n| 3)} ~n := #in~n; {25464#(<= fibo2_~n 3)} is VALID [2022-02-21 04:20:08,246 INFO L272 TraceCheckUtils]: 14: Hoare triple {25462#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {25463#(<= |fibo2_#in~n| 3)} is VALID [2022-02-21 04:20:08,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {25462#(<= fibo1_~n 4)} assume !(1 == ~n); {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:08,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {25462#(<= fibo1_~n 4)} assume !(~n < 1); {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:08,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {25461#(<= |fibo1_#in~n| 4)} ~n := #in~n; {25462#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:08,247 INFO L272 TraceCheckUtils]: 10: Hoare triple {25460#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {25461#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:08,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {25460#(<= fibo2_~n 5)} assume !(1 == ~n); {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:08,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {25460#(<= fibo2_~n 5)} assume !(~n < 1); {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:08,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {25459#(<= |fibo2_#in~n| 5)} ~n := #in~n; {25460#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:08,249 INFO L272 TraceCheckUtils]: 6: Hoare triple {25458#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {25459#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:08,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {25458#(<= fibo1_~n 6)} assume !(1 == ~n); {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:08,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {25458#(<= fibo1_~n 6)} assume !(~n < 1); {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:08,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {25457#(<= |fibo1_#in~n| 6)} ~n := #in~n; {25458#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:08,250 INFO L272 TraceCheckUtils]: 2: Hoare triple {25456#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {25457#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:08,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {25454#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {25456#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:08,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {25454#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25454#true} is VALID [2022-02-21 04:20:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-21 04:20:08,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112641545] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:08,251 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:08,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 17 [2022-02-21 04:20:08,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706724977] [2022-02-21 04:20:08,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:08,251 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:08,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1489002864, now seen corresponding path program 1 times [2022-02-21 04:20:08,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:08,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362538547] [2022-02-21 04:20:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:08,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:08,260 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:08,262 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:08,475 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:08,475 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:08,475 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:08,475 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:08,475 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:20:08,475 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,476 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:08,476 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:08,476 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-1.c_Iteration7_Loop [2022-02-21 04:20:08,476 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:08,476 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:08,476 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 04:20:08,485 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 04:20:08,487 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 04:20:08,488 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 04:20:08,494 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 04:20:08,495 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 04:20:08,501 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 04:20:08,505 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 04:20:08,511 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 04:20:08,576 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:08,576 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:20:08,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:08,577 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 04:20:08,578 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 04:20:08,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:08,579 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:08,585 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:08,585 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_~n=0} Honda state: {fibo2_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:08,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:08,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:08,600 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 04:20:08,601 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 04:20:08,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:08,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:08,608 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:08,608 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret6=0} Honda state: {fibo2_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:08,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-02-21 04:20:08,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:08,624 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 04:20:08,624 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 04:20:08,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:08,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:08,646 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:08,647 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:08,661 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 04:20:08,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:08,663 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 04:20:08,663 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 04:20:08,665 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:08,665 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:08,672 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:08,672 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#t~ret7=0} Honda state: {fibo2_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:08,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-02-21 04:20:08,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:08,688 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 04:20:08,689 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 04:20:08,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:08,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:08,697 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:08,697 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#t~ret5=0} Honda state: {fibo1_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:08,712 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 04:20:08,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:08,713 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 04:20:08,714 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 04:20:08,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:08,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:08,721 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:08,721 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:08,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:08,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:08,738 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 04:20:08,739 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 04:20:08,740 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:08,740 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:08,762 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 04:20:08,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:08,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:08,763 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 04:20:08,763 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 04:20:08,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:20:08,765 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:09,512 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:20:09,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:09,516 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:09,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:09,516 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:09,516 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:09,516 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:20:09,516 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,516 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:09,516 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:09,516 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-1.c_Iteration7_Loop [2022-02-21 04:20:09,516 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:09,516 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:09,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 04:20:09,521 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 04:20:09,532 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 04:20:09,534 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 04:20:09,538 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 04:20:09,540 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 04:20:09,541 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 04:20:09,543 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 04:20:09,544 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 04:20:09,603 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:09,603 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:20:09,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,605 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 04:20:09,605 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 04:20:09,607 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 04:20:09,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:09,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:09,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:09,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:09,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:09,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:09,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:09,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:09,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-02-21 04:20:09,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,628 INFO L229 MonitoredProcess]: Starting monitored process 65 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 04:20:09,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-02-21 04:20:09,630 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 04:20:09,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:09,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:09,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:09,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:09,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:09,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:09,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:09,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:09,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:09,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,663 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 04:20:09,664 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 04:20:09,665 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 04:20:09,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:09,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:09,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:09,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:09,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:09,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:09,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:09,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:09,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:09,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,704 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 04:20:09,705 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 04:20:09,707 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 04:20:09,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:09,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:09,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:09,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:09,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:09,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:09,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:09,727 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:20:09,736 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:20:09,736 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 04:20:09,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:09,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:09,738 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 04:20:09,747 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 04:20:09,747 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:20:09,747 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:20:09,748 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:20:09,748 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2022-02-21 04:20:09,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:09,767 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:20:09,771 INFO L390 LassoCheck]: Loop: "call #t~ret5 := fibo2(~n - 2);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume 1 == ~n;#res := 1;" "assume true;" >"#50#return;" [2022-02-21 04:20:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:09,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:20:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:09,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:10,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {25774#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25774#unseeded} is VALID [2022-02-21 04:20:10,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {25774#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {25774#unseeded} is VALID [2022-02-21 04:20:10,127 INFO L272 TraceCheckUtils]: 2: Hoare triple {25774#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {25774#unseeded} is VALID [2022-02-21 04:20:10,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:10,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:10,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:10,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:10,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:10,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:10,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:10,129 INFO L272 TraceCheckUtils]: 10: Hoare triple {25774#unseeded} call #t~ret6 := fibo1(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:10,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:10,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:10,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:10,130 INFO L272 TraceCheckUtils]: 14: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:10,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:10,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:10,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:10,131 INFO L272 TraceCheckUtils]: 18: Hoare triple {25774#unseeded} call #t~ret6 := fibo1(~n - 1); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,133 INFO L272 TraceCheckUtils]: 22: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,135 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,135 INFO L272 TraceCheckUtils]: 28: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,137 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,138 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25774#unseeded} #46#return; {25774#unseeded} is VALID [2022-02-21 04:20:10,139 INFO L272 TraceCheckUtils]: 36: Hoare triple {25774#unseeded} call #t~ret7 := fibo1(~n - 2); {25774#unseeded} is VALID [2022-02-21 04:20:10,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:10,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:10,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:10,140 INFO L272 TraceCheckUtils]: 40: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:10,142 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25846#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25774#unseeded} #50#return; {25774#unseeded} is VALID [2022-02-21 04:20:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:10,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:20:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:10,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:10,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {25777#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {25928#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:10,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {25928#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {25932#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:10,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {25932#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {25932#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:10,351 INFO L290 TraceCheckUtils]: 3: Hoare triple {25932#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {25932#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:10,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {25932#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {25942#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:10,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {25942#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {25946#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:10,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {25946#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {25946#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:10,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {25946#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {25946#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:10,353 INFO L272 TraceCheckUtils]: 8: Hoare triple {25946#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {25956#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:10,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {25956#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {25960#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:10,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {25960#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {25964#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:10,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {25964#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {25964#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:10,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {25964#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {25964#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:10,355 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {25964#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {25946#(<= (+ fibo1_~n 3) oldRank0)} #50#return; {25787#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:20:10,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:10,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:10,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:10,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,387 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2022-02-21 04:20:10,387 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 277 states and 332 transitions. cyclomatic complexity: 61 Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:10,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 277 states and 332 transitions. cyclomatic complexity: 61. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 1005 states and 1188 transitions. Complement of second has 40 states. [2022-02-21 04:20:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:10,932 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:10,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 277 states and 332 transitions. cyclomatic complexity: 61 [2022-02-21 04:20:10,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:10,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:10,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:10,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:10,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:10,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:10,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1005 states and 1188 transitions. [2022-02-21 04:20:10,939 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 137 [2022-02-21 04:20:10,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:10,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:10,940 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 277 states and 332 transitions. cyclomatic complexity: 61 [2022-02-21 04:20:10,953 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 50 examples of accepted words. [2022-02-21 04:20:10,953 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:10,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:10,954 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:10,954 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 [2022-02-21 04:20:10,974 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 114 examples of accepted words. [2022-02-21 04:20:10,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:10,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:10,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:10,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:10,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:10,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:10,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:10,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:10,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:10,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 1005 letters. Loop has 1005 letters. [2022-02-21 04:20:10,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 1005 letters. Loop has 1005 letters. [2022-02-21 04:20:10,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 1005 letters. Loop has 1005 letters. [2022-02-21 04:20:10,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:10,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:10,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:10,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:10,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:10,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:10,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:10,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:10,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:10,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:10,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:10,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:10,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:10,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:10,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:10,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:10,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:10,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:10,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:10,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:10,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:10,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:10,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:10,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:10,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:10,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:10,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:10,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:10,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:10,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:10,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:10,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:10,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:10,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:10,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:10,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:10,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:10,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:10,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:10,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:10,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:10,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:10,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:10,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:10,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:10,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:10,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:10,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:10,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:10,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:10,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:10,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:10,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:10,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:10,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:10,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:10,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:10,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:10,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:10,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:10,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:10,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:10,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:10,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:10,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:10,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:10,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:10,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:10,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:10,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:10,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:10,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:10,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:10,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:10,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:10,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:10,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:10,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:10,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:10,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:10,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:10,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:10,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:10,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:10,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:10,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:10,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:10,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:10,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:10,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:10,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:10,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:10,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:10,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:10,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:10,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:10,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:10,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:10,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:10,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:10,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:10,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:10,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:10,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:10,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:10,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:11,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:11,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:11,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:11,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:11,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:11,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:11,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:11,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:11,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:11,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:11,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:11,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:11,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:11,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:11,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:11,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:11,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:11,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:11,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:11,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:11,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:11,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:11,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:11,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:11,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:11,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:11,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:20:11,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:20:11,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:20:11,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:11,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:11,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:11,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:11,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:11,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:11,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:11,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:11,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:11,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:11,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:11,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:11,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:11,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:11,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:11,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 81 letters. Loop has 14 letters. [2022-02-21 04:20:11,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 14 letters. [2022-02-21 04:20:11,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 81 letters. Loop has 14 letters. [2022-02-21 04:20:11,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:11,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:11,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:11,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:11,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:11,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:11,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 82 letters. Loop has 14 letters. [2022-02-21 04:20:11,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 14 letters. [2022-02-21 04:20:11,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 82 letters. Loop has 14 letters. [2022-02-21 04:20:11,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 83 letters. Loop has 14 letters. [2022-02-21 04:20:11,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 14 letters. [2022-02-21 04:20:11,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 83 letters. Loop has 14 letters. [2022-02-21 04:20:11,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:11,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:11,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:11,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:11,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:11,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:11,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:11,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:11,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:11,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:11,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:11,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:11,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 14 letters. [2022-02-21 04:20:11,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 14 letters. [2022-02-21 04:20:11,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 65 letters. Loop has 14 letters. [2022-02-21 04:20:11,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 46 letters. [2022-02-21 04:20:11,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 46 letters. [2022-02-21 04:20:11,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 64 letters. Loop has 46 letters. [2022-02-21 04:20:11,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:11,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:11,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:11,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:11,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:11,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:11,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:11,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:11,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:11,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:20:11,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:20:11,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:20:11,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:11,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:11,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:11,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:11,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:11,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:11,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:11,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:11,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:11,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:11,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:11,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:11,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:11,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:11,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:11,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:11,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:11,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:11,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:11,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:11,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:11,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:11,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:11,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:11,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:11,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:11,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:11,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:11,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:11,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:11,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:11,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:11,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:11,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:11,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:11,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:11,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:11,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:11,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:11,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:11,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:11,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:11,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:11,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:11,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:11,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:11,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:11,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:11,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:11,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:11,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:11,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:11,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:11,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:11,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:11,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:11,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:11,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:11,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:11,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:11,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:11,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:11,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:11,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:11,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:11,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:11,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:11,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:11,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:11,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:11,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:11,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:11,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:11,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:11,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:11,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:11,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:11,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:11,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:11,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:11,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:11,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:11,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:11,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:11,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 44 letters. Loop has 14 letters. [2022-02-21 04:20:11,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 44 letters. Loop has 14 letters. [2022-02-21 04:20:11,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 44 letters. Loop has 14 letters. [2022-02-21 04:20:11,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:11,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:11,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:11,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:11,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:11,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:11,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:11,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:11,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:11,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:11,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:11,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:11,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:11,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:11,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:11,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:11,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:11,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:11,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:11,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:11,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:11,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:11,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:11,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:11,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:11,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:11,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:11,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:11,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:11,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:11,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:11,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:11,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:11,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:11,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:11,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:11,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:11,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:11,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:11,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:11,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:11,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:11,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:11,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:11,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:11,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:11,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:11,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:11,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:11,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:11,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:11,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:11,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:11,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:11,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:11,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:11,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:11,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:11,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:11,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:11,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:11,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:11,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:11,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:11,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:11,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:11,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:11,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:11,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:11,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:11,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:11,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:11,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:11,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:11,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:11,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:11,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:11,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:11,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:11,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:11,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:11,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:11,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:11,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:11,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:11,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:11,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:11,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:11,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:11,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:11,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:11,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:11,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:11,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:11,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:11,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:11,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:11,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:11,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:11,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:11,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:11,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:11,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:11,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:11,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:11,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:11,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:11,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:11,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 95 letters. Loop has 14 letters. [2022-02-21 04:20:11,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 95 letters. Loop has 14 letters. [2022-02-21 04:20:11,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 95 letters. Loop has 14 letters. [2022-02-21 04:20:11,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 96 letters. Loop has 14 letters. [2022-02-21 04:20:11,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 96 letters. Loop has 14 letters. [2022-02-21 04:20:11,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 96 letters. Loop has 14 letters. [2022-02-21 04:20:11,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:11,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:11,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:11,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:11,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:11,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:11,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 79 letters. Loop has 26 letters. [2022-02-21 04:20:11,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 79 letters. Loop has 26 letters. [2022-02-21 04:20:11,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 79 letters. Loop has 26 letters. [2022-02-21 04:20:11,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:11,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:11,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:11,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:11,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:11,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:11,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:20:11,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:20:11,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:20:11,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 46 letters. [2022-02-21 04:20:11,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 46 letters. [2022-02-21 04:20:11,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 56 letters. Loop has 46 letters. [2022-02-21 04:20:11,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:11,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:11,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:11,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:11,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:11,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:11,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:20:11,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:20:11,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1005 states and 1188 transitions. cyclomatic complexity: 203 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:20:11,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,093 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-02-21 04:20:11,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 61 transitions. Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,094 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:11,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:20:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:11,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {25774#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25774#unseeded} is VALID [2022-02-21 04:20:11,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {25774#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {25774#unseeded} is VALID [2022-02-21 04:20:11,363 INFO L272 TraceCheckUtils]: 2: Hoare triple {25774#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {25774#unseeded} is VALID [2022-02-21 04:20:11,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:11,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:11,365 INFO L272 TraceCheckUtils]: 6: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:11,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:11,366 INFO L272 TraceCheckUtils]: 10: Hoare triple {25774#unseeded} call #t~ret6 := fibo1(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:11,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:11,367 INFO L272 TraceCheckUtils]: 14: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:11,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:11,368 INFO L272 TraceCheckUtils]: 18: Hoare triple {25774#unseeded} call #t~ret6 := fibo1(~n - 1); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,369 INFO L272 TraceCheckUtils]: 22: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,371 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,372 INFO L272 TraceCheckUtils]: 28: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,374 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,375 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25774#unseeded} #46#return; {25774#unseeded} is VALID [2022-02-21 04:20:11,375 INFO L272 TraceCheckUtils]: 36: Hoare triple {25774#unseeded} call #t~ret7 := fibo1(~n - 2); {25774#unseeded} is VALID [2022-02-21 04:20:11,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:11,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:11,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:11,376 INFO L272 TraceCheckUtils]: 40: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:11,378 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {27095#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25774#unseeded} #50#return; {25774#unseeded} is VALID [2022-02-21 04:20:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:20:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:11,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:11,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {25777#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {27177#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:11,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {27177#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {27181#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:11,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {27181#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {27181#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:11,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {27181#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {27181#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:11,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {27181#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {27191#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:11,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {27191#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {27195#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:11,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {27195#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {27195#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:11,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {27195#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {27195#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:11,574 INFO L272 TraceCheckUtils]: 8: Hoare triple {27195#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {27205#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:11,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {27205#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {27209#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:11,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {27209#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {27213#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:11,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {27213#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {27213#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:11,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {27213#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {27213#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:11,576 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {27213#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {27195#(<= (+ fibo1_~n 3) oldRank0)} #50#return; {25787#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:20:11,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:11,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:11,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,607 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2022-02-21 04:20:11,607 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 277 states and 332 transitions. cyclomatic complexity: 61 Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:11,966 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 277 states and 332 transitions. cyclomatic complexity: 61. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 621 states and 723 transitions. Complement of second has 26 states. [2022-02-21 04:20:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:11,966 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:11,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 277 states and 332 transitions. cyclomatic complexity: 61 [2022-02-21 04:20:11,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:11,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:11,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:11,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:11,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:11,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:11,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 621 states and 723 transitions. [2022-02-21 04:20:11,970 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 75 [2022-02-21 04:20:11,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:11,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:11,971 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 277 states and 332 transitions. cyclomatic complexity: 61 [2022-02-21 04:20:11,971 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 50 examples of accepted words. [2022-02-21 04:20:11,971 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:11,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:11,972 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:11,972 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 621 states and 723 transitions. cyclomatic complexity: 116 [2022-02-21 04:20:11,977 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 64 examples of accepted words. [2022-02-21 04:20:11,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:11,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:11,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:11,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 621 letters. Loop has 621 letters. [2022-02-21 04:20:11,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 621 letters. Loop has 621 letters. [2022-02-21 04:20:11,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 621 letters. Loop has 621 letters. [2022-02-21 04:20:11,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:11,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:11,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:11,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:11,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:11,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:11,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:11,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:11,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:11,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:11,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:11,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:11,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:11,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:11,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:11,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:11,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:11,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:11,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:11,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:11,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:11,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:11,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:11,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:11,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:11,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:11,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:11,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:11,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:11,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:11,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:11,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:11,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:11,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:11,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:11,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:11,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:11,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:11,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:11,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:11,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:11,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:11,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:11,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:11,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:11,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:11,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:11,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:11,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:11,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:11,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:11,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:11,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:11,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:11,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:11,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:11,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:11,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:11,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:11,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:11,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:11,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:11,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:11,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:11,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:11,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:11,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:11,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:11,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:11,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:11,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:11,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:11,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:11,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:11,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:11,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:11,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:11,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:11,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:11,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:11,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:11,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:11,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:11,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:11,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:11,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:11,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:11,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:11,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:11,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:11,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:11,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:11,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:11,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:11,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:12,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:12,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:12,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:12,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:12,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:12,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:12,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:12,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:12,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:12,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:12,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:12,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:12,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:12,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:12,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 3 letters. Loop has 9 letters. [2022-02-21 04:20:12,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:12,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:12,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:12,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:12,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:12,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:12,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:12,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:12,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:12,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:12,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:12,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:12,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:12,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:12,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:12,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:12,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:12,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:12,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:12,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:12,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:12,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:12,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:12,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:12,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:12,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:12,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:12,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:12,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:12,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:12,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:12,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:12,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:12,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:12,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:12,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 56 letters. Loop has 14 letters. [2022-02-21 04:20:12,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 44 letters. Loop has 14 letters. [2022-02-21 04:20:12,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 44 letters. Loop has 14 letters. [2022-02-21 04:20:12,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 44 letters. Loop has 14 letters. [2022-02-21 04:20:12,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:12,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:12,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 57 letters. Loop has 14 letters. [2022-02-21 04:20:12,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:12,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:12,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 45 letters. Loop has 8 letters. [2022-02-21 04:20:12,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:12,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:12,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 8 letters. [2022-02-21 04:20:12,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:12,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:12,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 47 letters. Loop has 8 letters. [2022-02-21 04:20:12,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:12,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:12,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 48 letters. Loop has 8 letters. [2022-02-21 04:20:12,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:12,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:12,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:12,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:12,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:12,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 54 letters. Loop has 14 letters. [2022-02-21 04:20:12,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:12,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:12,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:12,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:12,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:12,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:12,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:12,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:12,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:12,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:12,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:12,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:12,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:12,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:12,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:12,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:12,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:12,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:12,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:12,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:12,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:12,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:12,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:12,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:12,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:12,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:12,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:12,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:12,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:12,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 20 letters. [2022-02-21 04:20:12,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 46 letters. [2022-02-21 04:20:12,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 46 letters. [2022-02-21 04:20:12,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 60 letters. Loop has 46 letters. [2022-02-21 04:20:12,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:12,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:12,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:12,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:12,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:12,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:12,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:12,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 723 transitions. cyclomatic complexity: 116 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:12,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,047 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-02-21 04:20:12,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 42 transitions. Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,053 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 04:20:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:12,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {25774#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {25774#unseeded} is VALID [2022-02-21 04:20:12,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {25774#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {25774#unseeded} is VALID [2022-02-21 04:20:12,377 INFO L272 TraceCheckUtils]: 2: Hoare triple {25774#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {25774#unseeded} is VALID [2022-02-21 04:20:12,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:12,377 INFO L290 TraceCheckUtils]: 4: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:12,378 INFO L272 TraceCheckUtils]: 6: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:12,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:12,379 INFO L272 TraceCheckUtils]: 10: Hoare triple {25774#unseeded} call #t~ret6 := fibo1(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:12,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:12,380 INFO L272 TraceCheckUtils]: 14: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:12,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:12,381 INFO L272 TraceCheckUtils]: 18: Hoare triple {25774#unseeded} call #t~ret6 := fibo1(~n - 1); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,382 INFO L272 TraceCheckUtils]: 22: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,384 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,385 INFO L272 TraceCheckUtils]: 28: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,386 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,387 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25774#unseeded} #46#return; {25774#unseeded} is VALID [2022-02-21 04:20:12,388 INFO L272 TraceCheckUtils]: 36: Hoare triple {25774#unseeded} call #t~ret7 := fibo1(~n - 2); {25774#unseeded} is VALID [2022-02-21 04:20:12,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {25774#unseeded} ~n := #in~n; {25774#unseeded} is VALID [2022-02-21 04:20:12,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {25774#unseeded} assume !(~n < 1); {25774#unseeded} is VALID [2022-02-21 04:20:12,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {25774#unseeded} assume !(1 == ~n); {25774#unseeded} is VALID [2022-02-21 04:20:12,389 INFO L272 TraceCheckUtils]: 40: Hoare triple {25774#unseeded} call #t~ret4 := fibo2(~n - 1); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:12,390 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {27942#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {25774#unseeded} #50#return; {25774#unseeded} is VALID [2022-02-21 04:20:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 04:20:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:12,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:12,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {25777#(>= oldRank0 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {28024#(<= (+ 2 |fibo2_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:12,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {28024#(<= (+ 2 |fibo2_#in~n|) oldRank0)} ~n := #in~n; {28028#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:12,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {28028#(<= (+ fibo2_~n 2) oldRank0)} assume !(~n < 1); {28028#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:12,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {28028#(<= (+ fibo2_~n 2) oldRank0)} assume !(1 == ~n); {28028#(<= (+ fibo2_~n 2) oldRank0)} is VALID [2022-02-21 04:20:12,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {28028#(<= (+ fibo2_~n 2) oldRank0)} call #t~ret6 := fibo1(~n - 1); {28038#(<= (+ 3 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:12,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {28038#(<= (+ 3 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {28042#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:12,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {28042#(<= (+ fibo1_~n 3) oldRank0)} assume !(~n < 1); {28042#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:12,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {28042#(<= (+ fibo1_~n 3) oldRank0)} assume !(1 == ~n); {28042#(<= (+ fibo1_~n 3) oldRank0)} is VALID [2022-02-21 04:20:12,588 INFO L272 TraceCheckUtils]: 8: Hoare triple {28042#(<= (+ fibo1_~n 3) oldRank0)} call #t~ret4 := fibo2(~n - 1); {28052#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 04:20:12,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {28052#(<= |old(oldRank0)| oldRank0)} ~n := #in~n; {28056#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:12,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {28056#(and (<= fibo2_~n |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume !(~n < 1); {28060#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:12,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {28060#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume 1 == ~n;#res := 1; {28060#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:12,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {28060#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} assume true; {28060#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 04:20:12,590 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {28060#(and (<= 1 |fibo2_#in~n|) (<= |old(oldRank0)| oldRank0))} {28042#(<= (+ fibo1_~n 3) oldRank0)} #50#return; {25787#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:20:12,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:12,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:12,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:12,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:12,621 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 8 loop predicates [2022-02-21 04:20:12,621 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 277 states and 332 transitions. cyclomatic complexity: 61 Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:13,259 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 277 states and 332 transitions. cyclomatic complexity: 61. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 1402 states and 1651 transitions. Complement of second has 102 states. [2022-02-21 04:20:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:13,260 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:13,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 277 states and 332 transitions. cyclomatic complexity: 61 [2022-02-21 04:20:13,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:13,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:13,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:13,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:13,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:13,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:13,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1402 states and 1651 transitions. [2022-02-21 04:20:13,266 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 186 [2022-02-21 04:20:13,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:13,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:13,267 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 277 states and 332 transitions. cyclomatic complexity: 61 [2022-02-21 04:20:13,267 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 50 examples of accepted words. [2022-02-21 04:20:13,268 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:13,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:13,269 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:13,269 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 [2022-02-21 04:20:13,281 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 108 examples of accepted words. [2022-02-21 04:20:13,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:13,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:13,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:13,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 1402 letters. Loop has 1402 letters. [2022-02-21 04:20:13,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 1402 letters. Loop has 1402 letters. [2022-02-21 04:20:13,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 1402 letters. Loop has 1402 letters. [2022-02-21 04:20:13,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:13,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:13,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 277 letters. Loop has 277 letters. [2022-02-21 04:20:13,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:13,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:13,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:20:13,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:13,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:13,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:13,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:13,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:13,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:13,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:13,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:13,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 55 letters. Loop has 14 letters. [2022-02-21 04:20:13,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:13,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:13,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:13,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:13,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:13,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:13,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:13,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:13,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:13,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:13,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:13,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:13,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:13,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:13,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 14 letters. [2022-02-21 04:20:13,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:13,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:13,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:13,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:13,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:13,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:13,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:13,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:13,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:13,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:13,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:13,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:13,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:13,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:13,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:13,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:13,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:13,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:13,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:13,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:13,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:13,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:13,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:13,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:13,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:13,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:13,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:13,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:13,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:13,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:13,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:13,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:13,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:13,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:13,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:13,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:13,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:13,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:13,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:13,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:13,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:13,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:13,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:13,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:13,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 3 letters. Loop has 6 letters. [2022-02-21 04:20:13,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:13,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:13,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:13,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:13,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:13,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 77 letters. Loop has 8 letters. [2022-02-21 04:20:13,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 83 letters. Loop has 14 letters. [2022-02-21 04:20:13,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 14 letters. [2022-02-21 04:20:13,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 83 letters. Loop has 14 letters. [2022-02-21 04:20:13,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:13,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:13,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 75 letters. Loop has 8 letters. [2022-02-21 04:20:13,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 94 letters. Loop has 40 letters. [2022-02-21 04:20:13,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 94 letters. Loop has 40 letters. [2022-02-21 04:20:13,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 94 letters. Loop has 40 letters. [2022-02-21 04:20:13,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:13,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:13,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:13,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:13,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:13,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 78 letters. Loop has 8 letters. [2022-02-21 04:20:13,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 81 letters. Loop has 14 letters. [2022-02-21 04:20:13,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 14 letters. [2022-02-21 04:20:13,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 81 letters. Loop has 14 letters. [2022-02-21 04:20:13,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:13,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:13,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 74 letters. Loop has 8 letters. [2022-02-21 04:20:13,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:13,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:13,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 73 letters. Loop has 8 letters. [2022-02-21 04:20:13,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:20:13,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:20:13,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 76 letters. Loop has 8 letters. [2022-02-21 04:20:13,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:13,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:13,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:13,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:13,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:13,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 72 letters. Loop has 8 letters. [2022-02-21 04:20:13,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:13,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:13,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 71 letters. Loop has 8 letters. [2022-02-21 04:20:13,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:13,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:13,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:13,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 82 letters. Loop has 14 letters. [2022-02-21 04:20:13,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 14 letters. [2022-02-21 04:20:13,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 82 letters. Loop has 14 letters. [2022-02-21 04:20:13,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:13,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:13,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 64 letters. Loop has 20 letters. [2022-02-21 04:20:13,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 22 letters. [2022-02-21 04:20:13,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 22 letters. [2022-02-21 04:20:13,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 72 letters. Loop has 22 letters. [2022-02-21 04:20:13,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 46 letters. [2022-02-21 04:20:13,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 46 letters. [2022-02-21 04:20:13,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 64 letters. Loop has 46 letters. [2022-02-21 04:20:13,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:13,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:13,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:13,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:13,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:13,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 14 letters. [2022-02-21 04:20:13,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 94 letters. Loop has 40 letters. [2022-02-21 04:20:13,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 94 letters. Loop has 40 letters. [2022-02-21 04:20:13,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 94 letters. Loop has 40 letters. [2022-02-21 04:20:13,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 46 letters. [2022-02-21 04:20:13,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 46 letters. [2022-02-21 04:20:13,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 46 letters. [2022-02-21 04:20:13,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 46 letters. [2022-02-21 04:20:13,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 46 letters. [2022-02-21 04:20:13,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 46 letters. [2022-02-21 04:20:13,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:13,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:13,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:20:13,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:20:13,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:20:13,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:20:13,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:13,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:13,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 61 letters. Loop has 14 letters. [2022-02-21 04:20:13,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:20:13,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:13,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:13,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 59 letters. Loop has 14 letters. [2022-02-21 04:20:13,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 52 letters. Loop has 8 letters. [2022-02-21 04:20:13,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:13,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:13,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 14 letters. [2022-02-21 04:20:13,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 51 letters. Loop has 8 letters. [2022-02-21 04:20:13,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:13,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:13,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 55 letters. Loop has 8 letters. [2022-02-21 04:20:13,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:13,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:13,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 56 letters. Loop has 8 letters. [2022-02-21 04:20:13,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 50 letters. Loop has 8 letters. [2022-02-21 04:20:13,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:13,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:13,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 8 letters. [2022-02-21 04:20:13,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:13,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:13,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 53 letters. Loop has 8 letters. [2022-02-21 04:20:13,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 20 letters. [2022-02-21 04:20:13,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:13,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:13,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:13,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:13,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:13,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 46 letters. [2022-02-21 04:20:13,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 28 letters. [2022-02-21 04:20:13,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 28 letters. [2022-02-21 04:20:13,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 28 letters. [2022-02-21 04:20:13,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:13,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:13,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:20:13,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 26 letters. [2022-02-21 04:20:13,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 58 letters. Loop has 14 letters. [2022-02-21 04:20:13,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:20:13,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:13,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:13,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 54 letters. Loop has 46 letters. [2022-02-21 04:20:13,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:13,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:13,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 80 letters. Loop has 26 letters. [2022-02-21 04:20:13,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:13,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:13,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 86 letters. Loop has 8 letters. [2022-02-21 04:20:13,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:13,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:13,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 87 letters. Loop has 8 letters. [2022-02-21 04:20:13,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:13,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:13,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 88 letters. Loop has 8 letters. [2022-02-21 04:20:13,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:13,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:13,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 83 letters. Loop has 8 letters. [2022-02-21 04:20:13,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:13,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:13,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:13,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:13,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:13,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:13,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:13,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:13,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:13,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:13,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:13,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 93 letters. Loop has 14 letters. [2022-02-21 04:20:13,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:13,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:13,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 81 letters. Loop has 8 letters. [2022-02-21 04:20:13,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:13,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:13,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 94 letters. Loop has 14 letters. [2022-02-21 04:20:13,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 95 letters. Loop has 14 letters. [2022-02-21 04:20:13,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 95 letters. Loop has 14 letters. [2022-02-21 04:20:13,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 95 letters. Loop has 14 letters. [2022-02-21 04:20:13,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 96 letters. Loop has 14 letters. [2022-02-21 04:20:13,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 96 letters. Loop has 14 letters. [2022-02-21 04:20:13,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 96 letters. Loop has 14 letters. [2022-02-21 04:20:13,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:13,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:13,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 84 letters. Loop has 8 letters. [2022-02-21 04:20:13,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 79 letters. Loop has 26 letters. [2022-02-21 04:20:13,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 79 letters. Loop has 26 letters. [2022-02-21 04:20:13,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 79 letters. Loop has 26 letters. [2022-02-21 04:20:13,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:13,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:13,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 85 letters. Loop has 8 letters. [2022-02-21 04:20:13,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:13,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:13,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 82 letters. Loop has 8 letters. [2022-02-21 04:20:13,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 86 letters. Loop has 40 letters. [2022-02-21 04:20:13,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 86 letters. Loop has 40 letters. [2022-02-21 04:20:13,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 86 letters. Loop has 40 letters. [2022-02-21 04:20:13,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:13,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:13,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 78 letters. Loop has 26 letters. [2022-02-21 04:20:13,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:13,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:13,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 92 letters. Loop has 14 letters. [2022-02-21 04:20:13,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 46 letters. [2022-02-21 04:20:13,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 46 letters. [2022-02-21 04:20:13,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 56 letters. Loop has 46 letters. [2022-02-21 04:20:13,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:13,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:13,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 56 letters. Loop has 20 letters. [2022-02-21 04:20:13,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 86 letters. Loop has 40 letters. [2022-02-21 04:20:13,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 86 letters. Loop has 40 letters. [2022-02-21 04:20:13,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 86 letters. Loop has 40 letters. [2022-02-21 04:20:13,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 46 letters. [2022-02-21 04:20:13,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 46 letters. [2022-02-21 04:20:13,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 78 letters. Loop has 46 letters. [2022-02-21 04:20:13,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 46 letters. [2022-02-21 04:20:13,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 46 letters. [2022-02-21 04:20:13,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 78 letters. Loop has 46 letters. [2022-02-21 04:20:13,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:20:13,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:20:13,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:20:13,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:13,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:13,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:13,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:13,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:13,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:13,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:13,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:13,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 72 letters. Loop has 14 letters. [2022-02-21 04:20:13,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:13,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:13,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:13,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:13,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:13,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:13,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:13,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:13,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:13,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:13,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:13,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 68 letters. Loop has 26 letters. [2022-02-21 04:20:13,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:13,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:13,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 71 letters. Loop has 14 letters. [2022-02-21 04:20:13,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:13,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:13,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:13,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:13,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:13,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:13,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:13,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:13,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 69 letters. Loop has 26 letters. [2022-02-21 04:20:13,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 70 letters. Loop has 14 letters. [2022-02-21 04:20:13,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:13,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:13,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 69 letters. Loop has 14 letters. [2022-02-21 04:20:13,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:13,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:13,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:13,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:13,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:13,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:13,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:20:13,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 20 letters. [2022-02-21 04:20:13,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:13,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:13,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 48 letters. Loop has 46 letters. [2022-02-21 04:20:13,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 68 letters. Loop has 14 letters. [2022-02-21 04:20:13,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 26 letters. [2022-02-21 04:20:13,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 46 letters. [2022-02-21 04:20:13,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 46 letters. [2022-02-21 04:20:13,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 46 letters. [2022-02-21 04:20:13,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:20:13,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:20:13,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:20:13,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 46 letters. Loop has 32 letters. [2022-02-21 04:20:13,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 277 states and 332 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 46 letters. [2022-02-21 04:20:13,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Stem has 67 letters. Loop has 46 letters. [2022-02-21 04:20:13,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 Stem has 67 letters. Loop has 46 letters. [2022-02-21 04:20:13,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,414 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:20:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2022-02-21 04:20:13,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 46 letters. Loop has 14 letters. [2022-02-21 04:20:13,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 60 letters. Loop has 14 letters. [2022-02-21 04:20:13,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 71 transitions. Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:20:13,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:13,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1402 states and 1651 transitions. cyclomatic complexity: 265 [2022-02-21 04:20:13,470 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 186 [2022-02-21 04:20:13,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1402 states to 782 states and 926 transitions. [2022-02-21 04:20:13,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 334 [2022-02-21 04:20:13,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 358 [2022-02-21 04:20:13,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 782 states and 926 transitions. [2022-02-21 04:20:13,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:13,494 INFO L681 BuchiCegarLoop]: Abstraction has 782 states and 926 transitions. [2022-02-21 04:20:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states and 926 transitions. [2022-02-21 04:20:13,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 640. [2022-02-21 04:20:13,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:13,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 782 states and 926 transitions. Second operand has 640 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 464 states have internal predecessors, (481), 126 states have call successors, (134), 95 states have call predecessors, (134), 95 states have return successors, (133), 80 states have call predecessors, (133), 99 states have call successors, (133) [2022-02-21 04:20:13,503 INFO L74 IsIncluded]: Start isIncluded. First operand 782 states and 926 transitions. Second operand has 640 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 464 states have internal predecessors, (481), 126 states have call successors, (134), 95 states have call predecessors, (134), 95 states have return successors, (133), 80 states have call predecessors, (133), 99 states have call successors, (133) [2022-02-21 04:20:13,504 INFO L87 Difference]: Start difference. First operand 782 states and 926 transitions. Second operand has 640 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 464 states have internal predecessors, (481), 126 states have call successors, (134), 95 states have call predecessors, (134), 95 states have return successors, (133), 80 states have call predecessors, (133), 99 states have call successors, (133) [2022-02-21 04:20:13,504 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:13,561 INFO L93 Difference]: Finished difference Result 1351 states and 1613 transitions. [2022-02-21 04:20:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1613 transitions. [2022-02-21 04:20:13,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:13,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:13,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 640 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 464 states have internal predecessors, (481), 126 states have call successors, (134), 95 states have call predecessors, (134), 95 states have return successors, (133), 80 states have call predecessors, (133), 99 states have call successors, (133) Second operand 782 states and 926 transitions. [2022-02-21 04:20:13,566 INFO L87 Difference]: Start difference. First operand has 640 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 464 states have internal predecessors, (481), 126 states have call successors, (134), 95 states have call predecessors, (134), 95 states have return successors, (133), 80 states have call predecessors, (133), 99 states have call successors, (133) Second operand 782 states and 926 transitions. [2022-02-21 04:20:13,567 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:13,644 INFO L93 Difference]: Finished difference Result 1576 states and 1887 transitions. [2022-02-21 04:20:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1887 transitions. [2022-02-21 04:20:13,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:13,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:13,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:13,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 464 states have internal predecessors, (481), 126 states have call successors, (134), 95 states have call predecessors, (134), 95 states have return successors, (133), 80 states have call predecessors, (133), 99 states have call successors, (133) [2022-02-21 04:20:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 748 transitions. [2022-02-21 04:20:13,664 INFO L704 BuchiCegarLoop]: Abstraction has 640 states and 748 transitions. [2022-02-21 04:20:13,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:13,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 04:20:13,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-02-21 04:20:13,664 INFO L87 Difference]: Start difference. First operand 640 states and 748 transitions. Second operand has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 04:20:14,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:14,326 INFO L93 Difference]: Finished difference Result 431 states and 477 transitions. [2022-02-21 04:20:14,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-21 04:20:14,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 12 states have internal predecessors, (35), 8 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-21 04:20:14,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:14,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 477 transitions. [2022-02-21 04:20:14,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-02-21 04:20:14,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 270 states and 303 transitions. [2022-02-21 04:20:14,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2022-02-21 04:20:14,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-02-21 04:20:14,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 303 transitions. [2022-02-21 04:20:14,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:14,376 INFO L681 BuchiCegarLoop]: Abstraction has 270 states and 303 transitions. [2022-02-21 04:20:14,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 303 transitions. [2022-02-21 04:20:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 261. [2022-02-21 04:20:14,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:14,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states and 303 transitions. Second operand has 261 states, 173 states have (on average 1.0982658959537572) internal successors, (190), 186 states have internal predecessors, (190), 48 states have call successors, (52), 38 states have call predecessors, (52), 40 states have return successors, (51), 36 states have call predecessors, (51), 40 states have call successors, (51) [2022-02-21 04:20:14,380 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states and 303 transitions. Second operand has 261 states, 173 states have (on average 1.0982658959537572) internal successors, (190), 186 states have internal predecessors, (190), 48 states have call successors, (52), 38 states have call predecessors, (52), 40 states have return successors, (51), 36 states have call predecessors, (51), 40 states have call successors, (51) [2022-02-21 04:20:14,380 INFO L87 Difference]: Start difference. First operand 270 states and 303 transitions. Second operand has 261 states, 173 states have (on average 1.0982658959537572) internal successors, (190), 186 states have internal predecessors, (190), 48 states have call successors, (52), 38 states have call predecessors, (52), 40 states have return successors, (51), 36 states have call predecessors, (51), 40 states have call successors, (51) [2022-02-21 04:20:14,381 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:14,388 INFO L93 Difference]: Finished difference Result 428 states and 494 transitions. [2022-02-21 04:20:14,389 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 494 transitions. [2022-02-21 04:20:14,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:14,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:14,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 173 states have (on average 1.0982658959537572) internal successors, (190), 186 states have internal predecessors, (190), 48 states have call successors, (52), 38 states have call predecessors, (52), 40 states have return successors, (51), 36 states have call predecessors, (51), 40 states have call successors, (51) Second operand 270 states and 303 transitions. [2022-02-21 04:20:14,390 INFO L87 Difference]: Start difference. First operand has 261 states, 173 states have (on average 1.0982658959537572) internal successors, (190), 186 states have internal predecessors, (190), 48 states have call successors, (52), 38 states have call predecessors, (52), 40 states have return successors, (51), 36 states have call predecessors, (51), 40 states have call successors, (51) Second operand 270 states and 303 transitions. [2022-02-21 04:20:14,391 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:14,398 INFO L93 Difference]: Finished difference Result 428 states and 494 transitions. [2022-02-21 04:20:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 494 transitions. [2022-02-21 04:20:14,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:14,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:14,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:14,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 173 states have (on average 1.0982658959537572) internal successors, (190), 186 states have internal predecessors, (190), 48 states have call successors, (52), 38 states have call predecessors, (52), 40 states have return successors, (51), 36 states have call predecessors, (51), 40 states have call successors, (51) [2022-02-21 04:20:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 293 transitions. [2022-02-21 04:20:14,403 INFO L704 BuchiCegarLoop]: Abstraction has 261 states and 293 transitions. [2022-02-21 04:20:14,403 INFO L587 BuchiCegarLoop]: Abstraction has 261 states and 293 transitions. [2022-02-21 04:20:14,403 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 04:20:14,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 293 transitions. [2022-02-21 04:20:14,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-02-21 04:20:14,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:14,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:14,404 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:14,404 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:14,405 INFO L791 eck$LassoCheckResult]: Stem: 35741#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 35742#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; 35774#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 35816#fibo1ENTRY ~n := #in~n; 35966#L10 assume !(~n < 1); 35964#L12 assume !(1 == ~n); 35878#L15 call #t~ret4 := fibo2(~n - 1);< 35879#fibo2ENTRY ~n := #in~n; 35929#L20 assume !(~n < 1); 35927#L22 assume !(1 == ~n); 35907#L25 call #t~ret6 := fibo1(~n - 1);< 35916#fibo1ENTRY ~n := #in~n; 35915#L10 assume !(~n < 1); 35914#L12 assume !(1 == ~n); 35904#L15 call #t~ret4 := fibo2(~n - 1);< 35912#fibo2ENTRY ~n := #in~n; 35913#L20 assume !(~n < 1); 35908#L22 assume !(1 == ~n); 35799#L25 call #t~ret6 := fibo1(~n - 1);< 35890#fibo1ENTRY ~n := #in~n; 35884#L10 assume !(~n < 1); 35883#L12 assume !(1 == ~n); 35798#L15 call #t~ret4 := fibo2(~n - 1);< 35800#fibo2ENTRY ~n := #in~n; 35971#L20 assume !(~n < 1); 35963#L22 assume 1 == ~n;#res := 1; 35946#fibo2FINAL assume true; 35944#fibo2EXIT >#50#return; 35939#L15-1 call #t~ret5 := fibo2(~n - 2);< 35940#fibo2ENTRY ~n := #in~n; 35945#L20 assume ~n < 1;#res := 0; 35943#fibo2FINAL assume true; 35938#fibo2EXIT >#52#return; 35935#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 35931#fibo1FINAL assume true; 35924#fibo1EXIT >#46#return; 35922#L25-1 call #t~ret7 := fibo1(~n - 2);< 35923#fibo1ENTRY ~n := #in~n; 35930#L10 assume !(~n < 1); 35928#L12 assume 1 == ~n;#res := 1; 35926#fibo1FINAL assume true; 35921#fibo1EXIT >#48#return; 35920#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 35919#fibo2FINAL assume true; 35911#fibo2EXIT >#50#return; 35786#L15-1 call #t~ret5 := fibo2(~n - 2);< 35899#fibo2ENTRY ~n := #in~n; 35958#L20 assume !(~n < 1); 35956#L22 assume 1 == ~n;#res := 1; 35955#fibo2FINAL assume true; 35952#fibo2EXIT >#52#return; 35898#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 35950#fibo1FINAL assume true; 35948#fibo1EXIT >#46#return; 35886#L25-1 call #t~ret7 := fibo1(~n - 2);< 35759#fibo1ENTRY ~n := #in~n; 35918#L10 assume !(~n < 1); 35910#L12 assume !(1 == ~n); 35897#L15 call #t~ret4 := fibo2(~n - 1);< 35906#fibo2ENTRY [2022-02-21 04:20:14,405 INFO L793 eck$LassoCheckResult]: Loop: 35906#fibo2ENTRY ~n := #in~n; 35941#L20 assume !(~n < 1); 35936#L22 assume !(1 == ~n); 35811#L25 call #t~ret6 := fibo1(~n - 1);< 35942#fibo1ENTRY ~n := #in~n; 35937#L10 assume !(~n < 1); 35933#L12 assume !(1 == ~n); 35896#L15 call #t~ret4 := fibo2(~n - 1);< 35906#fibo2ENTRY [2022-02-21 04:20:14,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash 699178782, now seen corresponding path program 1 times [2022-02-21 04:20:14,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:14,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606014344] [2022-02-21 04:20:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:14,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-21 04:20:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:14,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,543 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:14,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:14,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37680#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {37680#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:14,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:14,547 INFO L272 TraceCheckUtils]: 3: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:14,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,548 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:14,548 INFO L272 TraceCheckUtils]: 9: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:14,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:14,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,549 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} assume true; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,550 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {37692#(<= 2 |fibo1_#in~n|)} {37655#(= fibo2_~n |fibo2_#in~n|)} #46#return; {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:14,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,554 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37569#true} {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #48#return; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,555 INFO L272 TraceCheckUtils]: 3: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,555 INFO L290 TraceCheckUtils]: 4: Hoare triple {37569#true} ~n := #in~n; {37680#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {37680#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:14,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:14,556 INFO L272 TraceCheckUtils]: 7: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:14,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,557 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:14,557 INFO L272 TraceCheckUtils]: 13: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:14,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:14,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,557 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} assume true; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,558 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {37692#(<= 2 |fibo1_#in~n|)} {37655#(= fibo2_~n |fibo2_#in~n|)} #46#return; {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:14,558 INFO L272 TraceCheckUtils]: 21: Hoare triple {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {37569#true} is VALID [2022-02-21 04:20:14,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:14,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,559 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {37569#true} {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #48#return; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {37679#(<= 3 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {37679#(<= 3 |fibo2_#in~n|)} assume true; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,560 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {37679#(<= 3 |fibo2_#in~n|)} {37569#true} #50#return; {37649#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:14,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-21 04:20:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:14,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {37693#(<= |fibo2_#in~n| 1)} assume true; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:14,577 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37693#(<= |fibo2_#in~n| 1)} {37649#(<= 4 fibo1_~n)} #52#return; {37570#false} is VALID [2022-02-21 04:20:14,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {37569#true} assume !(1 == ~n); {37569#true} is VALID [2022-02-21 04:20:14,577 INFO L272 TraceCheckUtils]: 3: Hoare triple {37569#true} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {37569#true} ~n := #in~n; {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,578 INFO L272 TraceCheckUtils]: 7: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {37569#true} ~n := #in~n; {37680#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {37680#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:14,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:14,579 INFO L272 TraceCheckUtils]: 11: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:14,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,580 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:14,580 INFO L272 TraceCheckUtils]: 17: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:14,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:14,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,580 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} assume true; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,582 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {37692#(<= 2 |fibo1_#in~n|)} {37655#(= fibo2_~n |fibo2_#in~n|)} #46#return; {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:14,582 INFO L272 TraceCheckUtils]: 25: Hoare triple {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {37569#true} is VALID [2022-02-21 04:20:14,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:14,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,582 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {37569#true} {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #48#return; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {37679#(<= 3 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {37679#(<= 3 |fibo2_#in~n|)} assume true; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,583 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {37679#(<= 3 |fibo2_#in~n|)} {37569#true} #50#return; {37649#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:14,584 INFO L272 TraceCheckUtils]: 34: Hoare triple {37649#(<= 4 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:14,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {37569#true} ~n := #in~n; {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:14,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {37693#(<= |fibo2_#in~n| 1)} assume true; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:14,585 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37693#(<= |fibo2_#in~n| 1)} {37649#(<= 4 fibo1_~n)} #52#return; {37570#false} is VALID [2022-02-21 04:20:14,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {37570#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37570#false} is VALID [2022-02-21 04:20:14,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {37570#false} assume true; {37570#false} is VALID [2022-02-21 04:20:14,585 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {37570#false} {37575#(<= 5 fibo2_~n)} #46#return; {37570#false} is VALID [2022-02-21 04:20:14,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {37569#true} is VALID [2022-02-21 04:20:14,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {37571#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:20:14,586 INFO L272 TraceCheckUtils]: 2: Hoare triple {37571#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {37572#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {37572#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:14,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {37573#(<= 6 fibo1_~n)} assume !(~n < 1); {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:14,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {37573#(<= 6 fibo1_~n)} assume !(1 == ~n); {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:14,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {37573#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {37574#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {37574#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:14,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {37575#(<= 5 fibo2_~n)} assume !(~n < 1); {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:14,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {37575#(<= 5 fibo2_~n)} assume !(1 == ~n); {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:14,588 INFO L272 TraceCheckUtils]: 10: Hoare triple {37575#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {37569#true} assume !(1 == ~n); {37569#true} is VALID [2022-02-21 04:20:14,588 INFO L272 TraceCheckUtils]: 14: Hoare triple {37569#true} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {37569#true} ~n := #in~n; {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(1 == ~n); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,589 INFO L272 TraceCheckUtils]: 18: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {37569#true} ~n := #in~n; {37680#(= fibo1_~n |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {37680#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:14,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {37681#(and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n))} assume !(1 == ~n); {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:14,590 INFO L272 TraceCheckUtils]: 22: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:14,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,591 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #50#return; {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} is VALID [2022-02-21 04:20:14,591 INFO L272 TraceCheckUtils]: 28: Hoare triple {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:14,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:14,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,592 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {37569#true} {37682#(and (= fibo1_~n |fibo1_#in~n|) (not (<= fibo1_~n 1)))} #52#return; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {37692#(<= 2 |fibo1_#in~n|)} assume true; {37692#(<= 2 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,593 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {37692#(<= 2 |fibo1_#in~n|)} {37655#(= fibo2_~n |fibo2_#in~n|)} #46#return; {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} is VALID [2022-02-21 04:20:14,593 INFO L272 TraceCheckUtils]: 36: Hoare triple {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} call #t~ret7 := fibo1(~n - 2); {37569#true} is VALID [2022-02-21 04:20:14,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:14,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,593 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37569#true} {37673#(and (<= 3 fibo2_~n) (= fibo2_~n |fibo2_#in~n|))} #48#return; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {37679#(<= 3 |fibo2_#in~n|)} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {37679#(<= 3 |fibo2_#in~n|)} assume true; {37679#(<= 3 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,594 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {37679#(<= 3 |fibo2_#in~n|)} {37569#true} #50#return; {37649#(<= 4 fibo1_~n)} is VALID [2022-02-21 04:20:14,594 INFO L272 TraceCheckUtils]: 45: Hoare triple {37649#(<= 4 fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:14,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {37569#true} ~n := #in~n; {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume !(~n < 1); {37655#(= fibo2_~n |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {37655#(= fibo2_~n |fibo2_#in~n|)} assume 1 == ~n;#res := 1; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:14,595 INFO L290 TraceCheckUtils]: 49: Hoare triple {37693#(<= |fibo2_#in~n| 1)} assume true; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:14,596 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37693#(<= |fibo2_#in~n| 1)} {37649#(<= 4 fibo1_~n)} #52#return; {37570#false} is VALID [2022-02-21 04:20:14,596 INFO L290 TraceCheckUtils]: 51: Hoare triple {37570#false} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37570#false} is VALID [2022-02-21 04:20:14,596 INFO L290 TraceCheckUtils]: 52: Hoare triple {37570#false} assume true; {37570#false} is VALID [2022-02-21 04:20:14,596 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37570#false} {37575#(<= 5 fibo2_~n)} #46#return; {37570#false} is VALID [2022-02-21 04:20:14,596 INFO L272 TraceCheckUtils]: 54: Hoare triple {37570#false} call #t~ret7 := fibo1(~n - 2); {37570#false} is VALID [2022-02-21 04:20:14,596 INFO L290 TraceCheckUtils]: 55: Hoare triple {37570#false} ~n := #in~n; {37570#false} is VALID [2022-02-21 04:20:14,596 INFO L290 TraceCheckUtils]: 56: Hoare triple {37570#false} assume !(~n < 1); {37570#false} is VALID [2022-02-21 04:20:14,596 INFO L290 TraceCheckUtils]: 57: Hoare triple {37570#false} assume !(1 == ~n); {37570#false} is VALID [2022-02-21 04:20:14,596 INFO L272 TraceCheckUtils]: 58: Hoare triple {37570#false} call #t~ret4 := fibo2(~n - 1); {37570#false} is VALID [2022-02-21 04:20:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 35 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-21 04:20:14,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:14,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606014344] [2022-02-21 04:20:14,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606014344] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:14,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513999116] [2022-02-21 04:20:14,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:14,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:14,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:14,598 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:20:14,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-02-21 04:20:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 04:20:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:14,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:14,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {37569#true} is VALID [2022-02-21 04:20:14,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {37571#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:20:14,842 INFO L272 TraceCheckUtils]: 2: Hoare triple {37571#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {37572#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:14,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {37572#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:14,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {37573#(<= 6 fibo1_~n)} assume !(~n < 1); {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:14,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {37573#(<= 6 fibo1_~n)} assume !(1 == ~n); {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:14,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {37573#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {37574#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:14,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {37574#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:14,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {37575#(<= 5 fibo2_~n)} assume !(~n < 1); {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:14,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {37575#(<= 5 fibo2_~n)} assume !(1 == ~n); {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:14,844 INFO L272 TraceCheckUtils]: 10: Hoare triple {37575#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {37569#true} ~n := #in~n; {37730#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:14,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {37730#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {37730#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:14,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {37730#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {37730#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:14,845 INFO L272 TraceCheckUtils]: 14: Hoare triple {37730#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {37569#true} assume !(1 == ~n); {37569#true} is VALID [2022-02-21 04:20:14,845 INFO L272 TraceCheckUtils]: 18: Hoare triple {37569#true} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {37569#true} assume !(1 == ~n); {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L272 TraceCheckUtils]: 22: Hoare triple {37569#true} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {37569#true} {37569#true} #50#return; {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L272 TraceCheckUtils]: 28: Hoare triple {37569#true} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {37569#true} {37569#true} #52#return; {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {37569#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {37569#true} {37569#true} #46#return; {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L272 TraceCheckUtils]: 36: Hoare triple {37569#true} call #t~ret7 := fibo1(~n - 2); {37569#true} is VALID [2022-02-21 04:20:14,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:14,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:14,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:14,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,847 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37569#true} {37569#true} #48#return; {37569#true} is VALID [2022-02-21 04:20:14,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {37569#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {37569#true} is VALID [2022-02-21 04:20:14,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:14,847 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {37569#true} {37730#(<= |fibo1_#in~n| fibo1_~n)} #50#return; {37730#(<= |fibo1_#in~n| fibo1_~n)} is VALID [2022-02-21 04:20:14,847 INFO L272 TraceCheckUtils]: 45: Hoare triple {37730#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:14,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {37569#true} ~n := #in~n; {37836#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:14,848 INFO L290 TraceCheckUtils]: 47: Hoare triple {37836#(<= |fibo2_#in~n| fibo2_~n)} assume !(~n < 1); {37836#(<= |fibo2_#in~n| fibo2_~n)} is VALID [2022-02-21 04:20:14,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {37836#(<= |fibo2_#in~n| fibo2_~n)} assume 1 == ~n;#res := 1; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:14,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {37693#(<= |fibo2_#in~n| 1)} assume true; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:14,849 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37693#(<= |fibo2_#in~n| 1)} {37730#(<= |fibo1_#in~n| fibo1_~n)} #52#return; {37849#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:14,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {37849#(<= |fibo1_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37849#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:14,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {37849#(<= |fibo1_#in~n| 3)} assume true; {37849#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:14,850 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37849#(<= |fibo1_#in~n| 3)} {37575#(<= 5 fibo2_~n)} #46#return; {37570#false} is VALID [2022-02-21 04:20:14,850 INFO L272 TraceCheckUtils]: 54: Hoare triple {37570#false} call #t~ret7 := fibo1(~n - 2); {37570#false} is VALID [2022-02-21 04:20:14,850 INFO L290 TraceCheckUtils]: 55: Hoare triple {37570#false} ~n := #in~n; {37570#false} is VALID [2022-02-21 04:20:14,850 INFO L290 TraceCheckUtils]: 56: Hoare triple {37570#false} assume !(~n < 1); {37570#false} is VALID [2022-02-21 04:20:14,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {37570#false} assume !(1 == ~n); {37570#false} is VALID [2022-02-21 04:20:14,850 INFO L272 TraceCheckUtils]: 58: Hoare triple {37570#false} call #t~ret4 := fibo2(~n - 1); {37570#false} is VALID [2022-02-21 04:20:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 33 proven. 28 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-21 04:20:14,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:15,374 INFO L272 TraceCheckUtils]: 58: Hoare triple {37570#false} call #t~ret4 := fibo2(~n - 1); {37570#false} is VALID [2022-02-21 04:20:15,374 INFO L290 TraceCheckUtils]: 57: Hoare triple {37570#false} assume !(1 == ~n); {37570#false} is VALID [2022-02-21 04:20:15,374 INFO L290 TraceCheckUtils]: 56: Hoare triple {37570#false} assume !(~n < 1); {37570#false} is VALID [2022-02-21 04:20:15,374 INFO L290 TraceCheckUtils]: 55: Hoare triple {37570#false} ~n := #in~n; {37570#false} is VALID [2022-02-21 04:20:15,374 INFO L272 TraceCheckUtils]: 54: Hoare triple {37570#false} call #t~ret7 := fibo1(~n - 2); {37570#false} is VALID [2022-02-21 04:20:15,375 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {37849#(<= |fibo1_#in~n| 3)} {37575#(<= 5 fibo2_~n)} #46#return; {37570#false} is VALID [2022-02-21 04:20:15,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {37849#(<= |fibo1_#in~n| 3)} assume true; {37849#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:15,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {37849#(<= |fibo1_#in~n| 3)} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37849#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:15,376 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {37693#(<= |fibo2_#in~n| 1)} {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} #52#return; {37849#(<= |fibo1_#in~n| 3)} is VALID [2022-02-21 04:20:15,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {37693#(<= |fibo2_#in~n| 1)} assume true; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:15,377 INFO L290 TraceCheckUtils]: 48: Hoare triple {37911#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume 1 == ~n;#res := 1; {37693#(<= |fibo2_#in~n| 1)} is VALID [2022-02-21 04:20:15,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {37911#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} assume !(~n < 1); {37911#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:20:15,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {37569#true} ~n := #in~n; {37911#(or (not (<= fibo2_~n 1)) (<= |fibo2_#in~n| 1))} is VALID [2022-02-21 04:20:15,377 INFO L272 TraceCheckUtils]: 45: Hoare triple {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:15,378 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {37569#true} {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} #50#return; {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-21 04:20:15,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:15,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {37569#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {37569#true} is VALID [2022-02-21 04:20:15,378 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37569#true} {37569#true} #48#return; {37569#true} is VALID [2022-02-21 04:20:15,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:15,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:15,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:15,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:15,378 INFO L272 TraceCheckUtils]: 36: Hoare triple {37569#true} call #t~ret7 := fibo1(~n - 2); {37569#true} is VALID [2022-02-21 04:20:15,378 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {37569#true} {37569#true} #46#return; {37569#true} is VALID [2022-02-21 04:20:15,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:15,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {37569#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {37569#true} {37569#true} #52#return; {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {37569#true} assume ~n < 1;#res := 0; {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L272 TraceCheckUtils]: 28: Hoare triple {37569#true} call #t~ret5 := fibo2(~n - 2); {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {37569#true} {37569#true} #50#return; {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {37569#true} assume true; {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {37569#true} assume 1 == ~n;#res := 1; {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L272 TraceCheckUtils]: 22: Hoare triple {37569#true} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {37569#true} assume !(1 == ~n); {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L272 TraceCheckUtils]: 18: Hoare triple {37569#true} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {37569#true} assume !(1 == ~n); {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {37569#true} assume !(~n < 1); {37569#true} is VALID [2022-02-21 04:20:15,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {37569#true} ~n := #in~n; {37569#true} is VALID [2022-02-21 04:20:15,380 INFO L272 TraceCheckUtils]: 14: Hoare triple {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} call #t~ret4 := fibo2(~n - 1); {37569#true} is VALID [2022-02-21 04:20:15,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} assume !(1 == ~n); {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-21 04:20:15,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} assume !(~n < 1); {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-21 04:20:15,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {37569#true} ~n := #in~n; {37901#(or (<= |fibo1_#in~n| 3) (< 3 fibo1_~n))} is VALID [2022-02-21 04:20:15,380 INFO L272 TraceCheckUtils]: 10: Hoare triple {37575#(<= 5 fibo2_~n)} call #t~ret6 := fibo1(~n - 1); {37569#true} is VALID [2022-02-21 04:20:15,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {37575#(<= 5 fibo2_~n)} assume !(1 == ~n); {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:15,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {37575#(<= 5 fibo2_~n)} assume !(~n < 1); {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:15,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {37574#(<= 5 |fibo2_#in~n|)} ~n := #in~n; {37575#(<= 5 fibo2_~n)} is VALID [2022-02-21 04:20:15,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {37573#(<= 6 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {37574#(<= 5 |fibo2_#in~n|)} is VALID [2022-02-21 04:20:15,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {37573#(<= 6 fibo1_~n)} assume !(1 == ~n); {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:15,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {37573#(<= 6 fibo1_~n)} assume !(~n < 1); {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:15,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {37572#(<= 6 |fibo1_#in~n|)} ~n := #in~n; {37573#(<= 6 fibo1_~n)} is VALID [2022-02-21 04:20:15,397 INFO L272 TraceCheckUtils]: 2: Hoare triple {37571#(<= 6 |ULTIMATE.start_main_~x~0#1|)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {37572#(<= 6 |fibo1_#in~n|)} is VALID [2022-02-21 04:20:15,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {37569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {37571#(<= 6 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 04:20:15,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {37569#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {37569#true} is VALID [2022-02-21 04:20:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 33 proven. 28 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-21 04:20:15,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513999116] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:15,398 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:15,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 21 [2022-02-21 04:20:15,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954634054] [2022-02-21 04:20:15,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:15,398 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:15,398 INFO L85 PathProgramCache]: Analyzing trace with hash -28526872, now seen corresponding path program 3 times [2022-02-21 04:20:15,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:15,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878272378] [2022-02-21 04:20:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:15,403 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:15,404 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:15,525 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:15,525 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:15,525 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:15,525 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:15,525 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:20:15,525 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,525 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:15,525 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:15,525 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-1.c_Iteration8_Loop [2022-02-21 04:20:15,525 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:15,525 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:15,526 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 04:20:15,531 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 04:20:15,532 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 04:20:15,534 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 04:20:15,535 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 04:20:15,537 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 04:20:15,538 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 04:20:15,540 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 04:20:15,541 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 04:20:15,544 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 04:20:15,609 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:15,609 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:20:15,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,611 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 04:20:15,611 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 04:20:15,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:15,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:15,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:15,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,635 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 04:20:15,635 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 04:20:15,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:20:15,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:15,691 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:20:15,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-02-21 04:20:15,694 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:15,694 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:15,694 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:15,694 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:15,694 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:20:15,694 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,694 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:15,694 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:15,694 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-1.c_Iteration8_Loop [2022-02-21 04:20:15,694 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:15,694 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:15,695 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 04:20:15,701 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 04:20:15,702 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 04:20:15,703 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 04:20:15,705 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 04:20:15,706 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 04:20:15,708 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 04:20:15,709 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 04:20:15,711 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 04:20:15,712 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 04:20:15,779 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:15,779 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:20:15,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,780 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 04:20:15,781 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 04:20:15,782 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 04:20:15,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:15,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:15,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:15,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:15,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:15,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:15,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:15,795 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:20:15,796 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:20:15,796 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:20:15,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:15,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:15,805 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 04:20:15,806 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 04:20:15,806 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:20:15,806 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:20:15,806 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:20:15,806 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo2_#in~n) = 1*fibo2_#in~n Supporting invariants [] [2022-02-21 04:20:15,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:15,825 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:20:15,827 INFO L390 LassoCheck]: Loop: "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret4 := fibo2(~n - 1);"< [2022-02-21 04:20:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:15,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:15,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 04:20:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:15,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:16,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:16,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {38049#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {38049#unseeded} is VALID [2022-02-21 04:20:16,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {38049#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {38049#unseeded} is VALID [2022-02-21 04:20:16,398 INFO L272 TraceCheckUtils]: 2: Hoare triple {38049#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {38049#unseeded} is VALID [2022-02-21 04:20:16,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:16,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:16,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:16,400 INFO L272 TraceCheckUtils]: 6: Hoare triple {38049#unseeded} call #t~ret4 := fibo2(~n - 1); {38049#unseeded} is VALID [2022-02-21 04:20:16,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:16,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:16,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:16,401 INFO L272 TraceCheckUtils]: 10: Hoare triple {38049#unseeded} call #t~ret6 := fibo1(~n - 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,403 INFO L272 TraceCheckUtils]: 14: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,404 INFO L272 TraceCheckUtils]: 18: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,406 INFO L272 TraceCheckUtils]: 22: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,408 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,409 INFO L272 TraceCheckUtils]: 28: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,411 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,412 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,413 INFO L272 TraceCheckUtils]: 36: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,414 INFO L290 TraceCheckUtils]: 40: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,415 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,415 INFO L290 TraceCheckUtils]: 42: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,416 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,417 INFO L272 TraceCheckUtils]: 45: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,417 INFO L290 TraceCheckUtils]: 46: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,418 INFO L290 TraceCheckUtils]: 47: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,418 INFO L290 TraceCheckUtils]: 48: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,419 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:16,420 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38097#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38049#unseeded} #46#return; {38049#unseeded} is VALID [2022-02-21 04:20:16,421 INFO L272 TraceCheckUtils]: 54: Hoare triple {38049#unseeded} call #t~ret7 := fibo1(~n - 2); {38049#unseeded} is VALID [2022-02-21 04:20:16,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:16,421 INFO L290 TraceCheckUtils]: 56: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:16,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:16,422 INFO L272 TraceCheckUtils]: 58: Hoare triple {38049#unseeded} call #t~ret4 := fibo2(~n - 1); {38049#unseeded} is VALID [2022-02-21 04:20:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:20:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:16,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {38052#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {38242#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:16,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {38242#(<= fibo2_~n oldRank0)} assume !(~n < 1); {38242#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:16,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {38242#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {38242#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:16,521 INFO L272 TraceCheckUtils]: 3: Hoare triple {38242#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {38252#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:20:16,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {38252#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {38256#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:20:16,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {38256#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {38260#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:16,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {38260#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {38260#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:16,522 INFO L272 TraceCheckUtils]: 7: Hoare triple {38260#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {38062#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:20:16,522 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 04:20:16,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:16,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:16,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,558 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2022-02-21 04:20:16,558 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 261 states and 293 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:16,700 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 261 states and 293 transitions. cyclomatic complexity: 35. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 279 states and 311 transitions. Complement of second has 15 states. [2022-02-21 04:20:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:16,701 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:16,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 293 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:16,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:16,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:16,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:16,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:20:16,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:16,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:16,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 311 transitions. [2022-02-21 04:20:16,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-02-21 04:20:16,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:16,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:16,703 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 261 states and 293 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:16,704 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:20:16,705 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:16,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:20:16,705 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:16,705 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 279 states and 311 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:16,706 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:20:16,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:16,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:16,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:16,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 279 letters. Loop has 279 letters. [2022-02-21 04:20:16,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 279 letters. Loop has 279 letters. [2022-02-21 04:20:16,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 279 letters. Loop has 279 letters. [2022-02-21 04:20:16,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:16,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:16,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:16,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:20:16,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:20:16,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:20:16,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:16,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:16,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:16,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:16,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:16,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:16,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:16,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:16,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:16,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:16,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:16,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:16,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:16,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:16,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:16,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:16,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:16,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:16,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:16,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:16,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:16,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:16,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:16,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:16,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:16,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:16,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:16,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:16,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:16,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:16,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:16,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:16,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:16,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:16,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:16,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:16,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:16,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:16,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:16,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:16,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:16,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:16,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:16,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:16,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:16,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:16,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:16,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:16,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:16,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:16,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:16,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:16,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:16,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:16,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:16,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:16,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:16,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,723 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-02-21 04:20:16,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:16,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:16,724 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:16,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 04:20:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:16,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:17,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {38049#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {38049#unseeded} is VALID [2022-02-21 04:20:17,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {38049#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {38049#unseeded} is VALID [2022-02-21 04:20:17,203 INFO L272 TraceCheckUtils]: 2: Hoare triple {38049#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {38049#unseeded} is VALID [2022-02-21 04:20:17,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:17,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:17,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:17,205 INFO L272 TraceCheckUtils]: 6: Hoare triple {38049#unseeded} call #t~ret4 := fibo2(~n - 1); {38049#unseeded} is VALID [2022-02-21 04:20:17,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:17,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:17,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:17,206 INFO L272 TraceCheckUtils]: 10: Hoare triple {38049#unseeded} call #t~ret6 := fibo1(~n - 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,208 INFO L272 TraceCheckUtils]: 14: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,209 INFO L272 TraceCheckUtils]: 18: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,211 INFO L272 TraceCheckUtils]: 22: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,213 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,213 INFO L272 TraceCheckUtils]: 28: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,215 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,216 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,217 INFO L272 TraceCheckUtils]: 36: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,219 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,221 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,221 INFO L272 TraceCheckUtils]: 45: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,223 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,224 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {38605#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38049#unseeded} #46#return; {38049#unseeded} is VALID [2022-02-21 04:20:17,225 INFO L272 TraceCheckUtils]: 54: Hoare triple {38049#unseeded} call #t~ret7 := fibo1(~n - 2); {38049#unseeded} is VALID [2022-02-21 04:20:17,225 INFO L290 TraceCheckUtils]: 55: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:17,225 INFO L290 TraceCheckUtils]: 56: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:17,226 INFO L290 TraceCheckUtils]: 57: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:17,226 INFO L272 TraceCheckUtils]: 58: Hoare triple {38049#unseeded} call #t~ret4 := fibo2(~n - 1); {38049#unseeded} is VALID [2022-02-21 04:20:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:20:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:17,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {38052#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {38750#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:17,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {38750#(<= fibo2_~n oldRank0)} assume !(~n < 1); {38750#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:17,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {38750#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {38750#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:17,329 INFO L272 TraceCheckUtils]: 3: Hoare triple {38750#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {38760#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:20:17,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {38760#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {38764#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:20:17,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {38764#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {38768#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:17,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {38768#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {38768#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:17,331 INFO L272 TraceCheckUtils]: 7: Hoare triple {38768#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {38062#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:20:17,331 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 04:20:17,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:17,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:17,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,361 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2022-02-21 04:20:17,361 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 261 states and 293 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:17,462 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 261 states and 293 transitions. cyclomatic complexity: 35. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 279 states and 311 transitions. Complement of second has 15 states. [2022-02-21 04:20:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:17,462 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:17,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 293 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:17,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:17,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:17,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:17,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:20:17,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:17,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:17,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 311 transitions. [2022-02-21 04:20:17,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-02-21 04:20:17,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:17,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:17,465 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 261 states and 293 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:17,465 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:20:17,466 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:17,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:20:17,466 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:17,466 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 279 states and 311 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:17,467 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:20:17,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:17,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:17,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:17,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 279 letters. Loop has 279 letters. [2022-02-21 04:20:17,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 279 letters. Loop has 279 letters. [2022-02-21 04:20:17,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 279 letters. Loop has 279 letters. [2022-02-21 04:20:17,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:17,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:17,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:17,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:20:17,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:20:17,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 7 letters. [2022-02-21 04:20:17,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:17,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:17,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:17,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:17,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:17,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:17,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:17,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:17,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:17,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:17,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:17,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:17,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:17,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:17,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:17,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:17,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:17,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:17,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:17,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:17,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:17,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:17,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:17,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:17,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:17,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:17,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:17,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:17,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:17,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:17,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:17,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:17,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:17,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:17,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:17,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:17,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:17,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:17,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:17,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:17,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:17,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:17,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:17,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:17,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:17,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:17,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:17,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:17,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:17,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:17,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:17,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:17,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:17,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:17,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:17,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:17,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 279 states and 311 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:17,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,484 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-02-21 04:20:17,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:17,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:17,485 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:17,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 04:20:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:17,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:17,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {38049#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {38049#unseeded} is VALID [2022-02-21 04:20:17,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {38049#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {38049#unseeded} is VALID [2022-02-21 04:20:17,967 INFO L272 TraceCheckUtils]: 2: Hoare triple {38049#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {38049#unseeded} is VALID [2022-02-21 04:20:17,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:17,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:17,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:17,968 INFO L272 TraceCheckUtils]: 6: Hoare triple {38049#unseeded} call #t~ret4 := fibo2(~n - 1); {38049#unseeded} is VALID [2022-02-21 04:20:17,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:17,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:17,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:17,969 INFO L272 TraceCheckUtils]: 10: Hoare triple {38049#unseeded} call #t~ret6 := fibo1(~n - 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,971 INFO L272 TraceCheckUtils]: 14: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,972 INFO L272 TraceCheckUtils]: 18: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,974 INFO L272 TraceCheckUtils]: 22: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,976 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,976 INFO L272 TraceCheckUtils]: 28: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,978 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,979 INFO L290 TraceCheckUtils]: 34: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,979 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,980 INFO L272 TraceCheckUtils]: 36: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,980 INFO L290 TraceCheckUtils]: 37: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,980 INFO L290 TraceCheckUtils]: 38: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,981 INFO L290 TraceCheckUtils]: 39: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,981 INFO L290 TraceCheckUtils]: 40: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,982 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,982 INFO L290 TraceCheckUtils]: 42: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,983 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,984 INFO L272 TraceCheckUtils]: 45: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,986 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,992 INFO L290 TraceCheckUtils]: 51: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:17,994 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {39113#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {38049#unseeded} #46#return; {38049#unseeded} is VALID [2022-02-21 04:20:17,994 INFO L272 TraceCheckUtils]: 54: Hoare triple {38049#unseeded} call #t~ret7 := fibo1(~n - 2); {38049#unseeded} is VALID [2022-02-21 04:20:17,994 INFO L290 TraceCheckUtils]: 55: Hoare triple {38049#unseeded} ~n := #in~n; {38049#unseeded} is VALID [2022-02-21 04:20:17,995 INFO L290 TraceCheckUtils]: 56: Hoare triple {38049#unseeded} assume !(~n < 1); {38049#unseeded} is VALID [2022-02-21 04:20:17,995 INFO L290 TraceCheckUtils]: 57: Hoare triple {38049#unseeded} assume !(1 == ~n); {38049#unseeded} is VALID [2022-02-21 04:20:17,995 INFO L272 TraceCheckUtils]: 58: Hoare triple {38049#unseeded} call #t~ret4 := fibo2(~n - 1); {38049#unseeded} is VALID [2022-02-21 04:20:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:20:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:18,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:18,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {38052#(>= oldRank0 |fibo2_#in~n|)} ~n := #in~n; {39258#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:18,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {39258#(<= fibo2_~n oldRank0)} assume !(~n < 1); {39258#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:18,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {39258#(<= fibo2_~n oldRank0)} assume !(1 == ~n); {39258#(<= fibo2_~n oldRank0)} is VALID [2022-02-21 04:20:18,099 INFO L272 TraceCheckUtils]: 3: Hoare triple {39258#(<= fibo2_~n oldRank0)} call #t~ret6 := fibo1(~n - 1); {39268#(<= (+ |fibo1_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:20:18,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {39268#(<= (+ |fibo1_#in~n| 1) oldRank0)} ~n := #in~n; {39272#(<= (+ fibo1_~n 1) oldRank0)} is VALID [2022-02-21 04:20:18,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {39272#(<= (+ fibo1_~n 1) oldRank0)} assume !(~n < 1); {39276#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:18,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {39276#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {39276#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:18,100 INFO L272 TraceCheckUtils]: 7: Hoare triple {39276#(and (<= (+ fibo1_~n 1) oldRank0) (not (< fibo1_~n 1)))} call #t~ret4 := fibo2(~n - 1); {38062#(or unseeded (and (>= oldRank0 0) (> oldRank0 |fibo2_#in~n|)))} is VALID [2022-02-21 04:20:18,100 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 04:20:18,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:18,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:18,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,129 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 5 loop predicates [2022-02-21 04:20:18,129 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 261 states and 293 transitions. cyclomatic complexity: 35 Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:18,380 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 261 states and 293 transitions. cyclomatic complexity: 35. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 410 states and 449 transitions. Complement of second has 27 states. [2022-02-21 04:20:18,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:18,381 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:18,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 261 states and 293 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:18,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:18,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:18,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:18,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:18,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:18,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:18,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 410 states and 449 transitions. [2022-02-21 04:20:18,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-02-21 04:20:18,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:18,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:18,384 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 261 states and 293 transitions. cyclomatic complexity: 35 [2022-02-21 04:20:18,384 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:20:18,384 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:18,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:18,384 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:18,384 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 410 states and 449 transitions. cyclomatic complexity: 42 [2022-02-21 04:20:18,385 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:18,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:18,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:18,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:18,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:18,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:18,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:18,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 410 letters. Loop has 410 letters. [2022-02-21 04:20:18,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 410 letters. Loop has 410 letters. [2022-02-21 04:20:18,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 410 letters. Loop has 410 letters. [2022-02-21 04:20:18,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:18,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:18,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 261 letters. Loop has 261 letters. [2022-02-21 04:20:18,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:18,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:18,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:18,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:18,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:18,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:18,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:18,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:18,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 64 letters. Loop has 8 letters. [2022-02-21 04:20:18,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:18,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:18,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 62 letters. Loop has 8 letters. [2022-02-21 04:20:18,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:18,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:18,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 60 letters. Loop has 8 letters. [2022-02-21 04:20:18,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:18,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:18,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 63 letters. Loop has 8 letters. [2022-02-21 04:20:18,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:18,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:18,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 66 letters. Loop has 8 letters. [2022-02-21 04:20:18,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:18,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:18,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 65 letters. Loop has 8 letters. [2022-02-21 04:20:18,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:18,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:18,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:18,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 261 states and 293 transitions. cyclomatic complexity: 35 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 410 states and 449 transitions. cyclomatic complexity: 42 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:18,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,395 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-02-21 04:20:18,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 59 letters. Loop has 8 letters. [2022-02-21 04:20:18,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 67 letters. Loop has 8 letters. [2022-02-21 04:20:18,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 59 letters. Loop has 16 letters. [2022-02-21 04:20:18,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:18,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 410 states and 449 transitions. cyclomatic complexity: 42 [2022-02-21 04:20:18,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-02-21 04:20:18,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 410 states to 287 states and 318 transitions. [2022-02-21 04:20:18,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2022-02-21 04:20:18,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2022-02-21 04:20:18,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 318 transitions. [2022-02-21 04:20:18,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:18,412 INFO L681 BuchiCegarLoop]: Abstraction has 287 states and 318 transitions. [2022-02-21 04:20:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 318 transitions. [2022-02-21 04:20:18,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 266. [2022-02-21 04:20:18,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:18,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states and 318 transitions. Second operand has 266 states, 179 states have (on average 1.094972067039106) internal successors, (196), 191 states have internal predecessors, (196), 48 states have call successors, (52), 39 states have call predecessors, (52), 39 states have return successors, (48), 35 states have call predecessors, (48), 39 states have call successors, (48) [2022-02-21 04:20:18,416 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states and 318 transitions. Second operand has 266 states, 179 states have (on average 1.094972067039106) internal successors, (196), 191 states have internal predecessors, (196), 48 states have call successors, (52), 39 states have call predecessors, (52), 39 states have return successors, (48), 35 states have call predecessors, (48), 39 states have call successors, (48) [2022-02-21 04:20:18,417 INFO L87 Difference]: Start difference. First operand 287 states and 318 transitions. Second operand has 266 states, 179 states have (on average 1.094972067039106) internal successors, (196), 191 states have internal predecessors, (196), 48 states have call successors, (52), 39 states have call predecessors, (52), 39 states have return successors, (48), 35 states have call predecessors, (48), 39 states have call successors, (48) [2022-02-21 04:20:18,417 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:18,426 INFO L93 Difference]: Finished difference Result 435 states and 495 transitions. [2022-02-21 04:20:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 495 transitions. [2022-02-21 04:20:18,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:18,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:18,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 266 states, 179 states have (on average 1.094972067039106) internal successors, (196), 191 states have internal predecessors, (196), 48 states have call successors, (52), 39 states have call predecessors, (52), 39 states have return successors, (48), 35 states have call predecessors, (48), 39 states have call successors, (48) Second operand 287 states and 318 transitions. [2022-02-21 04:20:18,428 INFO L87 Difference]: Start difference. First operand has 266 states, 179 states have (on average 1.094972067039106) internal successors, (196), 191 states have internal predecessors, (196), 48 states have call successors, (52), 39 states have call predecessors, (52), 39 states have return successors, (48), 35 states have call predecessors, (48), 39 states have call successors, (48) Second operand 287 states and 318 transitions. [2022-02-21 04:20:18,429 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:18,438 INFO L93 Difference]: Finished difference Result 443 states and 505 transitions. [2022-02-21 04:20:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 505 transitions. [2022-02-21 04:20:18,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:18,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:18,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:18,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 179 states have (on average 1.094972067039106) internal successors, (196), 191 states have internal predecessors, (196), 48 states have call successors, (52), 39 states have call predecessors, (52), 39 states have return successors, (48), 35 states have call predecessors, (48), 39 states have call successors, (48) [2022-02-21 04:20:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 296 transitions. [2022-02-21 04:20:18,443 INFO L704 BuchiCegarLoop]: Abstraction has 266 states and 296 transitions. [2022-02-21 04:20:18,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:18,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-21 04:20:18,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-02-21 04:20:18,443 INFO L87 Difference]: Start difference. First operand 266 states and 296 transitions. Second operand has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 11 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-21 04:20:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:19,509 INFO L93 Difference]: Finished difference Result 315 states and 364 transitions. [2022-02-21 04:20:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 04:20:19,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 11 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-21 04:20:19,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:19,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 364 transitions. [2022-02-21 04:20:19,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:19,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 289 states and 332 transitions. [2022-02-21 04:20:19,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2022-02-21 04:20:19,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2022-02-21 04:20:19,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 332 transitions. [2022-02-21 04:20:19,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:20:19,577 INFO L681 BuchiCegarLoop]: Abstraction has 289 states and 332 transitions. [2022-02-21 04:20:19,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 332 transitions. [2022-02-21 04:20:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 264. [2022-02-21 04:20:19,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:20:19,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states and 332 transitions. Second operand has 264 states, 176 states have (on average 1.0965909090909092) internal successors, (193), 188 states have internal predecessors, (193), 50 states have call successors, (53), 39 states have call predecessors, (53), 38 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53) [2022-02-21 04:20:19,580 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states and 332 transitions. Second operand has 264 states, 176 states have (on average 1.0965909090909092) internal successors, (193), 188 states have internal predecessors, (193), 50 states have call successors, (53), 39 states have call predecessors, (53), 38 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53) [2022-02-21 04:20:19,581 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand has 264 states, 176 states have (on average 1.0965909090909092) internal successors, (193), 188 states have internal predecessors, (193), 50 states have call successors, (53), 39 states have call predecessors, (53), 38 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53) [2022-02-21 04:20:19,581 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:19,590 INFO L93 Difference]: Finished difference Result 491 states and 568 transitions. [2022-02-21 04:20:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 568 transitions. [2022-02-21 04:20:19,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:19,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:19,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 176 states have (on average 1.0965909090909092) internal successors, (193), 188 states have internal predecessors, (193), 50 states have call successors, (53), 39 states have call predecessors, (53), 38 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53) Second operand 289 states and 332 transitions. [2022-02-21 04:20:19,593 INFO L87 Difference]: Start difference. First operand has 264 states, 176 states have (on average 1.0965909090909092) internal successors, (193), 188 states have internal predecessors, (193), 50 states have call successors, (53), 39 states have call predecessors, (53), 38 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53) Second operand 289 states and 332 transitions. [2022-02-21 04:20:19,593 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:20:19,604 INFO L93 Difference]: Finished difference Result 523 states and 611 transitions. [2022-02-21 04:20:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 611 transitions. [2022-02-21 04:20:19,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:20:19,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:20:19,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:20:19,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:20:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 176 states have (on average 1.0965909090909092) internal successors, (193), 188 states have internal predecessors, (193), 50 states have call successors, (53), 39 states have call predecessors, (53), 38 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53) [2022-02-21 04:20:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 299 transitions. [2022-02-21 04:20:19,609 INFO L704 BuchiCegarLoop]: Abstraction has 264 states and 299 transitions. [2022-02-21 04:20:19,609 INFO L587 BuchiCegarLoop]: Abstraction has 264 states and 299 transitions. [2022-02-21 04:20:19,609 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 04:20:19,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 299 transitions. [2022-02-21 04:20:19,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:19,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:19,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:19,610 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:19,610 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:20:19,611 INFO L791 eck$LassoCheckResult]: Stem: 41914#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 41915#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; 41947#L39 call main_#t~ret8#1 := fibo1(main_~x~0#1);< 41972#fibo1ENTRY ~n := #in~n; 42085#L10 assume !(~n < 1); 42082#L12 assume !(1 == ~n); 42061#L15 call #t~ret4 := fibo2(~n - 1);< 42076#fibo2ENTRY ~n := #in~n; 42067#L20 assume !(~n < 1); 42064#L22 assume !(1 == ~n); 42059#L25 call #t~ret6 := fibo1(~n - 1);< 42062#fibo1ENTRY ~n := #in~n; 42084#L10 assume !(~n < 1); 42081#L12 assume !(1 == ~n); 42078#L15 call #t~ret4 := fibo2(~n - 1);< 42079#fibo2ENTRY ~n := #in~n; 42097#L20 assume !(~n < 1); 42094#L22 assume !(1 == ~n); 41965#L25 call #t~ret6 := fibo1(~n - 1);< 42091#fibo1ENTRY ~n := #in~n; 42149#L10 assume !(~n < 1); 42014#L12 assume !(1 == ~n); 41964#L15 call #t~ret4 := fibo2(~n - 1);< 41966#fibo2ENTRY ~n := #in~n; 42106#L20 assume !(~n < 1); 42105#L22 assume 1 == ~n;#res := 1; 42104#fibo2FINAL assume true; 42102#fibo2EXIT >#50#return; 42099#L15-1 call #t~ret5 := fibo2(~n - 2);< 42100#fibo2ENTRY ~n := #in~n; 42103#L20 assume ~n < 1;#res := 0; 42101#fibo2FINAL assume true; 42098#fibo2EXIT >#52#return; 42096#L15-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 42093#fibo1FINAL assume true; 42090#fibo1EXIT >#46#return; 42087#L25-1 call #t~ret7 := fibo1(~n - 2);< 42088#fibo1ENTRY ~n := #in~n; 42095#L10 assume !(~n < 1); 42092#L12 assume 1 == ~n;#res := 1; 42089#fibo1FINAL assume true; 42086#fibo1EXIT >#48#return; 42083#L25-2 #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; 42080#fibo2FINAL assume true; 42077#fibo2EXIT >#50#return; 42070#L15-1 call #t~ret5 := fibo2(~n - 2);< 42075#fibo2ENTRY ~n := #in~n; 42146#L20 assume !(~n < 1); 42161#L22 assume !(1 == ~n); 41953#L25 call #t~ret6 := fibo1(~n - 1);< 42157#fibo1ENTRY ~n := #in~n; 42174#L10 assume !(~n < 1); 42173#L12 assume !(1 == ~n); 41933#L15 call #t~ret4 := fibo2(~n - 1);< 41967#fibo2ENTRY ~n := #in~n; 42041#L20 assume !(~n < 1); 42042#L22 assume !(1 == ~n); 42027#L25 call #t~ret6 := fibo1(~n - 1);< 42037#fibo1ENTRY ~n := #in~n; 42035#L10 assume !(~n < 1); 42033#L12 assume !(1 == ~n); 42030#L15 [2022-02-21 04:20:19,611 INFO L793 eck$LassoCheckResult]: Loop: 42030#L15 call #t~ret4 := fibo2(~n - 1);< 42031#fibo2ENTRY ~n := #in~n; 42041#L20 assume !(~n < 1); 42042#L22 assume !(1 == ~n); 42027#L25 call #t~ret6 := fibo1(~n - 1);< 42037#fibo1ENTRY ~n := #in~n; 42035#L10 assume !(~n < 1); 42033#L12 assume !(1 == ~n); 42030#L15 [2022-02-21 04:20:19,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:19,611 INFO L85 PathProgramCache]: Analyzing trace with hash 78940933, now seen corresponding path program 2 times [2022-02-21 04:20:19,611 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:19,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893365301] [2022-02-21 04:20:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:19,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 04:20:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 04:20:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:19,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:19,727 INFO L290 TraceCheckUtils]: 3: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,727 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {44035#true} {44035#true} #50#return; {44035#true} is VALID [2022-02-21 04:20:19,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 04:20:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume ~n < 1;#res := 0; {44035#true} is VALID [2022-02-21 04:20:19,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44035#true} {44035#true} #52#return; {44035#true} is VALID [2022-02-21 04:20:19,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:19,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:19,730 INFO L272 TraceCheckUtils]: 3: Hoare triple {44035#true} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:19,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:19,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:19,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,731 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {44035#true} {44035#true} #50#return; {44035#true} is VALID [2022-02-21 04:20:19,731 INFO L272 TraceCheckUtils]: 9: Hoare triple {44035#true} call #t~ret5 := fibo2(~n - 2); {44035#true} is VALID [2022-02-21 04:20:19,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {44035#true} assume ~n < 1;#res := 0; {44035#true} is VALID [2022-02-21 04:20:19,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,731 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {44035#true} {44035#true} #52#return; {44035#true} is VALID [2022-02-21 04:20:19,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {44035#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44035#true} is VALID [2022-02-21 04:20:19,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,731 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44035#true} {44035#true} #46#return; {44035#true} is VALID [2022-02-21 04:20:19,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-21 04:20:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:19,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:19,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,734 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {44035#true} {44035#true} #48#return; {44035#true} is VALID [2022-02-21 04:20:19,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:19,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:19,735 INFO L272 TraceCheckUtils]: 3: Hoare triple {44035#true} call #t~ret6 := fibo1(~n - 1); {44035#true} is VALID [2022-02-21 04:20:19,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:19,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:19,735 INFO L272 TraceCheckUtils]: 7: Hoare triple {44035#true} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:19,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:19,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:19,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,736 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {44035#true} {44035#true} #50#return; {44035#true} is VALID [2022-02-21 04:20:19,736 INFO L272 TraceCheckUtils]: 13: Hoare triple {44035#true} call #t~ret5 := fibo2(~n - 2); {44035#true} is VALID [2022-02-21 04:20:19,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {44035#true} assume ~n < 1;#res := 0; {44035#true} is VALID [2022-02-21 04:20:19,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,736 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {44035#true} {44035#true} #52#return; {44035#true} is VALID [2022-02-21 04:20:19,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {44035#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44035#true} is VALID [2022-02-21 04:20:19,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,736 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44035#true} {44035#true} #46#return; {44035#true} is VALID [2022-02-21 04:20:19,737 INFO L272 TraceCheckUtils]: 21: Hoare triple {44035#true} call #t~ret7 := fibo1(~n - 2); {44035#true} is VALID [2022-02-21 04:20:19,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:19,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:19,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,737 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44035#true} {44035#true} #48#return; {44035#true} is VALID [2022-02-21 04:20:19,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {44035#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {44035#true} is VALID [2022-02-21 04:20:19,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,738 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {44035#true} {44043#(<= fibo1_~n 4)} #50#return; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:19,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {44035#true} is VALID [2022-02-21 04:20:19,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {44037#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:19,739 INFO L272 TraceCheckUtils]: 2: Hoare triple {44037#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {44038#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:19,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {44038#(<= |fibo1_#in~n| 6)} ~n := #in~n; {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:19,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {44039#(<= fibo1_~n 6)} assume !(~n < 1); {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:19,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {44039#(<= fibo1_~n 6)} assume !(1 == ~n); {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:19,740 INFO L272 TraceCheckUtils]: 6: Hoare triple {44039#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {44040#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:19,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {44040#(<= |fibo2_#in~n| 5)} ~n := #in~n; {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:19,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {44041#(<= fibo2_~n 5)} assume !(~n < 1); {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:19,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {44041#(<= fibo2_~n 5)} assume !(1 == ~n); {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:19,741 INFO L272 TraceCheckUtils]: 10: Hoare triple {44041#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {44042#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:19,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {44042#(<= |fibo1_#in~n| 4)} ~n := #in~n; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:19,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {44043#(<= fibo1_~n 4)} assume !(~n < 1); {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:19,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {44043#(<= fibo1_~n 4)} assume !(1 == ~n); {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:19,742 INFO L272 TraceCheckUtils]: 14: Hoare triple {44043#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:19,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:19,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:19,743 INFO L272 TraceCheckUtils]: 18: Hoare triple {44035#true} call #t~ret6 := fibo1(~n - 1); {44035#true} is VALID [2022-02-21 04:20:19,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:19,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:19,743 INFO L272 TraceCheckUtils]: 22: Hoare triple {44035#true} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:19,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:19,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:19,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,744 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {44035#true} {44035#true} #50#return; {44035#true} is VALID [2022-02-21 04:20:19,744 INFO L272 TraceCheckUtils]: 28: Hoare triple {44035#true} call #t~ret5 := fibo2(~n - 2); {44035#true} is VALID [2022-02-21 04:20:19,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {44035#true} assume ~n < 1;#res := 0; {44035#true} is VALID [2022-02-21 04:20:19,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,744 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44035#true} {44035#true} #52#return; {44035#true} is VALID [2022-02-21 04:20:19,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {44035#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44035#true} is VALID [2022-02-21 04:20:19,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,744 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {44035#true} {44035#true} #46#return; {44035#true} is VALID [2022-02-21 04:20:19,745 INFO L272 TraceCheckUtils]: 36: Hoare triple {44035#true} call #t~ret7 := fibo1(~n - 2); {44035#true} is VALID [2022-02-21 04:20:19,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:19,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:19,745 INFO L290 TraceCheckUtils]: 39: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:19,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,745 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {44035#true} {44035#true} #48#return; {44035#true} is VALID [2022-02-21 04:20:19,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {44035#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {44035#true} is VALID [2022-02-21 04:20:19,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:19,746 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44035#true} {44043#(<= fibo1_~n 4)} #50#return; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:19,746 INFO L272 TraceCheckUtils]: 45: Hoare triple {44043#(<= fibo1_~n 4)} call #t~ret5 := fibo2(~n - 2); {44074#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:19,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {44074#(<= |fibo2_#in~n| 2)} ~n := #in~n; {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:19,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {44075#(<= fibo2_~n 2)} assume !(~n < 1); {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:19,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {44075#(<= fibo2_~n 2)} assume !(1 == ~n); {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:19,747 INFO L272 TraceCheckUtils]: 49: Hoare triple {44075#(<= fibo2_~n 2)} call #t~ret6 := fibo1(~n - 1); {44076#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:19,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {44076#(<= |fibo1_#in~n| 1)} ~n := #in~n; {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:19,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {44077#(<= fibo1_~n 1)} assume !(~n < 1); {44078#(and (<= fibo1_~n 1) (< 0 fibo1_~n))} is VALID [2022-02-21 04:20:19,748 INFO L290 TraceCheckUtils]: 52: Hoare triple {44078#(and (<= fibo1_~n 1) (< 0 fibo1_~n))} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:19,748 INFO L272 TraceCheckUtils]: 53: Hoare triple {44036#false} call #t~ret4 := fibo2(~n - 1); {44036#false} is VALID [2022-02-21 04:20:19,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {44036#false} ~n := #in~n; {44036#false} is VALID [2022-02-21 04:20:19,749 INFO L290 TraceCheckUtils]: 55: Hoare triple {44036#false} assume !(~n < 1); {44036#false} is VALID [2022-02-21 04:20:19,749 INFO L290 TraceCheckUtils]: 56: Hoare triple {44036#false} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:19,749 INFO L272 TraceCheckUtils]: 57: Hoare triple {44036#false} call #t~ret6 := fibo1(~n - 1); {44036#false} is VALID [2022-02-21 04:20:19,749 INFO L290 TraceCheckUtils]: 58: Hoare triple {44036#false} ~n := #in~n; {44036#false} is VALID [2022-02-21 04:20:19,749 INFO L290 TraceCheckUtils]: 59: Hoare triple {44036#false} assume !(~n < 1); {44036#false} is VALID [2022-02-21 04:20:19,749 INFO L290 TraceCheckUtils]: 60: Hoare triple {44036#false} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 04:20:19,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:20:19,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893365301] [2022-02-21 04:20:19,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893365301] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 04:20:19,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986473730] [2022-02-21 04:20:19,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 04:20:19,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 04:20:19,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:19,750 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 04:20:19,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-02-21 04:20:19,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 04:20:19,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 04:20:19,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 04:20:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:19,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:20,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {44035#true} is VALID [2022-02-21 04:20:20,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {44037#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:20,024 INFO L272 TraceCheckUtils]: 2: Hoare triple {44037#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {44038#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:20,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {44038#(<= |fibo1_#in~n| 6)} ~n := #in~n; {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:20,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {44039#(<= fibo1_~n 6)} assume !(~n < 1); {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:20,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {44039#(<= fibo1_~n 6)} assume !(1 == ~n); {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:20,025 INFO L272 TraceCheckUtils]: 6: Hoare triple {44039#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {44040#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:20,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {44040#(<= |fibo2_#in~n| 5)} ~n := #in~n; {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:20,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {44041#(<= fibo2_~n 5)} assume !(~n < 1); {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:20,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {44041#(<= fibo2_~n 5)} assume !(1 == ~n); {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:20,027 INFO L272 TraceCheckUtils]: 10: Hoare triple {44041#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {44042#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:20,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {44042#(<= |fibo1_#in~n| 4)} ~n := #in~n; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:20,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {44043#(<= fibo1_~n 4)} assume !(~n < 1); {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:20,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {44043#(<= fibo1_~n 4)} assume !(1 == ~n); {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:20,028 INFO L272 TraceCheckUtils]: 14: Hoare triple {44043#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:20,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:20,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:20,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:20,028 INFO L272 TraceCheckUtils]: 18: Hoare triple {44035#true} call #t~ret6 := fibo1(~n - 1); {44035#true} is VALID [2022-02-21 04:20:20,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:20,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:20,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:20,029 INFO L272 TraceCheckUtils]: 22: Hoare triple {44035#true} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:20,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:20,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:20,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:20,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:20,029 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {44035#true} {44035#true} #50#return; {44035#true} is VALID [2022-02-21 04:20:20,029 INFO L272 TraceCheckUtils]: 28: Hoare triple {44035#true} call #t~ret5 := fibo2(~n - 2); {44035#true} is VALID [2022-02-21 04:20:20,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:20,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {44035#true} assume ~n < 1;#res := 0; {44035#true} is VALID [2022-02-21 04:20:20,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:20,030 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44035#true} {44035#true} #52#return; {44035#true} is VALID [2022-02-21 04:20:20,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {44035#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44035#true} is VALID [2022-02-21 04:20:20,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:20,030 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {44035#true} {44035#true} #46#return; {44035#true} is VALID [2022-02-21 04:20:20,030 INFO L272 TraceCheckUtils]: 36: Hoare triple {44035#true} call #t~ret7 := fibo1(~n - 2); {44035#true} is VALID [2022-02-21 04:20:20,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:20,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:20,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:20,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:20,031 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {44035#true} {44035#true} #48#return; {44035#true} is VALID [2022-02-21 04:20:20,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {44035#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {44035#true} is VALID [2022-02-21 04:20:20,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:20,032 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44035#true} {44043#(<= fibo1_~n 4)} #50#return; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:20,032 INFO L272 TraceCheckUtils]: 45: Hoare triple {44043#(<= fibo1_~n 4)} call #t~ret5 := fibo2(~n - 2); {44074#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:20,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {44074#(<= |fibo2_#in~n| 2)} ~n := #in~n; {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:20,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {44075#(<= fibo2_~n 2)} assume !(~n < 1); {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:20,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {44075#(<= fibo2_~n 2)} assume !(1 == ~n); {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:20,034 INFO L272 TraceCheckUtils]: 49: Hoare triple {44075#(<= fibo2_~n 2)} call #t~ret6 := fibo1(~n - 1); {44076#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:20,034 INFO L290 TraceCheckUtils]: 50: Hoare triple {44076#(<= |fibo1_#in~n| 1)} ~n := #in~n; {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:20,035 INFO L290 TraceCheckUtils]: 51: Hoare triple {44077#(<= fibo1_~n 1)} assume !(~n < 1); {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:20,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {44077#(<= fibo1_~n 1)} assume !(1 == ~n); {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:20,035 INFO L272 TraceCheckUtils]: 53: Hoare triple {44077#(<= fibo1_~n 1)} call #t~ret4 := fibo2(~n - 1); {44272#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:20:20,036 INFO L290 TraceCheckUtils]: 54: Hoare triple {44272#(<= |fibo2_#in~n| 0)} ~n := #in~n; {44276#(<= fibo2_~n 0)} is VALID [2022-02-21 04:20:20,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {44276#(<= fibo2_~n 0)} assume !(~n < 1); {44036#false} is VALID [2022-02-21 04:20:20,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {44036#false} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:20,036 INFO L272 TraceCheckUtils]: 57: Hoare triple {44036#false} call #t~ret6 := fibo1(~n - 1); {44036#false} is VALID [2022-02-21 04:20:20,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {44036#false} ~n := #in~n; {44036#false} is VALID [2022-02-21 04:20:20,037 INFO L290 TraceCheckUtils]: 59: Hoare triple {44036#false} assume !(~n < 1); {44036#false} is VALID [2022-02-21 04:20:20,037 INFO L290 TraceCheckUtils]: 60: Hoare triple {44036#false} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 04:20:20,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 04:20:20,290 INFO L290 TraceCheckUtils]: 60: Hoare triple {44036#false} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:20,290 INFO L290 TraceCheckUtils]: 59: Hoare triple {44036#false} assume !(~n < 1); {44036#false} is VALID [2022-02-21 04:20:20,290 INFO L290 TraceCheckUtils]: 58: Hoare triple {44036#false} ~n := #in~n; {44036#false} is VALID [2022-02-21 04:20:20,290 INFO L272 TraceCheckUtils]: 57: Hoare triple {44036#false} call #t~ret6 := fibo1(~n - 1); {44036#false} is VALID [2022-02-21 04:20:20,290 INFO L290 TraceCheckUtils]: 56: Hoare triple {44036#false} assume !(1 == ~n); {44036#false} is VALID [2022-02-21 04:20:20,291 INFO L290 TraceCheckUtils]: 55: Hoare triple {44276#(<= fibo2_~n 0)} assume !(~n < 1); {44036#false} is VALID [2022-02-21 04:20:20,291 INFO L290 TraceCheckUtils]: 54: Hoare triple {44272#(<= |fibo2_#in~n| 0)} ~n := #in~n; {44276#(<= fibo2_~n 0)} is VALID [2022-02-21 04:20:20,292 INFO L272 TraceCheckUtils]: 53: Hoare triple {44077#(<= fibo1_~n 1)} call #t~ret4 := fibo2(~n - 1); {44272#(<= |fibo2_#in~n| 0)} is VALID [2022-02-21 04:20:20,292 INFO L290 TraceCheckUtils]: 52: Hoare triple {44077#(<= fibo1_~n 1)} assume !(1 == ~n); {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:20,292 INFO L290 TraceCheckUtils]: 51: Hoare triple {44077#(<= fibo1_~n 1)} assume !(~n < 1); {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:20,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {44076#(<= |fibo1_#in~n| 1)} ~n := #in~n; {44077#(<= fibo1_~n 1)} is VALID [2022-02-21 04:20:20,293 INFO L272 TraceCheckUtils]: 49: Hoare triple {44075#(<= fibo2_~n 2)} call #t~ret6 := fibo1(~n - 1); {44076#(<= |fibo1_#in~n| 1)} is VALID [2022-02-21 04:20:20,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {44075#(<= fibo2_~n 2)} assume !(1 == ~n); {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:20,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {44075#(<= fibo2_~n 2)} assume !(~n < 1); {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:20,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {44074#(<= |fibo2_#in~n| 2)} ~n := #in~n; {44075#(<= fibo2_~n 2)} is VALID [2022-02-21 04:20:20,294 INFO L272 TraceCheckUtils]: 45: Hoare triple {44043#(<= fibo1_~n 4)} call #t~ret5 := fibo2(~n - 2); {44074#(<= |fibo2_#in~n| 2)} is VALID [2022-02-21 04:20:20,295 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44035#true} {44043#(<= fibo1_~n 4)} #50#return; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:20,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:20,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {44035#true} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {44035#true} is VALID [2022-02-21 04:20:20,295 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {44035#true} {44035#true} #48#return; {44035#true} is VALID [2022-02-21 04:20:20,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:20,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:20,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:20,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:20,295 INFO L272 TraceCheckUtils]: 36: Hoare triple {44035#true} call #t~ret7 := fibo1(~n - 2); {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {44035#true} {44035#true} #46#return; {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {44035#true} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44035#true} {44035#true} #52#return; {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {44035#true} assume ~n < 1;#res := 0; {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L272 TraceCheckUtils]: 28: Hoare triple {44035#true} call #t~ret5 := fibo2(~n - 2); {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {44035#true} {44035#true} #50#return; {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {44035#true} assume true; {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {44035#true} assume 1 == ~n;#res := 1; {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L272 TraceCheckUtils]: 22: Hoare triple {44035#true} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L272 TraceCheckUtils]: 18: Hoare triple {44035#true} call #t~ret6 := fibo1(~n - 1); {44035#true} is VALID [2022-02-21 04:20:20,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {44035#true} assume !(1 == ~n); {44035#true} is VALID [2022-02-21 04:20:20,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {44035#true} assume !(~n < 1); {44035#true} is VALID [2022-02-21 04:20:20,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {44035#true} ~n := #in~n; {44035#true} is VALID [2022-02-21 04:20:20,297 INFO L272 TraceCheckUtils]: 14: Hoare triple {44043#(<= fibo1_~n 4)} call #t~ret4 := fibo2(~n - 1); {44035#true} is VALID [2022-02-21 04:20:20,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {44043#(<= fibo1_~n 4)} assume !(1 == ~n); {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:20,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {44043#(<= fibo1_~n 4)} assume !(~n < 1); {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:20,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {44042#(<= |fibo1_#in~n| 4)} ~n := #in~n; {44043#(<= fibo1_~n 4)} is VALID [2022-02-21 04:20:20,302 INFO L272 TraceCheckUtils]: 10: Hoare triple {44041#(<= fibo2_~n 5)} call #t~ret6 := fibo1(~n - 1); {44042#(<= |fibo1_#in~n| 4)} is VALID [2022-02-21 04:20:20,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {44041#(<= fibo2_~n 5)} assume !(1 == ~n); {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:20,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {44041#(<= fibo2_~n 5)} assume !(~n < 1); {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:20,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {44040#(<= |fibo2_#in~n| 5)} ~n := #in~n; {44041#(<= fibo2_~n 5)} is VALID [2022-02-21 04:20:20,303 INFO L272 TraceCheckUtils]: 6: Hoare triple {44039#(<= fibo1_~n 6)} call #t~ret4 := fibo2(~n - 1); {44040#(<= |fibo2_#in~n| 5)} is VALID [2022-02-21 04:20:20,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {44039#(<= fibo1_~n 6)} assume !(1 == ~n); {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:20,304 INFO L290 TraceCheckUtils]: 4: Hoare triple {44039#(<= fibo1_~n 6)} assume !(~n < 1); {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:20,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {44038#(<= |fibo1_#in~n| 6)} ~n := #in~n; {44039#(<= fibo1_~n 6)} is VALID [2022-02-21 04:20:20,304 INFO L272 TraceCheckUtils]: 2: Hoare triple {44037#(<= |ULTIMATE.start_main_~x~0#1| 6)} call main_#t~ret8#1 := fibo1(main_~x~0#1); {44038#(<= |fibo1_#in~n| 6)} is VALID [2022-02-21 04:20:20,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {44035#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {44037#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 04:20:20,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {44035#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {44035#true} is VALID [2022-02-21 04:20:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 65 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-21 04:20:20,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986473730] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 04:20:20,305 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 04:20:20,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 16 [2022-02-21 04:20:20,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051935379] [2022-02-21 04:20:20,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 04:20:20,306 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:20:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash 519237434, now seen corresponding path program 4 times [2022-02-21 04:20:20,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:20:20,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338231892] [2022-02-21 04:20:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:20:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:20:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:20,313 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:20:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:20:20,314 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:20:20,463 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:20,463 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:20,463 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:20,463 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:20,463 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:20:20,463 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:20,463 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:20,463 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:20,463 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-1.c_Iteration9_Loop [2022-02-21 04:20:20,463 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:20,463 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:20,464 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 04:20:20,468 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 04:20:20,469 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 04:20:20,475 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 04:20:20,477 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 04:20:20,478 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 04:20:20,480 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 04:20:20,481 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 04:20:20,483 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 04:20:20,552 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:20,553 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:20:20,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:20,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:20,554 INFO L229 MonitoredProcess]: Starting monitored process 75 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 04:20:20,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-02-21 04:20:20,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:20,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:20,567 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:20,567 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo1_#res=0} Honda state: {fibo1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:20,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:20,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:20,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:20,583 INFO L229 MonitoredProcess]: Starting monitored process 76 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 04:20:20,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-02-21 04:20:20,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:20,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:20,592 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:20:20,592 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo2_#res=0} Honda state: {fibo2_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:20:20,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-02-21 04:20:20,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:20,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:20,608 INFO L229 MonitoredProcess]: Starting monitored process 77 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 04:20:20,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-02-21 04:20:20,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:20:20,610 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:20,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-02-21 04:20:20,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:20,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:20,638 INFO L229 MonitoredProcess]: Starting monitored process 78 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 04:20:20,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-02-21 04:20:20,640 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:20:20,640 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:20:22,041 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:20:22,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-02-21 04:20:22,045 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:20:22,045 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:20:22,045 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:20:22,045 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:20:22,045 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:20:22,045 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:22,045 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:20:22,045 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:20:22,045 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibo_2calls_6-1.c_Iteration9_Loop [2022-02-21 04:20:22,045 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:20:22,045 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:20:22,046 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 04:20:22,048 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 04:20:22,050 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 04:20:22,056 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 04:20:22,058 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 04:20:22,059 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 04:20:22,061 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 04:20:22,062 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 04:20:22,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:20:22,142 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:20:22,142 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:20:22,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:22,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:22,144 INFO L229 MonitoredProcess]: Starting monitored process 79 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 04:20:22,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-02-21 04:20:22,146 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 04:20:22,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:22,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:22,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:22,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:22,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:22,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:22,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:22,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:22,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-02-21 04:20:22,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:22,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:22,169 INFO L229 MonitoredProcess]: Starting monitored process 80 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 04:20:22,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-02-21 04:20:22,171 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 04:20:22,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:22,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:22,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:22,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:22,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:22,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:22,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:22,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:20:22,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-02-21 04:20:22,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:22,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:22,194 INFO L229 MonitoredProcess]: Starting monitored process 81 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 04:20:22,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-02-21 04:20:22,196 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 04:20:22,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:20:22,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:20:22,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:20:22,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:20:22,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:20:22,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:20:22,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:20:22,203 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:20:22,205 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:20:22,205 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:20:22,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:20:22,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:20:22,206 INFO L229 MonitoredProcess]: Starting monitored process 82 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 04:20:22,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-02-21 04:20:22,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:20:22,208 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:20:22,208 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:20:22,208 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo1_~n) = 1*fibo1_~n Supporting invariants [] [2022-02-21 04:20:22,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-02-21 04:20:22,226 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:20:22,228 INFO L390 LassoCheck]: Loop: "call #t~ret4 := fibo2(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" "call #t~ret6 := fibo1(~n - 1);"< "~n := #in~n;" "assume !(~n < 1);" "assume !(1 == ~n);" [2022-02-21 04:20:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:22,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:22,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 04:20:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:22,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:22,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {44474#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {44474#unseeded} is VALID [2022-02-21 04:20:22,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {44474#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {44474#unseeded} is VALID [2022-02-21 04:20:22,665 INFO L272 TraceCheckUtils]: 2: Hoare triple {44474#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {44474#unseeded} is VALID [2022-02-21 04:20:22,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:22,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:22,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:22,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:22,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:22,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:22,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:22,668 INFO L272 TraceCheckUtils]: 10: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:22,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:22,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:22,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:22,669 INFO L272 TraceCheckUtils]: 14: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,671 INFO L272 TraceCheckUtils]: 18: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,673 INFO L272 TraceCheckUtils]: 22: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,675 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,676 INFO L272 TraceCheckUtils]: 28: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,678 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,679 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,680 INFO L272 TraceCheckUtils]: 36: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,682 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:22,683 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44534#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44474#unseeded} #50#return; {44474#unseeded} is VALID [2022-02-21 04:20:22,684 INFO L272 TraceCheckUtils]: 45: Hoare triple {44474#unseeded} call #t~ret5 := fibo2(~n - 2); {44474#unseeded} is VALID [2022-02-21 04:20:22,684 INFO L290 TraceCheckUtils]: 46: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:22,684 INFO L290 TraceCheckUtils]: 47: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:22,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:22,685 INFO L272 TraceCheckUtils]: 49: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:22,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:22,686 INFO L290 TraceCheckUtils]: 51: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:22,686 INFO L290 TraceCheckUtils]: 52: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:22,686 INFO L272 TraceCheckUtils]: 53: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:22,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:22,687 INFO L290 TraceCheckUtils]: 55: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:22,687 INFO L290 TraceCheckUtils]: 56: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:22,688 INFO L272 TraceCheckUtils]: 57: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:22,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:22,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:22,689 INFO L290 TraceCheckUtils]: 60: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:22,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:20:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:22,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:22,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {44477#(>= oldRank0 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {44673#(<= (+ |fibo2_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:20:22,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {44673#(<= (+ |fibo2_#in~n| 1) oldRank0)} ~n := #in~n; {44677#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:22,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {44677#(<= (+ fibo2_~n 1) oldRank0)} assume !(~n < 1); {44677#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:22,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {44677#(<= (+ fibo2_~n 1) oldRank0)} assume !(1 == ~n); {44677#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:22,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {44677#(<= (+ fibo2_~n 1) oldRank0)} call #t~ret6 := fibo1(~n - 1); {44687#(<= (+ 2 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:22,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {44687#(<= (+ 2 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {44691#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:20:22,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {44691#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {44695#(and (<= (+ fibo1_~n 2) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:22,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {44695#(and (<= (+ fibo1_~n 2) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {44487#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:22,842 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 04:20:22,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:22,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:22,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:22,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:22,875 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2022-02-21 04:20:22,875 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 264 states and 299 transitions. cyclomatic complexity: 38 Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:23,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:23,050 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 264 states and 299 transitions. cyclomatic complexity: 38. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 288 states and 323 transitions. Complement of second has 19 states. [2022-02-21 04:20:23,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:23,051 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:23,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 299 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:23,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:23,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:23,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:23,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:23,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:23,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:23,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 323 transitions. [2022-02-21 04:20:23,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:23,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:23,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:23,053 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 264 states and 299 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:23,053 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:23,053 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:23,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:23,054 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:23,054 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 288 states and 323 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:23,054 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:23,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 288 letters. Loop has 288 letters. [2022-02-21 04:20:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 288 letters. Loop has 288 letters. [2022-02-21 04:20:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 288 letters. Loop has 288 letters. [2022-02-21 04:20:23,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:23,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:23,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:23,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:23,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:23,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:23,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,070 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-02-21 04:20:23,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,072 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:23,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:23,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 04:20:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:23,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:23,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {44474#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {44474#unseeded} is VALID [2022-02-21 04:20:23,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {44474#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {44474#unseeded} is VALID [2022-02-21 04:20:23,449 INFO L272 TraceCheckUtils]: 2: Hoare triple {44474#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {44474#unseeded} is VALID [2022-02-21 04:20:23,449 INFO L290 TraceCheckUtils]: 3: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:23,450 INFO L290 TraceCheckUtils]: 4: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:23,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:23,450 INFO L272 TraceCheckUtils]: 6: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:23,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:23,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:23,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:23,451 INFO L272 TraceCheckUtils]: 10: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:23,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:23,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:23,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:23,452 INFO L272 TraceCheckUtils]: 14: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,454 INFO L272 TraceCheckUtils]: 18: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,455 INFO L272 TraceCheckUtils]: 22: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,457 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,457 INFO L272 TraceCheckUtils]: 28: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,459 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,460 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,461 INFO L272 TraceCheckUtils]: 36: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,462 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:23,464 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {45062#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44474#unseeded} #50#return; {44474#unseeded} is VALID [2022-02-21 04:20:23,464 INFO L272 TraceCheckUtils]: 45: Hoare triple {44474#unseeded} call #t~ret5 := fibo2(~n - 2); {44474#unseeded} is VALID [2022-02-21 04:20:23,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:23,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:23,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:23,465 INFO L272 TraceCheckUtils]: 49: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:23,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:23,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:23,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:23,466 INFO L272 TraceCheckUtils]: 53: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:23,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:23,467 INFO L290 TraceCheckUtils]: 55: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:23,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:23,467 INFO L272 TraceCheckUtils]: 57: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:23,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:23,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:23,468 INFO L290 TraceCheckUtils]: 60: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:23,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:20:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:23,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:23,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {44477#(>= oldRank0 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {45201#(<= (+ |fibo2_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:20:23,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {45201#(<= (+ |fibo2_#in~n| 1) oldRank0)} ~n := #in~n; {45205#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:23,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {45205#(<= (+ fibo2_~n 1) oldRank0)} assume !(~n < 1); {45205#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:23,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {45205#(<= (+ fibo2_~n 1) oldRank0)} assume !(1 == ~n); {45205#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:23,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {45205#(<= (+ fibo2_~n 1) oldRank0)} call #t~ret6 := fibo1(~n - 1); {45215#(<= (+ 2 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:23,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {45215#(<= (+ 2 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {45219#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:20:23,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {45219#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {45223#(and (<= (+ fibo1_~n 2) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:23,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {45223#(and (<= (+ fibo1_~n 2) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {44487#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:23,596 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 04:20:23,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:23,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:23,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,629 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2022-02-21 04:20:23,629 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 264 states and 299 transitions. cyclomatic complexity: 38 Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:23,785 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 264 states and 299 transitions. cyclomatic complexity: 38. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 288 states and 323 transitions. Complement of second has 21 states. [2022-02-21 04:20:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:23,786 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:23,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 299 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:23,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:23,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:23,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:23,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:23,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:23,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:23,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 323 transitions. [2022-02-21 04:20:23,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 04:20:23,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:23,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:23,788 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 264 states and 299 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:23,788 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:23,788 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:23,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:20:23,788 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:23,788 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 288 states and 323 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:23,789 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:23,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 6 letters. [2022-02-21 04:20:23,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 6 letters. [2022-02-21 04:20:23,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 6 letters. [2022-02-21 04:20:23,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 288 letters. Loop has 288 letters. [2022-02-21 04:20:23,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 288 letters. Loop has 288 letters. [2022-02-21 04:20:23,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 288 letters. Loop has 288 letters. [2022-02-21 04:20:23,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:23,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:23,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:23,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:23,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:23,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:20:23,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 6 letters. [2022-02-21 04:20:23,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 6 letters. [2022-02-21 04:20:23,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 6 letters. [2022-02-21 04:20:23,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 288 states and 323 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:23,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,795 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2022-02-21 04:20:23,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 19 transitions. Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:23,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:23,796 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 04:20:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:20:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:23,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 04:20:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:23,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:24,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {44474#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {44474#unseeded} is VALID [2022-02-21 04:20:24,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {44474#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := 6; {44474#unseeded} is VALID [2022-02-21 04:20:24,279 INFO L272 TraceCheckUtils]: 2: Hoare triple {44474#unseeded} call main_#t~ret8#1 := fibo1(main_~x~0#1); {44474#unseeded} is VALID [2022-02-21 04:20:24,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,280 INFO L272 TraceCheckUtils]: 6: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,282 INFO L272 TraceCheckUtils]: 10: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,283 INFO L272 TraceCheckUtils]: 14: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,285 INFO L272 TraceCheckUtils]: 18: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret6 := fibo1(~n - 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(1 == ~n); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,287 INFO L272 TraceCheckUtils]: 22: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret4 := fibo2(~n - 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,289 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #50#return; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,289 INFO L272 TraceCheckUtils]: 28: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := fibo2(~n - 2); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~n < 1;#res := 0; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,291 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #52#return; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,293 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #46#return; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,294 INFO L272 TraceCheckUtils]: 36: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret7 := fibo1(~n - 2); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~n < 1); {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 1 == ~n;#res := 1; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,296 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #48#return; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,296 INFO L290 TraceCheckUtils]: 42: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret6 + #t~ret7;havoc #t~ret6;havoc #t~ret7; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:20:24,297 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {45594#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {44474#unseeded} #50#return; {44474#unseeded} is VALID [2022-02-21 04:20:24,298 INFO L272 TraceCheckUtils]: 45: Hoare triple {44474#unseeded} call #t~ret5 := fibo2(~n - 2); {44474#unseeded} is VALID [2022-02-21 04:20:24,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,298 INFO L290 TraceCheckUtils]: 47: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,299 INFO L272 TraceCheckUtils]: 49: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,299 INFO L290 TraceCheckUtils]: 50: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,300 INFO L272 TraceCheckUtils]: 53: Hoare triple {44474#unseeded} call #t~ret4 := fibo2(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,301 INFO L290 TraceCheckUtils]: 54: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,301 INFO L290 TraceCheckUtils]: 55: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,301 INFO L290 TraceCheckUtils]: 56: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,302 INFO L272 TraceCheckUtils]: 57: Hoare triple {44474#unseeded} call #t~ret6 := fibo1(~n - 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,302 INFO L290 TraceCheckUtils]: 58: Hoare triple {44474#unseeded} ~n := #in~n; {44474#unseeded} is VALID [2022-02-21 04:20:24,302 INFO L290 TraceCheckUtils]: 59: Hoare triple {44474#unseeded} assume !(~n < 1); {44474#unseeded} is VALID [2022-02-21 04:20:24,302 INFO L290 TraceCheckUtils]: 60: Hoare triple {44474#unseeded} assume !(1 == ~n); {44474#unseeded} is VALID [2022-02-21 04:20:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:24,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 04:20:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:20:24,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:20:24,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {44477#(>= oldRank0 fibo1_~n)} call #t~ret4 := fibo2(~n - 1); {45733#(<= (+ |fibo2_#in~n| 1) oldRank0)} is VALID [2022-02-21 04:20:24,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {45733#(<= (+ |fibo2_#in~n| 1) oldRank0)} ~n := #in~n; {45737#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:24,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {45737#(<= (+ fibo2_~n 1) oldRank0)} assume !(~n < 1); {45737#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:24,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {45737#(<= (+ fibo2_~n 1) oldRank0)} assume !(1 == ~n); {45737#(<= (+ fibo2_~n 1) oldRank0)} is VALID [2022-02-21 04:20:24,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {45737#(<= (+ fibo2_~n 1) oldRank0)} call #t~ret6 := fibo1(~n - 1); {45747#(<= (+ 2 |fibo1_#in~n|) oldRank0)} is VALID [2022-02-21 04:20:24,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {45747#(<= (+ 2 |fibo1_#in~n|) oldRank0)} ~n := #in~n; {45751#(<= (+ fibo1_~n 2) oldRank0)} is VALID [2022-02-21 04:20:24,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {45751#(<= (+ fibo1_~n 2) oldRank0)} assume !(~n < 1); {45755#(and (<= (+ fibo1_~n 2) oldRank0) (not (< fibo1_~n 1)))} is VALID [2022-02-21 04:20:24,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {45755#(and (<= (+ fibo1_~n 2) oldRank0) (not (< fibo1_~n 1)))} assume !(1 == ~n); {44487#(or (and (>= oldRank0 0) (> oldRank0 fibo1_~n)) unseeded)} is VALID [2022-02-21 04:20:24,455 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 04:20:24,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:24,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:24,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:24,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,489 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 6 loop predicates [2022-02-21 04:20:24,489 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 264 states and 299 transitions. cyclomatic complexity: 38 Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:24,703 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 264 states and 299 transitions. cyclomatic complexity: 38. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Result 573 states and 653 transitions. Complement of second has 33 states. [2022-02-21 04:20:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 04:20:24,704 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:24,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 299 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:24,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:24,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:24,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:24,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:24,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:20:24,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:20:24,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 653 transitions. [2022-02-21 04:20:24,707 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:24,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:24,707 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 264 states and 299 transitions. cyclomatic complexity: 38 [2022-02-21 04:20:24,707 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:20:24,708 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:24,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:20:24,708 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:20:24,708 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 573 states and 653 transitions. cyclomatic complexity: 85 [2022-02-21 04:20:24,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 653 transitions. cyclomatic complexity: 85 [2022-02-21 04:20:24,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:24,709 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:20:24,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:24,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:24,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:24,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:24,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:24,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:24,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 573 letters. Loop has 573 letters. [2022-02-21 04:20:24,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 573 letters. Loop has 573 letters. [2022-02-21 04:20:24,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 573 letters. Loop has 573 letters. [2022-02-21 04:20:24,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:24,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:24,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 264 letters. Loop has 264 letters. [2022-02-21 04:20:24,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:24,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:24,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:20:24,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:24,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:24,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:24,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:24,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:24,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 67 letters. Loop has 22 letters. [2022-02-21 04:20:24,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 264 states and 299 transitions. cyclomatic complexity: 38 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:24,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:24,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 653 transitions. cyclomatic complexity: 85 Stem has 2 letters. Loop has 5 letters. [2022-02-21 04:20:24,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,714 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:20:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-21 04:20:24,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 61 letters. Loop has 8 letters. [2022-02-21 04:20:24,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 69 letters. Loop has 8 letters. [2022-02-21 04:20:24,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 61 letters. Loop has 16 letters. [2022-02-21 04:20:24,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:20:24,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 573 states and 653 transitions. cyclomatic complexity: 85 [2022-02-21 04:20:24,727 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:24,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 573 states to 0 states and 0 transitions. [2022-02-21 04:20:24,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:20:24,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:20:24,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:20:24,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:20:24,728 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:24,728 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:24,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:20:24,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 04:20:24,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-02-21 04:20:24,729 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:20:24,729 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:20:24,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:20:24,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 10 states have internal predecessors, (40), 8 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 04:20:24,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:20:24,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:20:24,770 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:24,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:20:24,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:20:24,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:20:24,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:20:24,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:20:24,770 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:24,770 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:24,771 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:20:24,771 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 04:20:24,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:20:24,771 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:20:24,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:20:24,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:20:24 BoogieIcfgContainer [2022-02-21 04:20:24,777 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:20:24,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:20:24,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:20:24,778 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:20:24,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:46" (3/4) ... [2022-02-21 04:20:24,780 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:20:24,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:20:24,781 INFO L158 Benchmark]: Toolchain (without parser) took 38783.93ms. Allocated memory was 111.1MB in the beginning and 239.1MB in the end (delta: 127.9MB). Free memory was 80.4MB in the beginning and 103.4MB in the end (delta: -22.9MB). Peak memory consumption was 105.2MB. Max. memory is 16.1GB. [2022-02-21 04:20:24,781 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:20:24,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.07ms. Allocated memory is still 111.1MB. Free memory was 80.4MB in the beginning and 87.0MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:20:24,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.67ms. Allocated memory is still 111.1MB. Free memory was 87.0MB in the beginning and 85.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:20:24,782 INFO L158 Benchmark]: Boogie Preprocessor took 23.17ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 84.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:20:24,782 INFO L158 Benchmark]: RCFGBuilder took 226.74ms. Allocated memory is still 111.1MB. Free memory was 84.3MB in the beginning and 74.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:20:24,782 INFO L158 Benchmark]: BuchiAutomizer took 38292.91ms. Allocated memory was 111.1MB in the beginning and 239.1MB in the end (delta: 127.9MB). Free memory was 74.9MB in the beginning and 103.4MB in the end (delta: -28.5MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. [2022-02-21 04:20:24,783 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 239.1MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:20:24,784 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.18ms. Allocated memory is still 111.1MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.07ms. Allocated memory is still 111.1MB. Free memory was 80.4MB in the beginning and 87.0MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.67ms. Allocated memory is still 111.1MB. Free memory was 87.0MB in the beginning and 85.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.17ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 84.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 226.74ms. Allocated memory is still 111.1MB. Free memory was 84.3MB in the beginning and 74.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 38292.91ms. Allocated memory was 111.1MB in the beginning and 239.1MB in the end (delta: 127.9MB). Free memory was 74.9MB in the beginning and 103.4MB in the end (delta: -28.5MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 239.1MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (8 trivial, 2 deterministic, 4 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 7 locations. One deterministic module has affine ranking function n and consists of 12 locations. One nondeterministic module has affine ranking function \old(n) and consists of 8 locations. One nondeterministic module has affine ranking function n and consists of 12 locations. One nondeterministic module has affine ranking function \old(n) and consists of 8 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. 8 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 38.2s and 10 iterations. TraceHistogramMax:8. Analysis of lassos took 18.2s. Construction of modules took 4.0s. Büchi inclusion checks took 14.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 12. Automata minimization 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 408 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 394 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1208 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1182 mSDsluCounter, 1811 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1349 mSDsCounter, 743 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3244 IncrementalHoareTripleChecker+Invalid, 3987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 743 mSolverCounterUnsat, 462 mSDtfsCounter, 3244 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI3 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax100 hnf100 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf94 smp65 dnf100 smp100 tf110 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 27 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:20:24,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:25,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-02-21 04:20:25,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-02-21 04:20:25,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-02-21 04:20:25,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-02-21 04:20:25,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-02-21 04:20:26,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:26,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-02-21 04:20:26,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:20:26,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE