./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:37:21,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:37:21,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:37:21,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:37:21,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:37:21,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:37:21,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:37:21,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:37:21,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:37:21,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:37:21,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:37:21,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:37:21,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:37:21,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:37:21,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:37:21,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:37:21,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:37:21,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:37:21,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:37:21,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:37:21,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:37:21,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:37:21,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:37:21,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:37:21,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:37:21,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:37:21,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:37:21,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:37:21,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:37:21,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:37:21,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:37:21,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:37:21,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:37:21,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:37:21,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:37:21,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:37:21,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:37:21,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:37:21,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:37:21,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:37:21,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:37:21,521 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:37:21,555 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:37:21,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:37:21,556 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:37:21,556 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:37:21,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:37:21,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:37:21,558 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:37:21,558 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:37:21,558 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:37:21,558 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:37:21,559 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:37:21,559 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:37:21,559 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:37:21,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:37:21,560 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:37:21,560 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:37:21,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:37:21,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:37:21,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:37:21,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:37:21,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:37:21,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:37:21,561 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:37:21,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:37:21,562 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:37:21,562 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:37:21,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:37:21,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:37:21,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:37:21,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:37:21,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:37:21,564 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:37:21,564 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 -> f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 [2022-02-21 03:37:21,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:37:21,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:37:21,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:37:21,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:37:21,851 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:37:21,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2022-02-21 03:37:21,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282ef888c/2959b5510e9147588d12792de6b587b7/FLAGeaaf7c205 [2022-02-21 03:37:22,359 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:37:22,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2022-02-21 03:37:22,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282ef888c/2959b5510e9147588d12792de6b587b7/FLAGeaaf7c205 [2022-02-21 03:37:22,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/282ef888c/2959b5510e9147588d12792de6b587b7 [2022-02-21 03:37:22,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:37:22,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:37:22,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:37:22,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:37:22,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:37:22,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:37:22" (1/1) ... [2022-02-21 03:37:22,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18237fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22, skipping insertion in model container [2022-02-21 03:37:22,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:37:22" (1/1) ... [2022-02-21 03:37:22,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:37:22,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:37:22,600 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/bitvector/soft_float_5a.c.cil.c[728,741] [2022-02-21 03:37:22,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:37:22,657 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:37:22,668 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/bitvector/soft_float_5a.c.cil.c[728,741] [2022-02-21 03:37:22,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:37:22,754 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:37:22,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22 WrapperNode [2022-02-21 03:37:22,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:37:22,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:37:22,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:37:22,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:37:22,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22" (1/1) ... [2022-02-21 03:37:22,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22" (1/1) ... [2022-02-21 03:37:22,837 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 430 [2022-02-21 03:37:22,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:37:22,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:37:22,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:37:22,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:37:22,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22" (1/1) ... [2022-02-21 03:37:22,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22" (1/1) ... [2022-02-21 03:37:22,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22" (1/1) ... [2022-02-21 03:37:22,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22" (1/1) ... [2022-02-21 03:37:22,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22" (1/1) ... [2022-02-21 03:37:22,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22" (1/1) ... [2022-02-21 03:37:22,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22" (1/1) ... [2022-02-21 03:37:22,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:37:22,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:37:22,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:37:22,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:37:22,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22" (1/1) ... [2022-02-21 03:37:22,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:22,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:22,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:22,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:37:22,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:37:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:37:22,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:37:22,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:37:23,106 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:37:23,107 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:37:23,908 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:37:23,916 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:37:23,916 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-21 03:37:23,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:23 BoogieIcfgContainer [2022-02-21 03:37:23,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:37:23,919 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:37:23,920 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:37:23,923 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:37:23,923 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:23,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:37:22" (1/3) ... [2022-02-21 03:37:23,925 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55b5848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:37:23, skipping insertion in model container [2022-02-21 03:37:23,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:23,925 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:22" (2/3) ... [2022-02-21 03:37:23,925 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55b5848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:37:23, skipping insertion in model container [2022-02-21 03:37:23,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:23,925 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:23" (3/3) ... [2022-02-21 03:37:23,927 INFO L388 chiAutomizerObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2022-02-21 03:37:23,963 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:37:23,963 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:37:23,963 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:37:23,963 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:37:23,964 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:37:23,964 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:37:23,964 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:37:23,964 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:37:23,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:24,044 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2022-02-21 03:37:24,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:24,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:24,050 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:37:24,050 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:24,051 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:37:24,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:24,069 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2022-02-21 03:37:24,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:24,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:24,070 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:37:24,070 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:24,076 INFO L791 eck$LassoCheckResult]: Stem: 115#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(22, 2);call #Ultimate.allocInit(12, 3); 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 88#L29true assume !(0 == base2flt_~m#1 % 4294967296); 112#L35true assume !(base2flt_~m#1 % 4294967296 < 16777216); 61#L57-2true [2022-02-21 03:37:24,077 INFO L793 eck$LassoCheckResult]: Loop: 61#L57-2true assume !false; 44#L58true assume base2flt_~m#1 % 4294967296 >= 33554432; 101#L59true assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 61#L57-2true [2022-02-21 03:37:24,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:24,082 INFO L85 PathProgramCache]: Analyzing trace with hash 925696, now seen corresponding path program 1 times [2022-02-21 03:37:24,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:24,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342265809] [2022-02-21 03:37:24,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:24,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:24,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#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(22, 2);call #Ultimate.allocInit(12, 3); {136#true} is VALID [2022-02-21 03:37:24,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {138#(= |ULTIMATE.start_base2flt_~m#1| 0)} is VALID [2022-02-21 03:37:24,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#(= |ULTIMATE.start_base2flt_~m#1| 0)} assume !(0 == base2flt_~m#1 % 4294967296); {138#(= |ULTIMATE.start_base2flt_~m#1| 0)} is VALID [2022-02-21 03:37:24,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {138#(= |ULTIMATE.start_base2flt_~m#1| 0)} assume !(base2flt_~m#1 % 4294967296 < 16777216); {137#false} is VALID [2022-02-21 03:37:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:24,271 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:24,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342265809] [2022-02-21 03:37:24,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342265809] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:24,273 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:24,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:37:24,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541447347] [2022-02-21 03:37:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:24,282 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash 74612, now seen corresponding path program 1 times [2022-02-21 03:37:24,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:24,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024113541] [2022-02-21 03:37:24,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:24,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:24,309 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:24,347 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:24,390 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:24,390 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:24,390 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:24,391 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:24,391 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:24,391 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,391 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:24,392 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:24,392 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration1_Loop [2022-02-21 03:37:24,392 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:24,392 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:24,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:24,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:24,545 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:24,546 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:24,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:24,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:37:24,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:24,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:24,599 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:37:24,600 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m#1=-1} Honda state: {ULTIMATE.start_base2flt_~m#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:37:24,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:37:24,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,605 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:24,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:37:24,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:24,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:24,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:24,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:24,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:37:24,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:24,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:24,699 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:24,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:24,706 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:24,706 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:24,707 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:24,707 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:24,707 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:24,707 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,707 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:24,707 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:24,707 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration1_Loop [2022-02-21 03:37:24,707 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:24,707 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:24,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 03:37:24,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:24,855 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:24,859 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:24,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:24,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:37:24,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:24,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:24,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:24,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:24,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:24,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:24,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:24,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:24,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:24,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:24,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:24,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:37:24,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:24,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:24,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:24,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:24,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:24,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:24,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:24,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:24,947 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:24,959 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:24,960 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:24,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:24,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:24,968 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:24,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:37:24,971 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:24,971 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:24,971 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:24,972 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2022-02-21 03:37:24,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:25,012 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:25,018 INFO L390 LassoCheck]: Loop: "assume !false;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2;" [2022-02-21 03:37:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:25,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#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(22, 2);call #Ultimate.allocInit(12, 3); {141#unseeded} is VALID [2022-02-21 03:37:25,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {141#unseeded} is VALID [2022-02-21 03:37:25,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {141#unseeded} is VALID [2022-02-21 03:37:25,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {141#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {141#unseeded} is VALID [2022-02-21 03:37:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:25,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:25,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {144#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {144#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:25,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {144#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {144#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:25,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; {154#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:25,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:25,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:25,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,168 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:37:25,171 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:25,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:25,629 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 399 states and 720 transitions. Complement of second has 6 states. [2022-02-21 03:37:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:25,630 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:25,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:25,641 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2022-02-21 03:37:25,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:25,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:25,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:25,651 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:25,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:25,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:25,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 399 states and 720 transitions. [2022-02-21 03:37:25,656 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 39 [2022-02-21 03:37:25,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:25,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:25,659 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:25,665 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2022-02-21 03:37:25,670 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 24 examples of accepted words. [2022-02-21 03:37:25,670 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:25,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:25,676 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:37:25,676 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 399 states and 720 transitions. cyclomatic complexity: 341 [2022-02-21 03:37:25,682 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 39 examples of accepted words. [2022-02-21 03:37:25,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:25,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:25,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:25,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 399 letters. Loop has 399 letters. [2022-02-21 03:37:25,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 399 letters. Loop has 399 letters. [2022-02-21 03:37:25,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 399 letters. Loop has 399 letters. [2022-02-21 03:37:25,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 132 letters. [2022-02-21 03:37:25,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 132 letters. [2022-02-21 03:37:25,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 132 letters. Loop has 132 letters. [2022-02-21 03:37:25,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:37:25,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:37:25,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:37:25,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:25,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:25,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:25,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:25,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:25,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:25,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:25,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:25,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:25,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:25,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:25,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:25,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:25,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:25,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:25,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:25,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:25,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:25,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:25,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:25,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:25,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:25,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:25,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:25,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:25,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:25,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:25,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:25,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:25,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:25,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:25,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:25,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:25,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:25,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:25,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:25,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:25,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:25,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:25,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:25,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:25,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:25,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:25,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:25,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:25,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:25,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:25,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:25,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:25,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:25,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:25,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:25,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:25,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:25,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:25,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:25,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:25,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:25,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:25,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:25,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:25,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:25,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:25,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:25,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:25,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:25,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:25,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:25,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:25,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:25,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:25,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:25,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:25,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:25,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:25,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:25,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,779 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2022-02-21 03:37:25,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 478 transitions. Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:25,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 478 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:25,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 478 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:37:25,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:25,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 720 transitions. cyclomatic complexity: 341 [2022-02-21 03:37:25,808 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 39 [2022-02-21 03:37:25,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 127 states and 216 transitions. [2022-02-21 03:37:25,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2022-02-21 03:37:25,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-02-21 03:37:25,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 216 transitions. [2022-02-21 03:37:25,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:25,818 INFO L681 BuchiCegarLoop]: Abstraction has 127 states and 216 transitions. [2022-02-21 03:37:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 216 transitions. [2022-02-21 03:37:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2022-02-21 03:37:25,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:25,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states and 216 transitions. Second operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:25,843 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states and 216 transitions. Second operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:25,846 INFO L87 Difference]: Start difference. First operand 127 states and 216 transitions. Second operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:25,848 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:25,856 INFO L93 Difference]: Finished difference Result 127 states and 216 transitions. [2022-02-21 03:37:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 216 transitions. [2022-02-21 03:37:25,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:25,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:25,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 127 states and 216 transitions. [2022-02-21 03:37:25,859 INFO L87 Difference]: Start difference. First operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 127 states and 216 transitions. [2022-02-21 03:37:25,860 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:25,867 INFO L93 Difference]: Finished difference Result 127 states and 216 transitions. [2022-02-21 03:37:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 216 transitions. [2022-02-21 03:37:25,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:25,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:25,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:25,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 188 transitions. [2022-02-21 03:37:25,875 INFO L704 BuchiCegarLoop]: Abstraction has 108 states and 188 transitions. [2022-02-21 03:37:25,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:25,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:37:25,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:37:25,879 INFO L87 Difference]: Start difference. First operand 108 states and 188 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:26,062 INFO L93 Difference]: Finished difference Result 65 states and 100 transitions. [2022-02-21 03:37:26,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:37:26,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:26,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 100 transitions. [2022-02-21 03:37:26,070 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:26,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 100 transitions. [2022-02-21 03:37:26,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-02-21 03:37:26,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-02-21 03:37:26,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 100 transitions. [2022-02-21 03:37:26,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:26,073 INFO L681 BuchiCegarLoop]: Abstraction has 65 states and 100 transitions. [2022-02-21 03:37:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 100 transitions. [2022-02-21 03:37:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-02-21 03:37:26,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:26,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states and 100 transitions. Second operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 52 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,084 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states and 100 transitions. Second operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 52 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,086 INFO L87 Difference]: Start difference. First operand 65 states and 100 transitions. Second operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 52 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:26,089 INFO L93 Difference]: Finished difference Result 65 states and 100 transitions. [2022-02-21 03:37:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 100 transitions. [2022-02-21 03:37:26,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:26,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:26,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 52 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 65 states and 100 transitions. [2022-02-21 03:37:26,093 INFO L87 Difference]: Start difference. First operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 52 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 65 states and 100 transitions. [2022-02-21 03:37:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:26,096 INFO L93 Difference]: Finished difference Result 65 states and 100 transitions. [2022-02-21 03:37:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 100 transitions. [2022-02-21 03:37:26,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:26,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:26,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:26,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 52 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 82 transitions. [2022-02-21 03:37:26,098 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 82 transitions. [2022-02-21 03:37:26,098 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 82 transitions. [2022-02-21 03:37:26,098 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:37:26,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 82 transitions. [2022-02-21 03:37:26,099 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:26,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:26,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:26,099 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:26,099 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:26,100 INFO L791 eck$LassoCheckResult]: Stem: 1314#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(22, 2);call #Ultimate.allocInit(12, 3); 1308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1293#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1294#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1272#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1273#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 1309#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 1297#L47-3 [2022-02-21 03:37:26,100 INFO L793 eck$LassoCheckResult]: Loop: 1297#L47-3 assume !false; 1289#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 1290#L47-2 assume base2flt_~m#1 % 4294967296 < 16777216; 1297#L47-3 [2022-02-21 03:37:26,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:26,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1807920711, now seen corresponding path program 1 times [2022-02-21 03:37:26,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:26,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410358187] [2022-02-21 03:37:26,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:26,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:26,116 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:26,132 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:26,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:26,133 INFO L85 PathProgramCache]: Analyzing trace with hash 153118, now seen corresponding path program 1 times [2022-02-21 03:37:26,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:26,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437543731] [2022-02-21 03:37:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:26,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:26,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:26,146 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:26,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash 876132888, now seen corresponding path program 1 times [2022-02-21 03:37:26,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:26,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732878732] [2022-02-21 03:37:26,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:26,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:26,160 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:26,172 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:26,197 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:26,197 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:26,197 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:26,198 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:26,198 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:26,198 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:26,198 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:26,198 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:26,198 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration2_Loop [2022-02-21 03:37:26,198 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:26,198 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:26,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 03:37:26,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:26,289 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:26,289 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:26,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:26,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:26,291 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:26,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:37:26,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:26,317 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:26,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:37:26,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:26,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:26,342 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:26,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:37:26,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:26,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:26,375 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:26,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:26,379 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:26,379 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:26,379 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:26,379 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:26,379 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:26,379 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:26,379 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:26,379 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:26,379 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration2_Loop [2022-02-21 03:37:26,379 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:26,379 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:26,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:26,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:26,466 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:26,467 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:26,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:26,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:26,472 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:26,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:37:26,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:26,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:26,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:26,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:26,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:26,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:26,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:26,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:26,531 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:26,533 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:26,533 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:26,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:26,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:26,535 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:26,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:37:26,537 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:26,537 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:26,537 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:26,537 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2022-02-21 03:37:26,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:26,560 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:26,564 INFO L390 LassoCheck]: Loop: "assume !false;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1;" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2022-02-21 03:37:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:26,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:26,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:26,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:26,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:26,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {1455#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(22, 2);call #Ultimate.allocInit(12, 3); {1455#unseeded} is VALID [2022-02-21 03:37:26,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {1455#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {1455#unseeded} is VALID [2022-02-21 03:37:26,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {1455#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {1455#unseeded} is VALID [2022-02-21 03:37:26,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {1455#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {1455#unseeded} is VALID [2022-02-21 03:37:26,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {1455#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {1455#unseeded} is VALID [2022-02-21 03:37:26,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {1455#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {1455#unseeded} is VALID [2022-02-21 03:37:26,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {1455#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {1455#unseeded} is VALID [2022-02-21 03:37:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:26,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:26,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:26,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {1458#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !false; {1458#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} is VALID [2022-02-21 03:37:26,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {1458#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {1494#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} is VALID [2022-02-21 03:37:26,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {1494#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} assume base2flt_~m#1 % 4294967296 < 16777216; {1468#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))) unseeded)} is VALID [2022-02-21 03:37:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:26,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:26,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,733 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:37:26,733 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 82 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,864 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 82 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 109 states and 171 transitions. Complement of second has 5 states. [2022-02-21 03:37:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:26,864 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:26,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 82 transitions. cyclomatic complexity: 35 [2022-02-21 03:37:26,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:26,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:26,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:26,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:26,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:26,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 171 transitions. [2022-02-21 03:37:26,867 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2022-02-21 03:37:26,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:26,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:26,867 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 82 transitions. cyclomatic complexity: 35 [2022-02-21 03:37:26,869 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 18 examples of accepted words. [2022-02-21 03:37:26,869 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:26,871 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:26,871 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 109 states and 171 transitions. cyclomatic complexity: 72 [2022-02-21 03:37:26,873 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 27 examples of accepted words. [2022-02-21 03:37:26,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:26,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:26,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:26,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:37:26,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:37:26,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:37:26,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:37:26,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:37:26,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:37:26,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:26,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:26,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:26,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:26,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:26,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:26,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:26,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:26,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:26,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:26,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:26,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:26,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:26,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:26,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:26,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:26,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:26,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:26,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:26,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:26,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:26,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:26,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:26,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:26,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:26,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:26,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:26,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:26,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:26,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:26,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:26,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:26,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:26,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:26,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:26,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:26,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:26,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:26,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:26,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:26,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:26,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:26,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:26,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:26,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:26,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:26,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:26,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:26,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:26,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:26,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:26,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:26,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:26,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:26,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:26,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:26,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:26,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:26,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:26,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:26,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:26,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:26,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:26,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:26,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:26,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:26,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:26,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:26,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:26,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,908 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-21 03:37:26,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:26,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:26,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:37:26,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:26,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 171 transitions. cyclomatic complexity: 72 [2022-02-21 03:37:26,914 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2022-02-21 03:37:26,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 97 states and 150 transitions. [2022-02-21 03:37:26,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2022-02-21 03:37:26,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2022-02-21 03:37:26,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 150 transitions. [2022-02-21 03:37:26,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:26,920 INFO L681 BuchiCegarLoop]: Abstraction has 97 states and 150 transitions. [2022-02-21 03:37:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 150 transitions. [2022-02-21 03:37:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2022-02-21 03:37:26,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:26,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states and 150 transitions. Second operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,928 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states and 150 transitions. Second operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,928 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,928 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:26,935 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2022-02-21 03:37:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2022-02-21 03:37:26,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:26,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:26,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 97 states and 150 transitions. [2022-02-21 03:37:26,935 INFO L87 Difference]: Start difference. First operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 97 states and 150 transitions. [2022-02-21 03:37:26,936 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:26,939 INFO L93 Difference]: Finished difference Result 98 states and 151 transitions. [2022-02-21 03:37:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2022-02-21 03:37:26,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:26,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:26,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:26,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2022-02-21 03:37:26,941 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 86 transitions. [2022-02-21 03:37:26,941 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 86 transitions. [2022-02-21 03:37:26,941 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:37:26,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 86 transitions. [2022-02-21 03:37:26,941 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-02-21 03:37:26,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:26,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:26,942 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:26,942 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:26,942 INFO L791 eck$LassoCheckResult]: Stem: 1668#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(22, 2);call #Ultimate.allocInit(12, 3); 1661#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1645#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1646#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1623#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1624#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 1662#L35-1 assume !(base2flt_~m#1 % 4294967296 < 16777216); 1629#L57-5 [2022-02-21 03:37:26,942 INFO L793 eck$LassoCheckResult]: Loop: 1629#L57-5 assume !false; 1625#L58-1 assume base2flt_~m#1 % 4294967296 >= 33554432; 1626#L59-1 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 1629#L57-5 [2022-02-21 03:37:26,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:26,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1807920737, now seen corresponding path program 1 times [2022-02-21 03:37:26,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:26,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339372427] [2022-02-21 03:37:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:26,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {2043#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(22, 2);call #Ultimate.allocInit(12, 3); {2043#true} is VALID [2022-02-21 03:37:26,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {2043#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2043#true} is VALID [2022-02-21 03:37:26,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {2043#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2043#true} is VALID [2022-02-21 03:37:26,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {2043#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {2043#true} is VALID [2022-02-21 03:37:26,978 INFO L290 TraceCheckUtils]: 4: Hoare triple {2043#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2045#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} is VALID [2022-02-21 03:37:26,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {2045#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} assume !(0 == base2flt_~m#1 % 4294967296); {2045#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} is VALID [2022-02-21 03:37:26,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {2045#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} assume !(base2flt_~m#1 % 4294967296 < 16777216); {2044#false} is VALID [2022-02-21 03:37:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:26,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:26,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339372427] [2022-02-21 03:37:26,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339372427] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:26,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:26,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:37:26,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088356882] [2022-02-21 03:37:26,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:26,980 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash 178877, now seen corresponding path program 1 times [2022-02-21 03:37:26,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:26,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569744673] [2022-02-21 03:37:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:26,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:26,988 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:26,993 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:27,022 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:27,022 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:27,022 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:27,022 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:27,022 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:27,022 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:27,022 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:27,022 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:27,022 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration3_Loop [2022-02-21 03:37:27,022 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:27,023 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:27,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:27,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:27,138 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:27,138 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:27,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:27,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:27,144 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:27,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:27,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:27,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:37:27,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:27,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:27,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:27,201 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:27,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:37:27,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:27,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:27,238 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:27,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:27,243 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:27,243 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:27,243 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:27,243 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:27,243 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:27,243 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:27,243 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:27,243 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:27,243 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration3_Loop [2022-02-21 03:37:27,243 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:27,243 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:27,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:27,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 03:37:27,369 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:27,369 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:27,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:27,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:27,371 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:27,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:37:27,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:27,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:27,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:27,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:27,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:27,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:27,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:27,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:27,389 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:27,391 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:27,391 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:27,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:27,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:27,392 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:27,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:37:27,403 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:27,403 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:27,403 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:27,403 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2022-02-21 03:37:27,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:27,429 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:27,435 INFO L390 LassoCheck]: Loop: "assume !false;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2;" [2022-02-21 03:37:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:27,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:27,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:27,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {2048#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(22, 2);call #Ultimate.allocInit(12, 3); {2048#unseeded} is VALID [2022-02-21 03:37:27,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2048#unseeded} is VALID [2022-02-21 03:37:27,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {2048#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2048#unseeded} is VALID [2022-02-21 03:37:27,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {2048#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2048#unseeded} is VALID [2022-02-21 03:37:27,487 INFO L290 TraceCheckUtils]: 4: Hoare triple {2048#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2048#unseeded} is VALID [2022-02-21 03:37:27,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {2048#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {2048#unseeded} is VALID [2022-02-21 03:37:27,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {2048#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {2048#unseeded} is VALID [2022-02-21 03:37:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:27,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:27,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:27,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {2051#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {2051#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:27,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {2051#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {2051#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:27,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {2051#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; {2061#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:27,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:27,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:27,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,517 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:37:27,517 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 86 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,644 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 86 transitions. cyclomatic complexity: 36. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 111 states and 174 transitions. Complement of second has 5 states. [2022-02-21 03:37:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:27,644 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:27,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 86 transitions. cyclomatic complexity: 36 [2022-02-21 03:37:27,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:27,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:27,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:27,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:27,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:27,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 174 transitions. [2022-02-21 03:37:27,647 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2022-02-21 03:37:27,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:27,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:27,647 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 56 states and 86 transitions. cyclomatic complexity: 36 [2022-02-21 03:37:27,648 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:37:27,648 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:27,649 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:27,649 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 111 states and 174 transitions. cyclomatic complexity: 73 [2022-02-21 03:37:27,651 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 24 examples of accepted words. [2022-02-21 03:37:27,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:27,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:27,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:27,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:27,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:27,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:27,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 111 letters. Loop has 111 letters. [2022-02-21 03:37:27,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 111 letters. Loop has 111 letters. [2022-02-21 03:37:27,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 111 letters. Loop has 111 letters. [2022-02-21 03:37:27,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:37:27,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:37:27,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:37:27,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:27,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:27,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:27,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:27,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:27,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:27,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:27,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:27,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:27,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:27,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:27,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:27,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:27,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:27,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:27,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:27,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:27,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:27,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:27,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:27,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:27,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:27,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:27,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:27,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:27,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:27,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:27,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:27,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:27,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:27,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:27,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:27,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:27,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:27,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:27,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:27,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:27,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:27,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:27,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:27,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:27,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:27,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:27,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:27,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:27,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:27,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:27,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:27,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:27,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:27,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:27,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:27,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:27,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:27,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:27,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:27,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:27,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:27,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:27,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:27,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:27,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:27,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:27,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:27,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:27,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:27,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:27,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:27,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:27,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:27,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:27,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:27,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:27,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:27,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:27,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:27,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:27,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,678 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-21 03:37:27,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 98 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:27,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 98 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:27,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 98 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:37:27,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:27,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 174 transitions. cyclomatic complexity: 73 [2022-02-21 03:37:27,683 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2022-02-21 03:37:27,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 99 states and 153 transitions. [2022-02-21 03:37:27,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2022-02-21 03:37:27,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2022-02-21 03:37:27,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 153 transitions. [2022-02-21 03:37:27,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:27,686 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 153 transitions. [2022-02-21 03:37:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 153 transitions. [2022-02-21 03:37:27,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 59. [2022-02-21 03:37:27,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:27,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states and 153 transitions. Second operand has 59 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 58 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,688 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states and 153 transitions. Second operand has 59 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 58 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,688 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 59 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 58 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,689 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:27,692 INFO L93 Difference]: Finished difference Result 99 states and 153 transitions. [2022-02-21 03:37:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2022-02-21 03:37:27,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:27,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:27,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 58 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 99 states and 153 transitions. [2022-02-21 03:37:27,692 INFO L87 Difference]: Start difference. First operand has 59 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 58 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 99 states and 153 transitions. [2022-02-21 03:37:27,693 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:27,696 INFO L93 Difference]: Finished difference Result 99 states and 153 transitions. [2022-02-21 03:37:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2022-02-21 03:37:27,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:27,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:27,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:27,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 58 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2022-02-21 03:37:27,704 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 90 transitions. [2022-02-21 03:37:27,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:27,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:37:27,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:37:27,704 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:27,838 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2022-02-21 03:37:27,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:37:27,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:27,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2022-02-21 03:37:27,852 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:27,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 87 transitions. [2022-02-21 03:37:27,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2022-02-21 03:37:27,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2022-02-21 03:37:27,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 87 transitions. [2022-02-21 03:37:27,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:27,854 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 87 transitions. [2022-02-21 03:37:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 87 transitions. [2022-02-21 03:37:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-02-21 03:37:27,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:27,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states and 87 transitions. Second operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,856 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states and 87 transitions. Second operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,856 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,856 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:27,858 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2022-02-21 03:37:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2022-02-21 03:37:27,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:27,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:27,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 61 states and 87 transitions. [2022-02-21 03:37:27,858 INFO L87 Difference]: Start difference. First operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 61 states and 87 transitions. [2022-02-21 03:37:27,859 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:27,860 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2022-02-21 03:37:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2022-02-21 03:37:27,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:27,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:27,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:27,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2022-02-21 03:37:27,861 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 79 transitions. [2022-02-21 03:37:27,862 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 79 transitions. [2022-02-21 03:37:27,862 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:37:27,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 79 transitions. [2022-02-21 03:37:27,862 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:27,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:27,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:27,862 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:27,863 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:27,863 INFO L791 eck$LassoCheckResult]: Stem: 2747#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(22, 2);call #Ultimate.allocInit(12, 3); 2718#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 2719#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 2751#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 2723#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 2724#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 2726#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 2727#L47-3 assume !false; 2748#L38-1 assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; 2725#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 2737#L80-1 main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 2744#L29-2 assume !(0 == base2flt_~m#1 % 4294967296); 2741#L35-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 2742#L57-8 [2022-02-21 03:37:27,863 INFO L793 eck$LassoCheckResult]: Loop: 2742#L57-8 assume !false; 2734#L58-2 assume base2flt_~m#1 % 4294967296 >= 33554432; 2735#L59-2 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 2742#L57-8 [2022-02-21 03:37:27,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash 359266186, now seen corresponding path program 1 times [2022-02-21 03:37:27,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:27,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933194677] [2022-02-21 03:37:27,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:27,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:27,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {3011#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(22, 2);call #Ultimate.allocInit(12, 3); {3011#true} is VALID [2022-02-21 03:37:27,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {3011#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3011#true} is VALID [2022-02-21 03:37:27,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {3011#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {3011#true} is VALID [2022-02-21 03:37:27,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {3011#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {3011#true} is VALID [2022-02-21 03:37:27,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {3011#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:27,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !(0 == base2flt_~m#1 % 4294967296); {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:27,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume base2flt_~m#1 % 4294967296 < 16777216; {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:27,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !false; {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:27,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; {3012#false} is VALID [2022-02-21 03:37:27,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {3012#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {3012#false} is VALID [2022-02-21 03:37:27,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {3012#false} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3012#false} is VALID [2022-02-21 03:37:27,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {3012#false} assume !(0 == base2flt_~m#1 % 4294967296); {3012#false} is VALID [2022-02-21 03:37:27,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {3012#false} assume !(base2flt_~m#1 % 4294967296 < 16777216); {3012#false} is VALID [2022-02-21 03:37:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:27,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:27,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933194677] [2022-02-21 03:37:27,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933194677] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:27,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:27,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:37:27,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663467940] [2022-02-21 03:37:27,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:27,897 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:27,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:27,898 INFO L85 PathProgramCache]: Analyzing trace with hash 283142, now seen corresponding path program 1 times [2022-02-21 03:37:27,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:27,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910412945] [2022-02-21 03:37:27,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:27,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:27,905 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:27,911 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:27,940 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:27,940 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:27,940 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:27,941 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:27,941 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:27,941 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:27,941 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:27,941 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:27,941 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration4_Loop [2022-02-21 03:37:27,941 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:27,941 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:27,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:27,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:28,034 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:28,034 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:28,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:28,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:28,039 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:28,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:37:28,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:28,068 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:28,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:37:28,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:28,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:28,100 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:28,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:37:28,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:28,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:28,129 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:28,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:37:28,132 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:28,132 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:28,132 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:28,132 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:28,132 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:28,132 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:28,132 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:28,132 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:28,132 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration4_Loop [2022-02-21 03:37:28,133 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:28,133 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:28,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:28,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:28,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:28,261 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:28,261 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:28,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:28,262 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:28,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:37:28,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:28,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:28,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:28,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:28,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:28,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:28,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:28,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:28,295 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:28,297 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:28,297 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:28,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:28,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:28,300 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:28,310 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:28,310 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:28,310 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:28,311 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2022-02-21 03:37:28,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:37:28,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:28,345 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:28,348 INFO L390 LassoCheck]: Loop: "assume !false;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2;" [2022-02-21 03:37:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:28,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:28,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:28,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:28,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {3016#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(22, 2);call #Ultimate.allocInit(12, 3); {3016#unseeded} is VALID [2022-02-21 03:37:28,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {3016#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3016#unseeded} is VALID [2022-02-21 03:37:28,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {3016#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {3016#unseeded} is VALID [2022-02-21 03:37:28,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {3016#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {3016#unseeded} is VALID [2022-02-21 03:37:28,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {3016#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3016#unseeded} is VALID [2022-02-21 03:37:28,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {3016#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {3016#unseeded} is VALID [2022-02-21 03:37:28,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {3016#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {3016#unseeded} is VALID [2022-02-21 03:37:28,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {3016#unseeded} assume !false; {3016#unseeded} is VALID [2022-02-21 03:37:28,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {3016#unseeded} assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; {3016#unseeded} is VALID [2022-02-21 03:37:28,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {3016#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {3016#unseeded} is VALID [2022-02-21 03:37:28,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {3016#unseeded} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3016#unseeded} is VALID [2022-02-21 03:37:28,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {3016#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {3016#unseeded} is VALID [2022-02-21 03:37:28,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {3016#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {3016#unseeded} is VALID [2022-02-21 03:37:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:28,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:28,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:28,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {3019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {3019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:28,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {3019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {3019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:28,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {3019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; {3029#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:28,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:28,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,467 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:37:28,467 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 79 transitions. cyclomatic complexity: 31 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,570 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 79 transitions. cyclomatic complexity: 31. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 88 states and 133 transitions. Complement of second has 5 states. [2022-02-21 03:37:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:28,570 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:28,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 79 transitions. cyclomatic complexity: 31 [2022-02-21 03:37:28,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:28,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:28,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:28,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:28,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:28,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 133 transitions. [2022-02-21 03:37:28,573 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-02-21 03:37:28,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:28,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:28,573 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 79 transitions. cyclomatic complexity: 31 [2022-02-21 03:37:28,574 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:37:28,575 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:28,576 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:28,576 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 88 states and 133 transitions. cyclomatic complexity: 52 [2022-02-21 03:37:28,577 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:37:28,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:28,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:28,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:28,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 88 letters. Loop has 88 letters. [2022-02-21 03:37:28,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 88 letters. [2022-02-21 03:37:28,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 88 letters. Loop has 88 letters. [2022-02-21 03:37:28,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:37:28,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:37:28,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:37:28,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:28,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:28,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:28,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:28,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:28,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:28,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:28,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:28,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:28,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:28,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:28,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:28,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:28,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:28,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:28,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:28,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:28,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:28,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:28,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:28,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:28,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:28,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:28,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:28,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:28,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:28,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:28,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:28,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:28,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:28,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:28,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:28,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:28,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:28,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:28,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:28,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:28,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:28,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:28,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:28,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:28,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:28,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:28,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:28,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:28,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:28,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:28,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:28,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:28,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:28,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:28,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:28,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:28,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:28,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:28,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:28,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:28,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:28,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:28,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:28,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:28,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:28,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:28,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:28,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:28,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:28,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,602 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-02-21 03:37:28,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:28,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:28,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:37:28,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:28,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 133 transitions. cyclomatic complexity: 52 [2022-02-21 03:37:28,606 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-02-21 03:37:28,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 76 states and 112 transitions. [2022-02-21 03:37:28,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2022-02-21 03:37:28,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2022-02-21 03:37:28,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 112 transitions. [2022-02-21 03:37:28,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:28,609 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 112 transitions. [2022-02-21 03:37:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 112 transitions. [2022-02-21 03:37:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2022-02-21 03:37:28,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:28,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states and 112 transitions. Second operand has 56 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 55 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,611 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states and 112 transitions. Second operand has 56 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 55 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,611 INFO L87 Difference]: Start difference. First operand 76 states and 112 transitions. Second operand has 56 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 55 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,611 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:28,613 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2022-02-21 03:37:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2022-02-21 03:37:28,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:28,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:28,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 55 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 76 states and 112 transitions. [2022-02-21 03:37:28,614 INFO L87 Difference]: Start difference. First operand has 56 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 55 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 76 states and 112 transitions. [2022-02-21 03:37:28,614 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:28,616 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2022-02-21 03:37:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2022-02-21 03:37:28,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:28,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:28,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:28,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 55 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2022-02-21 03:37:28,617 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 83 transitions. [2022-02-21 03:37:28,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:28,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:37:28,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:37:28,618 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:28,720 INFO L93 Difference]: Finished difference Result 58 states and 84 transitions. [2022-02-21 03:37:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:37:28,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:28,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 84 transitions. [2022-02-21 03:37:28,734 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:37:28,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 83 transitions. [2022-02-21 03:37:28,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-02-21 03:37:28,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-02-21 03:37:28,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 83 transitions. [2022-02-21 03:37:28,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:28,735 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 83 transitions. [2022-02-21 03:37:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 83 transitions. [2022-02-21 03:37:28,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-02-21 03:37:28,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:28,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states and 83 transitions. Second operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,737 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states and 83 transitions. Second operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,737 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,738 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:28,739 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2022-02-21 03:37:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2022-02-21 03:37:28,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:28,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:28,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states and 83 transitions. [2022-02-21 03:37:28,739 INFO L87 Difference]: Start difference. First operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states and 83 transitions. [2022-02-21 03:37:28,739 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:28,740 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2022-02-21 03:37:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2022-02-21 03:37:28,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:28,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:28,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:28,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2022-02-21 03:37:28,742 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 82 transitions. [2022-02-21 03:37:28,742 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 82 transitions. [2022-02-21 03:37:28,742 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:37:28,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 82 transitions. [2022-02-21 03:37:28,742 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:37:28,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:28,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:28,743 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:28,743 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:28,743 INFO L791 eck$LassoCheckResult]: Stem: 3628#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(22, 2);call #Ultimate.allocInit(12, 3); 3596#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 3597#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 3632#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 3602#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 3603#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 3605#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 3606#L47-3 assume !false; 3630#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 3618#L47-2 assume base2flt_~m#1 % 4294967296 < 16777216; 3619#L47-3 assume !false; 3629#L38-1 assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; 3604#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 3621#L80-1 main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 3625#L29-2 assume !(0 == base2flt_~m#1 % 4294967296); 3622#L35-2 assume base2flt_~m#1 % 4294967296 < 16777216; 3624#L47-5 [2022-02-21 03:37:28,743 INFO L793 eck$LassoCheckResult]: Loop: 3624#L47-5 assume !false; 3627#L38-2 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 3635#L47-4 assume base2flt_~m#1 % 4294967296 < 16777216; 3624#L47-5 [2022-02-21 03:37:28,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:28,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1105339009, now seen corresponding path program 1 times [2022-02-21 03:37:28,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:28,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720267022] [2022-02-21 03:37:28,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:28,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:28,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {3886#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(22, 2);call #Ultimate.allocInit(12, 3); {3886#true} is VALID [2022-02-21 03:37:28,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {3886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3886#true} is VALID [2022-02-21 03:37:28,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {3886#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {3886#true} is VALID [2022-02-21 03:37:28,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {3886#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {3886#true} is VALID [2022-02-21 03:37:28,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {3886#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:28,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !(0 == base2flt_~m#1 % 4294967296); {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:28,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume base2flt_~m#1 % 4294967296 < 16777216; {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:28,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !false; {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:28,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:28,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume base2flt_~m#1 % 4294967296 < 16777216; {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:28,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume !false; {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:28,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; {3887#false} is VALID [2022-02-21 03:37:28,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {3887#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {3887#false} is VALID [2022-02-21 03:37:28,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {3887#false} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3887#false} is VALID [2022-02-21 03:37:28,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {3887#false} assume !(0 == base2flt_~m#1 % 4294967296); {3887#false} is VALID [2022-02-21 03:37:28,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {3887#false} assume base2flt_~m#1 % 4294967296 < 16777216; {3887#false} is VALID [2022-02-21 03:37:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:28,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:28,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720267022] [2022-02-21 03:37:28,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720267022] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:37:28,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396740177] [2022-02-21 03:37:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:28,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:37:28,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:28,784 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 03:37:28,802 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 03:37:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:28,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:28,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:28,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {3886#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(22, 2);call #Ultimate.allocInit(12, 3); {3886#true} is VALID [2022-02-21 03:37:28,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {3886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3886#true} is VALID [2022-02-21 03:37:28,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {3886#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {3886#true} is VALID [2022-02-21 03:37:28,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {3886#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {3886#true} is VALID [2022-02-21 03:37:28,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {3886#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} is VALID [2022-02-21 03:37:28,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} assume !(0 == base2flt_~m#1 % 4294967296); {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} is VALID [2022-02-21 03:37:28,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} assume base2flt_~m#1 % 4294967296 < 16777216; {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} is VALID [2022-02-21 03:37:28,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} assume !false; {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} is VALID [2022-02-21 03:37:28,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:28,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume base2flt_~m#1 % 4294967296 < 16777216; {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:28,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume !false; {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:28,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; {3887#false} is VALID [2022-02-21 03:37:28,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {3887#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {3887#false} is VALID [2022-02-21 03:37:28,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {3887#false} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3887#false} is VALID [2022-02-21 03:37:28,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {3887#false} assume !(0 == base2flt_~m#1 % 4294967296); {3887#false} is VALID [2022-02-21 03:37:28,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {3887#false} assume base2flt_~m#1 % 4294967296 < 16777216; {3887#false} is VALID [2022-02-21 03:37:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:28,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:37:29,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {3887#false} assume base2flt_~m#1 % 4294967296 < 16777216; {3887#false} is VALID [2022-02-21 03:37:29,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {3887#false} assume !(0 == base2flt_~m#1 % 4294967296); {3887#false} is VALID [2022-02-21 03:37:29,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {3887#false} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3887#false} is VALID [2022-02-21 03:37:29,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {3887#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {3887#false} is VALID [2022-02-21 03:37:29,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {3951#(not (<= (+ |ULTIMATE.start_base2flt_~e#1| 128) 0))} assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; {3887#false} is VALID [2022-02-21 03:37:29,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {3951#(not (<= (+ |ULTIMATE.start_base2flt_~e#1| 128) 0))} assume !false; {3951#(not (<= (+ |ULTIMATE.start_base2flt_~e#1| 128) 0))} is VALID [2022-02-21 03:37:29,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {3951#(not (<= (+ |ULTIMATE.start_base2flt_~e#1| 128) 0))} assume base2flt_~m#1 % 4294967296 < 16777216; {3951#(not (<= (+ |ULTIMATE.start_base2flt_~e#1| 128) 0))} is VALID [2022-02-21 03:37:29,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {3951#(not (<= (+ |ULTIMATE.start_base2flt_~e#1| 128) 0))} is VALID [2022-02-21 03:37:29,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} assume !false; {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} is VALID [2022-02-21 03:37:29,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} assume base2flt_~m#1 % 4294967296 < 16777216; {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} is VALID [2022-02-21 03:37:29,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} assume !(0 == base2flt_~m#1 % 4294967296); {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} is VALID [2022-02-21 03:37:29,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {3886#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} is VALID [2022-02-21 03:37:29,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {3886#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {3886#true} is VALID [2022-02-21 03:37:29,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {3886#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {3886#true} is VALID [2022-02-21 03:37:29,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {3886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3886#true} is VALID [2022-02-21 03:37:29,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {3886#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(22, 2);call #Ultimate.allocInit(12, 3); {3886#true} is VALID [2022-02-21 03:37:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:29,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396740177] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:37:29,026 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:37:29,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:37:29,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506588057] [2022-02-21 03:37:29,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:37:29,027 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:29,027 INFO L85 PathProgramCache]: Analyzing trace with hash 257383, now seen corresponding path program 1 times [2022-02-21 03:37:29,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:29,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290126783] [2022-02-21 03:37:29,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:29,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:29,041 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:29,045 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:29,073 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:29,073 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:29,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:29,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:29,073 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:29,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:29,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:29,073 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:29,073 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration5_Loop [2022-02-21 03:37:29,073 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:29,073 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:29,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 03:37:29,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:29,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:29,175 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:29,176 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:29,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:29,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:29,180 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:29,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:29,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:29,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:37:29,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:29,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:29,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:29,265 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:29,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:37:29,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:29,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:29,319 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:29,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:29,326 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:29,326 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:29,326 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:29,327 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:29,327 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:29,327 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:29,327 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:29,327 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:29,327 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration5_Loop [2022-02-21 03:37:29,327 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:29,327 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:29,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:29,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:29,407 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:29,408 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:29,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:29,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:29,409 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:29,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:29,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:29,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:29,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:29,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:29,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:29,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:29,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:29,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:37:29,439 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:29,442 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:29,442 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:29,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:29,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:29,444 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:29,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:37:29,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:29,446 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:29,446 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:29,446 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2022-02-21 03:37:29,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:37:29,480 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:29,485 INFO L390 LassoCheck]: Loop: "assume !false;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1;" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2022-02-21 03:37:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:29,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:29,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:29,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {3985#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(22, 2);call #Ultimate.allocInit(12, 3); {3985#unseeded} is VALID [2022-02-21 03:37:29,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {3985#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3985#unseeded} is VALID [2022-02-21 03:37:29,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {3985#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {3985#unseeded} is VALID [2022-02-21 03:37:29,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {3985#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {3985#unseeded} is VALID [2022-02-21 03:37:29,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {3985#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3985#unseeded} is VALID [2022-02-21 03:37:29,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {3985#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {3985#unseeded} is VALID [2022-02-21 03:37:29,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {3985#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {3985#unseeded} is VALID [2022-02-21 03:37:29,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {3985#unseeded} assume !false; {3985#unseeded} is VALID [2022-02-21 03:37:29,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {3985#unseeded} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {3985#unseeded} is VALID [2022-02-21 03:37:29,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {3985#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {3985#unseeded} is VALID [2022-02-21 03:37:29,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {3985#unseeded} assume !false; {3985#unseeded} is VALID [2022-02-21 03:37:29,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {3985#unseeded} assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; {3985#unseeded} is VALID [2022-02-21 03:37:29,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {3985#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {3985#unseeded} is VALID [2022-02-21 03:37:29,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {3985#unseeded} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3985#unseeded} is VALID [2022-02-21 03:37:29,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {3985#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {3985#unseeded} is VALID [2022-02-21 03:37:29,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {3985#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {3985#unseeded} is VALID [2022-02-21 03:37:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:29,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:29,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:29,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {3988#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !false; {3988#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} is VALID [2022-02-21 03:37:29,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {3988#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {4051#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} is VALID [2022-02-21 03:37:29,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {4051#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} assume base2flt_~m#1 % 4294967296 < 16777216; {3998#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))) unseeded)} is VALID [2022-02-21 03:37:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:29,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:29,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:29,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:29,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,657 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:37:29,657 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 82 transitions. cyclomatic complexity: 31 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:29,760 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 82 transitions. cyclomatic complexity: 31. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 92 states and 137 transitions. Complement of second has 5 states. [2022-02-21 03:37:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:29,761 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:29,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 82 transitions. cyclomatic complexity: 31 [2022-02-21 03:37:29,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:29,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:29,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:29,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:29,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:29,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:29,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 137 transitions. [2022-02-21 03:37:29,762 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:29,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:29,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:29,763 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 56 states and 82 transitions. cyclomatic complexity: 31 [2022-02-21 03:37:29,763 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:37:29,763 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:29,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:29,764 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:29,764 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 92 states and 137 transitions. cyclomatic complexity: 52 [2022-02-21 03:37:29,765 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:37:29,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:29,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:29,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:29,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:29,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:29,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:29,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 92 letters. Loop has 92 letters. [2022-02-21 03:37:29,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 92 letters. [2022-02-21 03:37:29,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 92 letters. Loop has 92 letters. [2022-02-21 03:37:29,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:37:29,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:37:29,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:37:29,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:29,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:29,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:29,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:29,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:29,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:29,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:29,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:29,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:29,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:29,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:29,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:29,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:29,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:29,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:29,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:29,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:29,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:29,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:29,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:29,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:29,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:29,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:29,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:29,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:29,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:29,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:29,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:29,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:29,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:29,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:29,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:29,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:29,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:29,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:29,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:29,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:29,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:29,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:29,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:29,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:29,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:29,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:29,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:29,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:29,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:29,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:29,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:29,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:29,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:29,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:29,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:29,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:29,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:29,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:29,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:29,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:29,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,786 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-21 03:37:29,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 92 transitions. Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:29,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 92 transitions. Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:29,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 92 transitions. Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:37:29,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:29,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. cyclomatic complexity: 52 [2022-02-21 03:37:29,790 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:29,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 80 states and 116 transitions. [2022-02-21 03:37:29,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-02-21 03:37:29,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-02-21 03:37:29,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 116 transitions. [2022-02-21 03:37:29,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:29,792 INFO L681 BuchiCegarLoop]: Abstraction has 80 states and 116 transitions. [2022-02-21 03:37:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 116 transitions. [2022-02-21 03:37:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2022-02-21 03:37:29,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:29,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states and 116 transitions. Second operand has 59 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:29,793 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states and 116 transitions. Second operand has 59 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:29,793 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 59 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:29,794 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:29,795 INFO L93 Difference]: Finished difference Result 81 states and 117 transitions. [2022-02-21 03:37:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2022-02-21 03:37:29,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:29,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:29,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 80 states and 116 transitions. [2022-02-21 03:37:29,796 INFO L87 Difference]: Start difference. First operand has 59 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 80 states and 116 transitions. [2022-02-21 03:37:29,796 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:29,797 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2022-02-21 03:37:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2022-02-21 03:37:29,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:29,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:29,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:29,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2022-02-21 03:37:29,799 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 86 transitions. [2022-02-21 03:37:29,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:29,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:37:29,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:37:29,800 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:29,998 INFO L93 Difference]: Finished difference Result 113 states and 158 transitions. [2022-02-21 03:37:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:37:29,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:30,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 158 transitions. [2022-02-21 03:37:30,025 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:37:30,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 107 states and 152 transitions. [2022-02-21 03:37:30,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2022-02-21 03:37:30,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2022-02-21 03:37:30,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 152 transitions. [2022-02-21 03:37:30,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:30,027 INFO L681 BuchiCegarLoop]: Abstraction has 107 states and 152 transitions. [2022-02-21 03:37:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 152 transitions. [2022-02-21 03:37:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 74. [2022-02-21 03:37:30,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:30,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states and 152 transitions. Second operand has 74 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 73 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,029 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states and 152 transitions. Second operand has 74 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 73 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,029 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 74 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 73 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,030 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:30,032 INFO L93 Difference]: Finished difference Result 107 states and 152 transitions. [2022-02-21 03:37:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2022-02-21 03:37:30,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:30,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:30,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 73 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 107 states and 152 transitions. [2022-02-21 03:37:30,033 INFO L87 Difference]: Start difference. First operand has 74 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 73 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 107 states and 152 transitions. [2022-02-21 03:37:30,033 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:30,035 INFO L93 Difference]: Finished difference Result 107 states and 152 transitions. [2022-02-21 03:37:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2022-02-21 03:37:30,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:30,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:30,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:30,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 73 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 108 transitions. [2022-02-21 03:37:30,037 INFO L704 BuchiCegarLoop]: Abstraction has 74 states and 108 transitions. [2022-02-21 03:37:30,037 INFO L587 BuchiCegarLoop]: Abstraction has 74 states and 108 transitions. [2022-02-21 03:37:30,037 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:37:30,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 108 transitions. [2022-02-21 03:37:30,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:37:30,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:30,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:30,038 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:30,038 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:30,039 INFO L791 eck$LassoCheckResult]: Stem: 4690#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(22, 2);call #Ultimate.allocInit(12, 3); 4657#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 4658#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 4695#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 4664#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 4665#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 4666#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 4667#L47-3 assume !false; 4702#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 4679#L47-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 4670#L73-1 assume 0 == base2flt_~m#1 || 0 == ~bitwiseComplement(16777216);base2flt_~m#1 := 0; 4647#L76-15 assume !((1 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))) || ((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 1 == 16777216 * (128 + base2flt_~e#1))); 4651#L77-9 assume !(0 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))); 4652#L77-11 assume !((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 0 == 16777216 * (128 + base2flt_~e#1)); 4700#L77-13 assume !(base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0);base2flt_~res~0#1 := base2flt_#t~nondet5#1;havoc base2flt_#t~nondet5#1; 4662#L77-15 base2flt_~__retres4~0#1 := base2flt_~res~0#1; 4663#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 4678#L80-1 main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 4684#L29-2 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 4644#L79-2 base2flt_#res#1 := base2flt_~__retres4~0#1; 4645#L80-2 main_#t~ret24#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 4694#L29-3 assume !(0 == base2flt_~m#1 % 4294967296); 4659#L35-3 assume base2flt_~m#1 % 4294967296 < 16777216; 4660#L47-7 [2022-02-21 03:37:30,044 INFO L793 eck$LassoCheckResult]: Loop: 4660#L47-7 assume !false; 4649#L38-3 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 4650#L47-6 assume base2flt_~m#1 % 4294967296 < 16777216; 4660#L47-7 [2022-02-21 03:37:30,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 488953666, now seen corresponding path program 1 times [2022-02-21 03:37:30,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:30,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788470022] [2022-02-21 03:37:30,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:30,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:30,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:30,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {5206#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(22, 2);call #Ultimate.allocInit(12, 3); {5206#true} is VALID [2022-02-21 03:37:30,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {5206#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5206#true} is VALID [2022-02-21 03:37:30,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {5206#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {5206#true} is VALID [2022-02-21 03:37:30,139 INFO L290 TraceCheckUtils]: 3: Hoare triple {5206#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {5206#true} is VALID [2022-02-21 03:37:30,140 INFO L290 TraceCheckUtils]: 4: Hoare triple {5206#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:30,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !(0 == base2flt_~m#1 % 4294967296); {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:30,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume base2flt_~m#1 % 4294967296 < 16777216; {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:30,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !false; {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:30,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {5209#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:30,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {5209#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume !(base2flt_~m#1 % 4294967296 < 16777216); {5209#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:30,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {5209#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume 0 == base2flt_~m#1 || 0 == ~bitwiseComplement(16777216);base2flt_~m#1 := 0; {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} is VALID [2022-02-21 03:37:30,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} assume !((1 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))) || ((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 1 == 16777216 * (128 + base2flt_~e#1))); {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} is VALID [2022-02-21 03:37:30,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} assume !(0 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))); {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} is VALID [2022-02-21 03:37:30,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} assume !((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 0 == 16777216 * (128 + base2flt_~e#1)); {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} is VALID [2022-02-21 03:37:30,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} assume !(base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0);base2flt_~res~0#1 := base2flt_#t~nondet5#1;havoc base2flt_#t~nondet5#1; {5207#false} is VALID [2022-02-21 03:37:30,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {5207#false} base2flt_~__retres4~0#1 := base2flt_~res~0#1; {5207#false} is VALID [2022-02-21 03:37:30,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {5207#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {5207#false} is VALID [2022-02-21 03:37:30,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {5207#false} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5207#false} is VALID [2022-02-21 03:37:30,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {5207#false} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {5207#false} is VALID [2022-02-21 03:37:30,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {5207#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {5207#false} is VALID [2022-02-21 03:37:30,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {5207#false} main_#t~ret24#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5207#false} is VALID [2022-02-21 03:37:30,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {5207#false} assume !(0 == base2flt_~m#1 % 4294967296); {5207#false} is VALID [2022-02-21 03:37:30,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {5207#false} assume base2flt_~m#1 % 4294967296 < 16777216; {5207#false} is VALID [2022-02-21 03:37:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:30,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:30,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788470022] [2022-02-21 03:37:30,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788470022] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:30,148 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:30,148 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:37:30,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053929538] [2022-02-21 03:37:30,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:30,148 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:30,149 INFO L85 PathProgramCache]: Analyzing trace with hash 361648, now seen corresponding path program 1 times [2022-02-21 03:37:30,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:30,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570266554] [2022-02-21 03:37:30,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:30,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:30,155 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:30,158 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:30,183 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:30,183 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:30,183 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:30,183 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:30,183 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:30,183 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:30,184 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:30,184 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:30,184 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration6_Loop [2022-02-21 03:37:30,184 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:30,184 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:30,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:30,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:30,264 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:30,265 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:30,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:30,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:30,266 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:30,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:37:30,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:30,272 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:30,294 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 03:37:30,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:30,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:30,296 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:30,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:37:30,298 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:30,298 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:30,324 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:30,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:30,327 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:30,328 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:30,328 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:30,328 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:30,328 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:30,328 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:30,328 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:30,328 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:30,328 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration6_Loop [2022-02-21 03:37:30,328 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:30,328 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:30,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:30,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:30,419 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:30,419 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:30,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:30,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:30,421 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:30,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:30,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:30,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:30,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:30,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:30,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:30,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:30,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:30,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:37:30,455 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:30,457 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:30,457 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:30,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:30,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:30,460 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:30,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:37:30,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:30,515 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:30,515 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:30,516 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2022-02-21 03:37:30,530 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 03:37:30,536 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:30,539 INFO L390 LassoCheck]: Loop: "assume !false;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1;" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2022-02-21 03:37:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:30,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:30,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:30,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {5213#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(22, 2);call #Ultimate.allocInit(12, 3); {5213#unseeded} is VALID [2022-02-21 03:37:30,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {5213#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:30,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {5213#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {5213#unseeded} is VALID [2022-02-21 03:37:30,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {5213#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:30,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {5213#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:30,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {5213#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {5213#unseeded} is VALID [2022-02-21 03:37:30,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {5213#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {5213#unseeded} is VALID [2022-02-21 03:37:30,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {5213#unseeded} assume !false; {5213#unseeded} is VALID [2022-02-21 03:37:30,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {5213#unseeded} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {5213#unseeded} is VALID [2022-02-21 03:37:30,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {5213#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {5213#unseeded} is VALID [2022-02-21 03:37:30,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {5213#unseeded} assume 0 == base2flt_~m#1 || 0 == ~bitwiseComplement(16777216);base2flt_~m#1 := 0; {5213#unseeded} is VALID [2022-02-21 03:37:30,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {5213#unseeded} assume !((1 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))) || ((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 1 == 16777216 * (128 + base2flt_~e#1))); {5213#unseeded} is VALID [2022-02-21 03:37:30,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {5213#unseeded} assume !(0 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))); {5213#unseeded} is VALID [2022-02-21 03:37:30,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {5213#unseeded} assume !((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 0 == 16777216 * (128 + base2flt_~e#1)); {5213#unseeded} is VALID [2022-02-21 03:37:30,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {5213#unseeded} assume !(base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0);base2flt_~res~0#1 := base2flt_#t~nondet5#1;havoc base2flt_#t~nondet5#1; {5213#unseeded} is VALID [2022-02-21 03:37:30,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {5213#unseeded} base2flt_~__retres4~0#1 := base2flt_~res~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:30,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {5213#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:30,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {5213#unseeded} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:30,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {5213#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {5213#unseeded} is VALID [2022-02-21 03:37:30,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {5213#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:30,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {5213#unseeded} main_#t~ret24#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:30,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {5213#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {5213#unseeded} is VALID [2022-02-21 03:37:30,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {5213#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {5213#unseeded} is VALID [2022-02-21 03:37:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:30,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:30,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:30,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {5216#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !false; {5216#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} is VALID [2022-02-21 03:37:30,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {5216#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {5300#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} is VALID [2022-02-21 03:37:30,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {5300#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} assume base2flt_~m#1 % 4294967296 < 16777216; {5226#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))) unseeded)} is VALID [2022-02-21 03:37:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:30,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:30,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,707 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:37:30,707 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 108 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,757 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 108 transitions. cyclomatic complexity: 39. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 112 transitions. Complement of second has 4 states. [2022-02-21 03:37:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:30,757 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:30,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 108 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:30,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:30,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:30,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:30,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:30,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:30,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 112 transitions. [2022-02-21 03:37:30,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:30,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:30,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:30,759 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 74 states and 108 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:30,760 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:37:30,760 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:30,761 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:30,761 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 78 states and 112 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:30,761 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:37:30,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:30,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:30,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:30,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:37:30,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:37:30,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:37:30,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:37:30,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:37:30,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:37:30,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:30,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:30,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:30,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:30,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:30,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:30,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:30,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:30,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:30,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:30,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:30,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:30,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:30,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:30,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:30,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:30,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:30,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:30,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:30,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:30,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:30,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:30,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:30,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:30,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,768 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-21 03:37:30,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:30,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:37:30,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 23 letters. Loop has 6 letters. [2022-02-21 03:37:30,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:30,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 112 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:30,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:30,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 104 transitions. [2022-02-21 03:37:30,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-02-21 03:37:30,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-02-21 03:37:30,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 104 transitions. [2022-02-21 03:37:30,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:30,773 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 104 transitions. [2022-02-21 03:37:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 104 transitions. [2022-02-21 03:37:30,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-02-21 03:37:30,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:30,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states and 104 transitions. Second operand has 71 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 70 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,775 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states and 104 transitions. Second operand has 71 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 70 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,775 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand has 71 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 70 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,775 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:30,777 INFO L93 Difference]: Finished difference Result 73 states and 106 transitions. [2022-02-21 03:37:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2022-02-21 03:37:30,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:30,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:30,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 70 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 71 states and 104 transitions. [2022-02-21 03:37:30,777 INFO L87 Difference]: Start difference. First operand has 71 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 70 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 71 states and 104 transitions. [2022-02-21 03:37:30,778 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:30,779 INFO L93 Difference]: Finished difference Result 73 states and 106 transitions. [2022-02-21 03:37:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2022-02-21 03:37:30,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:30,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:30,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:30,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 70 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2022-02-21 03:37:30,781 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 104 transitions. [2022-02-21 03:37:30,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:30,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:37:30,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:37:30,781 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:30,934 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2022-02-21 03:37:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:37:30,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:30,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 129 transitions. [2022-02-21 03:37:30,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:30,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 129 transitions. [2022-02-21 03:37:30,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2022-02-21 03:37:30,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2022-02-21 03:37:30,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 129 transitions. [2022-02-21 03:37:30,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:30,962 INFO L681 BuchiCegarLoop]: Abstraction has 91 states and 129 transitions. [2022-02-21 03:37:30,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 129 transitions. [2022-02-21 03:37:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2022-02-21 03:37:30,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:30,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states and 129 transitions. Second operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,968 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states and 129 transitions. Second operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,968 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,969 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:30,971 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2022-02-21 03:37:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2022-02-21 03:37:30,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:30,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:30,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 91 states and 129 transitions. [2022-02-21 03:37:30,971 INFO L87 Difference]: Start difference. First operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 91 states and 129 transitions. [2022-02-21 03:37:30,972 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:30,974 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2022-02-21 03:37:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2022-02-21 03:37:30,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:30,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:30,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:30,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2022-02-21 03:37:30,976 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 110 transitions. [2022-02-21 03:37:30,976 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 110 transitions. [2022-02-21 03:37:30,976 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:37:30,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 110 transitions. [2022-02-21 03:37:30,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:30,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:30,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:30,977 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:30,977 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:30,977 INFO L791 eck$LassoCheckResult]: Stem: 5943#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(22, 2);call #Ultimate.allocInit(12, 3); 5911#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 5912#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 5947#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 5915#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 5916#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 5919#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 5920#L47-3 assume !false; 5955#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 5964#L47-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 5965#L73-1 assume 0 == base2flt_~m#1 || 0 == ~bitwiseComplement(16777216);base2flt_~m#1 := 0; 5975#L76-15 assume !((1 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))) || ((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 1 == 16777216 * (128 + base2flt_~e#1))); 5974#L77-9 assume !(0 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))); 5973#L77-11 assume !((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 0 == 16777216 * (128 + base2flt_~e#1)); 5954#L77-13 assume base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0;abs_77 := (if base2flt_~m#1 < 16777216 * (128 + base2flt_~e#1) then 16777216 * (128 + base2flt_~e#1) else base2flt_~m#1);assume base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0;assume base2flt_~res~0#1 >= abs_77; 5917#L77-15 base2flt_~__retres4~0#1 := base2flt_~res~0#1; 5918#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 5933#L80-1 main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 5937#L29-2 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 5903#L79-2 base2flt_#res#1 := base2flt_~__retres4~0#1; 5904#L80-2 main_#t~ret24#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 5946#L29-3 assume !(0 == base2flt_~m#1 % 4294967296); 5913#L35-3 assume !(base2flt_~m#1 % 4294967296 < 16777216); 5914#L57-11 [2022-02-21 03:37:30,977 INFO L793 eck$LassoCheckResult]: Loop: 5914#L57-11 assume !false; 5921#L58-3 assume base2flt_~m#1 % 4294967296 >= 33554432; 5922#L59-3 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 5914#L57-11 [2022-02-21 03:37:30,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash -191104678, now seen corresponding path program 1 times [2022-02-21 03:37:30,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:30,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437803975] [2022-02-21 03:37:30,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:30,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:31,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {6422#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(22, 2);call #Ultimate.allocInit(12, 3); {6422#true} is VALID [2022-02-21 03:37:31,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {6422#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6422#true} is VALID [2022-02-21 03:37:31,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {6422#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {6422#true} is VALID [2022-02-21 03:37:31,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {6422#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {6422#true} is VALID [2022-02-21 03:37:31,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {6422#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} is VALID [2022-02-21 03:37:31,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} assume !(0 == base2flt_~m#1 % 4294967296); {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} is VALID [2022-02-21 03:37:31,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} assume base2flt_~m#1 % 4294967296 < 16777216; {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} is VALID [2022-02-21 03:37:31,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} assume !false; {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} is VALID [2022-02-21 03:37:31,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {6425#(and (not (<= (+ (div |ULTIMATE.start_base2flt_~m#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_base2flt_~m#1| 2))} is VALID [2022-02-21 03:37:31,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {6425#(and (not (<= (+ (div |ULTIMATE.start_base2flt_~m#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_base2flt_~m#1| 2))} assume !(base2flt_~m#1 % 4294967296 < 16777216); {6423#false} is VALID [2022-02-21 03:37:31,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {6423#false} assume 0 == base2flt_~m#1 || 0 == ~bitwiseComplement(16777216);base2flt_~m#1 := 0; {6423#false} is VALID [2022-02-21 03:37:31,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {6423#false} assume !((1 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))) || ((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 1 == 16777216 * (128 + base2flt_~e#1))); {6423#false} is VALID [2022-02-21 03:37:31,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {6423#false} assume !(0 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))); {6423#false} is VALID [2022-02-21 03:37:31,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {6423#false} assume !((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 0 == 16777216 * (128 + base2flt_~e#1)); {6423#false} is VALID [2022-02-21 03:37:31,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {6423#false} assume base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0;abs_77 := (if base2flt_~m#1 < 16777216 * (128 + base2flt_~e#1) then 16777216 * (128 + base2flt_~e#1) else base2flt_~m#1);assume base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0;assume base2flt_~res~0#1 >= abs_77; {6423#false} is VALID [2022-02-21 03:37:31,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {6423#false} base2flt_~__retres4~0#1 := base2flt_~res~0#1; {6423#false} is VALID [2022-02-21 03:37:31,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {6423#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {6423#false} is VALID [2022-02-21 03:37:31,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {6423#false} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6423#false} is VALID [2022-02-21 03:37:31,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {6423#false} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {6423#false} is VALID [2022-02-21 03:37:31,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {6423#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {6423#false} is VALID [2022-02-21 03:37:31,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {6423#false} main_#t~ret24#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6423#false} is VALID [2022-02-21 03:37:31,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {6423#false} assume !(0 == base2flt_~m#1 % 4294967296); {6423#false} is VALID [2022-02-21 03:37:31,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {6423#false} assume !(base2flt_~m#1 % 4294967296 < 16777216); {6423#false} is VALID [2022-02-21 03:37:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:31,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:31,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437803975] [2022-02-21 03:37:31,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437803975] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:31,092 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:31,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:37:31,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615379752] [2022-02-21 03:37:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:31,092 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:31,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash 387407, now seen corresponding path program 1 times [2022-02-21 03:37:31,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:31,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43992390] [2022-02-21 03:37:31,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:31,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:31,104 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:31,111 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:31,135 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:31,135 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:31,135 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:31,135 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:31,135 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:31,135 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:31,136 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:31,136 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:31,136 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration7_Loop [2022-02-21 03:37:31,136 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:31,136 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:31,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:31,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:31,248 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:31,249 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:31,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:31,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:31,250 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:31,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:37:31,252 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:31,252 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:31,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:31,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:31,280 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:31,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:37:31,291 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:31,291 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:31,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:31,331 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:31,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:31,335 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:31,335 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:31,335 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:31,335 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:31,335 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:31,335 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:31,335 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:31,335 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:31,336 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_5a.c.cil.c_Iteration7_Loop [2022-02-21 03:37:31,336 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:31,336 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:31,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:31,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:31,440 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:31,440 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:31,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:31,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:31,441 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:31,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:37:31,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:31,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:31,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:31,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:31,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:31,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:31,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:31,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:31,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:31,480 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:31,481 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:31,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:31,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:31,484 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:31,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:37:31,487 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:31,487 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:31,487 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:31,487 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2022-02-21 03:37:31,503 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 03:37:31,507 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:31,510 INFO L390 LassoCheck]: Loop: "assume !false;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2;" [2022-02-21 03:37:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:31,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:31,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:31,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:31,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {6428#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(22, 2);call #Ultimate.allocInit(12, 3); {6428#unseeded} is VALID [2022-02-21 03:37:31,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {6428#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:31,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {6428#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {6428#unseeded} is VALID [2022-02-21 03:37:31,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {6428#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:31,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {6428#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:31,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {6428#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {6428#unseeded} is VALID [2022-02-21 03:37:31,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {6428#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {6428#unseeded} is VALID [2022-02-21 03:37:31,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {6428#unseeded} assume !false; {6428#unseeded} is VALID [2022-02-21 03:37:31,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {6428#unseeded} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {6428#unseeded} is VALID [2022-02-21 03:37:31,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {6428#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {6428#unseeded} is VALID [2022-02-21 03:37:31,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {6428#unseeded} assume 0 == base2flt_~m#1 || 0 == ~bitwiseComplement(16777216);base2flt_~m#1 := 0; {6428#unseeded} is VALID [2022-02-21 03:37:31,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {6428#unseeded} assume !((1 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))) || ((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 1 == 16777216 * (128 + base2flt_~e#1))); {6428#unseeded} is VALID [2022-02-21 03:37:31,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {6428#unseeded} assume !(0 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))); {6428#unseeded} is VALID [2022-02-21 03:37:31,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {6428#unseeded} assume !((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 0 == 16777216 * (128 + base2flt_~e#1)); {6428#unseeded} is VALID [2022-02-21 03:37:31,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {6428#unseeded} assume base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0;abs_77 := (if base2flt_~m#1 < 16777216 * (128 + base2flt_~e#1) then 16777216 * (128 + base2flt_~e#1) else base2flt_~m#1);assume base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0;assume base2flt_~res~0#1 >= abs_77; {6428#unseeded} is VALID [2022-02-21 03:37:31,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {6428#unseeded} base2flt_~__retres4~0#1 := base2flt_~res~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:31,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {6428#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:31,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {6428#unseeded} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:31,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {6428#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {6428#unseeded} is VALID [2022-02-21 03:37:31,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {6428#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:31,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {6428#unseeded} main_#t~ret24#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:31,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {6428#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {6428#unseeded} is VALID [2022-02-21 03:37:31,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {6428#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {6428#unseeded} is VALID [2022-02-21 03:37:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:31,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:31,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:31,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {6431#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {6431#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:31,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {6431#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {6431#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:31,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {6431#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; {6441#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:31,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:31,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:31,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:31,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,647 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:37:31,648 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 110 transitions. cyclomatic complexity: 38 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:31,701 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 110 transitions. cyclomatic complexity: 38. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 79 states and 114 transitions. Complement of second has 4 states. [2022-02-21 03:37:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:31,701 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:31,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 110 transitions. cyclomatic complexity: 38 [2022-02-21 03:37:31,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:31,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:31,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:31,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:31,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:31,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:31,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 114 transitions. [2022-02-21 03:37:31,704 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:31,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:31,704 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 76 states and 110 transitions. cyclomatic complexity: 38 [2022-02-21 03:37:31,704 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:37:31,705 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:31,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:31,705 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:31,705 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 79 states and 114 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:31,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 114 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:31,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:31,706 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:37:31,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:31,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:31,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:31,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:31,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:31,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:31,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 79 letters. Loop has 79 letters. [2022-02-21 03:37:31,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 79 letters. [2022-02-21 03:37:31,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 79 letters. Loop has 79 letters. [2022-02-21 03:37:31,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:37:31,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:37:31,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:37:31,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:31,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:31,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:31,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:31,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:31,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:31,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:31,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:31,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:31,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:31,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:31,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:31,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:31,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:31,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:31,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,712 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-02-21 03:37:31,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 69 transitions. Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:31,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 69 transitions. Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:37:31,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 69 transitions. Stem has 23 letters. Loop has 6 letters. [2022-02-21 03:37:31,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:31,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 114 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:31,715 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:31,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 0 states and 0 transitions. [2022-02-21 03:37:31,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:37:31,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:37:31,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:37:31,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:31,716 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:31,716 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:31,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:37:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:37:31,717 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:31,717 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:37:31,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:37:31,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:31,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:31,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 03:37:31,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:31,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:37:31,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:37:31,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:37:31,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:37:31,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:31,740 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:31,740 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:31,740 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:31,740 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:37:31,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:37:31,741 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:31,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:31,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:37:31 BoogieIcfgContainer [2022-02-21 03:37:31,747 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:37:31,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:37:31,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:37:31,748 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:37:31,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:23" (3/4) ... [2022-02-21 03:37:31,750 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:37:31,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:37:31,751 INFO L158 Benchmark]: Toolchain (without parser) took 9355.19ms. Allocated memory was 90.2MB in the beginning and 180.4MB in the end (delta: 90.2MB). Free memory was 55.2MB in the beginning and 114.3MB in the end (delta: -59.1MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2022-02-21 03:37:31,752 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 90.2MB. Free memory was 59.1MB in the beginning and 59.0MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:31,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.54ms. Allocated memory is still 90.2MB. Free memory was 55.0MB in the beginning and 60.7MB in the end (delta: -5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:37:31,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.65ms. Allocated memory is still 90.2MB. Free memory was 60.7MB in the beginning and 56.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:37:31,752 INFO L158 Benchmark]: Boogie Preprocessor took 57.09ms. Allocated memory is still 90.2MB. Free memory was 56.6MB in the beginning and 53.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:37:31,753 INFO L158 Benchmark]: RCFGBuilder took 1022.02ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 53.8MB in the beginning and 67.8MB in the end (delta: -14.1MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2022-02-21 03:37:31,753 INFO L158 Benchmark]: BuchiAutomizer took 7827.47ms. Allocated memory was 111.1MB in the beginning and 180.4MB in the end (delta: 69.2MB). Free memory was 67.3MB in the beginning and 115.4MB in the end (delta: -48.1MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2022-02-21 03:37:31,753 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 180.4MB. Free memory was 115.4MB in the beginning and 114.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:37:31,754 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.22ms. Allocated memory is still 90.2MB. Free memory was 59.1MB in the beginning and 59.0MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.54ms. Allocated memory is still 90.2MB. Free memory was 55.0MB in the beginning and 60.7MB in the end (delta: -5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.65ms. Allocated memory is still 90.2MB. Free memory was 60.7MB in the beginning and 56.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.09ms. Allocated memory is still 90.2MB. Free memory was 56.6MB in the beginning and 53.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1022.02ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 53.8MB in the beginning and 67.8MB in the end (delta: -14.1MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 7827.47ms. Allocated memory was 111.1MB in the beginning and 180.4MB in the end (delta: 69.2MB). Free memory was 67.3MB in the beginning and 115.4MB in the end (delta: -48.1MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 180.4MB. Free memory was 115.4MB in the beginning and 114.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (6 trivial, 7 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * e + 253 and consists of 4 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.3s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 210 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 76 states and ocurred in iteration 6. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 905 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 905 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 382 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1052 mSDtfsCounter, 382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp56 ukn100 mio100 lsp100 div561 bol100 ite100 ukn100 eq132 hnf96 smp42 dnf100 smp100 tf105 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:37:31,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:31,997 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 03:37:32,187 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