./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.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/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.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 d0919f37d9ec3b35ef959618459b2f9ff909696f753b572bc67b87ebda7b05b0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:26:27,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:26:27,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:26:27,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:26:27,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:26:27,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:26:27,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:26:27,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:26:27,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:26:27,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:26:27,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:26:27,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:26:27,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:26:27,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:26:27,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:26:27,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:26:27,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:26:27,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:26:27,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:26:27,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:26:27,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:26:27,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:26:27,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:26:27,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:26:27,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:26:27,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:26:27,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:26:27,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:26:27,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:26:27,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:26:27,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:26:27,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:26:27,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:26:27,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:26:27,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:26:27,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:26:27,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:26:27,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:26:27,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:26:27,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:26:27,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:26:27,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:26:27,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:26:27,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:26:27,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:26:27,588 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:26:27,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:26:27,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:26:27,589 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:26:27,589 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:26:27,589 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:26:27,589 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:26:27,590 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:26:27,590 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:26:27,590 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:26:27,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:26:27,591 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:26:27,591 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:26:27,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:26:27,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:26:27,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:26:27,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:26:27,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:26:27,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:26:27,592 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:26:27,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:26:27,592 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:26:27,592 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:26:27,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:26:27,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:26:27,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:26:27,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:26:27,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:26:27,594 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:26:27,594 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 -> d0919f37d9ec3b35ef959618459b2f9ff909696f753b572bc67b87ebda7b05b0 [2022-02-21 04:26:27,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:26:27,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:26:27,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:26:27,790 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:26:27,790 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:26:27,791 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2022-02-21 04:26:27,842 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a2a2df6/5936bdc958684ca191d6a41885a145f7/FLAG3a9c3163d [2022-02-21 04:26:28,224 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:26:28,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2022-02-21 04:26:28,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a2a2df6/5936bdc958684ca191d6a41885a145f7/FLAG3a9c3163d [2022-02-21 04:26:28,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a2a2df6/5936bdc958684ca191d6a41885a145f7 [2022-02-21 04:26:28,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:26:28,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:26:28,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:26:28,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:26:28,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:26:28,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:26:28" (1/1) ... [2022-02-21 04:26:28,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bff08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:28, skipping insertion in model container [2022-02-21 04:26:28,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:26:28" (1/1) ... [2022-02-21 04:26:28,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:26:28,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:26:28,942 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/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c[24198,24211] [2022-02-21 04:26:28,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:26:28,953 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:26:29,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c[24198,24211] [2022-02-21 04:26:29,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:26:29,067 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:26:29,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:29 WrapperNode [2022-02-21 04:26:29,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:26:29,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:26:29,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:26:29,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:26:29,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:29" (1/1) ... [2022-02-21 04:26:29,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:29" (1/1) ... [2022-02-21 04:26:29,152 INFO L137 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 901 [2022-02-21 04:26:29,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:26:29,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:26:29,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:26:29,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:26:29,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:29" (1/1) ... [2022-02-21 04:26:29,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:29" (1/1) ... [2022-02-21 04:26:29,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:29" (1/1) ... [2022-02-21 04:26:29,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:29" (1/1) ... [2022-02-21 04:26:29,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:29" (1/1) ... [2022-02-21 04:26:29,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:29" (1/1) ... [2022-02-21 04:26:29,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:29" (1/1) ... [2022-02-21 04:26:29,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:26:29,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:26:29,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:26:29,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:26:29,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:29" (1/1) ... [2022-02-21 04:26:29,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:29,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:29,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:29,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:26:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:26:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:26:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:26:29,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:26:29,429 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:26:29,430 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:26:30,148 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:26:30,155 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:26:30,156 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:26:30,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:26:30 BoogieIcfgContainer [2022-02-21 04:26:30,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:26:30,158 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:26:30,158 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:26:30,163 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:26:30,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:26:30,164 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:26:28" (1/3) ... [2022-02-21 04:26:30,165 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55cf9b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:26:30, skipping insertion in model container [2022-02-21 04:26:30,165 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:26:30,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:29" (2/3) ... [2022-02-21 04:26:30,165 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55cf9b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:26:30, skipping insertion in model container [2022-02-21 04:26:30,165 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:26:30,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:26:30" (3/3) ... [2022-02-21 04:26:30,166 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2022-02-21 04:26:30,202 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:26:30,203 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:26:30,203 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:26:30,203 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:26:30,203 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:26:30,203 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:26:30,203 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:26:30,203 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:26:30,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 291 states, 290 states have (on average 1.796551724137931) internal successors, (521), 290 states have internal predecessors, (521), 0 states have call successors, (0), 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 04:26:30,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2022-02-21 04:26:30,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:30,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:30,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:30,325 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [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 04:26:30,325 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:26:30,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 291 states, 290 states have (on average 1.796551724137931) internal successors, (521), 290 states have internal predecessors, (521), 0 states have call successors, (0), 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 04:26:30,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2022-02-21 04:26:30,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:30,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:30,373 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:30,374 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [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 04:26:30,386 INFO L791 eck$LassoCheckResult]: Stem: 281#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; 191#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 169#L393true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 124#L404true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 284#L414true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 265#L425true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 250#L435true assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 264#L446true init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 114#L456true assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 145#L467true init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 183#L477true assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 64#L488true init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 79#L498true assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 46#L509true init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 235#L519true assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 43#L530true init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 177#L540true assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 184#L551true init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 66#L561true assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 110#L572true init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 288#L582true assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 71#L593true init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 280#L603true assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 190#L614true init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 193#L624true assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 24#L635true init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 152#L645true assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 96#L656true init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 163#L666true assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 7#L677true init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 53#L687true assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 251#L698true init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 10#L708true assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 222#L719true init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 189#L729true assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 197#L740true init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 262#L750true assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 93#L761true init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 254#L771true assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 135#L782true init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 162#L792true assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 21#L803true init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 44#L813true assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 256#L824true init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 123#L834true assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 127#L845true init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 12#L855true assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 161#L866true init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 92#L876true assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 138#L887true init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 159#L897true assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 115#L897-1true init_#res#1 := init_~tmp___23~0#1; 130#L1018true main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 101#L21true assume !(0 == assume_abort_if_not_~cond#1); 166#L20true assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 272#L1155-2true [2022-02-21 04:26:30,387 INFO L793 eck$LassoCheckResult]: Loop: 272#L1155-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; 117#L109true assume !(0 != ~mode1~0 % 256); 45#L141true assume !(~r1~0 < 3); 274#L141-1true ~mode1~0 := 1; 141#L109-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; 186#L162true assume !(0 != ~mode2~0 % 256); 252#L194true assume !(~r2~0 < 3); 5#L194-1true ~mode2~0 := 1; 56#L162-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; 150#L215true assume !(0 != ~mode3~0 % 256); 112#L247true assume !(~r3~0 < 3); 275#L247-1true ~mode3~0 := 1; 282#L215-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; 174#L268true assume !(0 != ~mode4~0 % 256); 220#L300true assume !(~r4~0 < 3); 47#L300-1true ~mode4~0 := 1; 259#L268-2true assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 229#L1026true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 19#L1026-1true check_#res#1 := check_~tmp~1#1; 50#L1078true main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 178#L1198true assume !(0 == assert_~arg#1 % 256); 226#L1193true assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; 272#L1155-2true [2022-02-21 04:26:30,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:30,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1972521662, now seen corresponding path program 1 times [2022-02-21 04:26:30,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:30,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050946158] [2022-02-21 04:26:30,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:30,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:30,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; {295#true} is VALID [2022-02-21 04:26:30,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {295#true} is VALID [2022-02-21 04:26:30,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {295#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {295#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {295#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {295#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {295#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {295#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {295#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {295#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {295#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {295#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {295#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {295#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {295#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {295#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {295#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {295#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {295#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {295#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {295#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {295#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {295#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {295#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {295#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {295#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {295#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {295#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {295#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {295#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {295#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {295#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {295#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {295#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {295#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {295#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {295#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {295#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {295#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {295#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {295#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {295#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {295#true} is VALID [2022-02-21 04:26:30,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {295#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {295#true} is VALID [2022-02-21 04:26:30,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {295#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {297#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:26:30,694 INFO L290 TraceCheckUtils]: 51: Hoare triple {297#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {298#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:26:30,695 INFO L290 TraceCheckUtils]: 52: Hoare triple {298#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {299#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:26:30,695 INFO L290 TraceCheckUtils]: 53: Hoare triple {299#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {296#false} is VALID [2022-02-21 04:26:30,695 INFO L290 TraceCheckUtils]: 54: Hoare triple {296#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {296#false} is VALID [2022-02-21 04:26:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:26:30,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:30,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050946158] [2022-02-21 04:26:30,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050946158] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:30,699 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:30,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:26:30,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143687650] [2022-02-21 04:26:30,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:30,705 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:26:30,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash -11982095, now seen corresponding path program 1 times [2022-02-21 04:26:30,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:30,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954574604] [2022-02-21 04:26:30,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:30,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {300#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; {300#true} is VALID [2022-02-21 04:26:30,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {300#true} assume !(0 != ~mode1~0 % 256); {300#true} is VALID [2022-02-21 04:26:30,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {300#true} assume !(~r1~0 < 3); {300#true} is VALID [2022-02-21 04:26:30,816 INFO L290 TraceCheckUtils]: 3: Hoare triple {300#true} ~mode1~0 := 1; {300#true} is VALID [2022-02-21 04:26:30,816 INFO L290 TraceCheckUtils]: 4: Hoare triple {300#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; {300#true} is VALID [2022-02-21 04:26:30,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#true} assume !(0 != ~mode2~0 % 256); {300#true} is VALID [2022-02-21 04:26:30,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {300#true} assume !(~r2~0 < 3); {300#true} is VALID [2022-02-21 04:26:30,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#true} ~mode2~0 := 1; {300#true} is VALID [2022-02-21 04:26:30,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; {300#true} is VALID [2022-02-21 04:26:30,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {300#true} assume !(0 != ~mode3~0 % 256); {300#true} is VALID [2022-02-21 04:26:30,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {300#true} assume !(~r3~0 < 3); {300#true} is VALID [2022-02-21 04:26:30,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {300#true} ~mode3~0 := 1; {300#true} is VALID [2022-02-21 04:26:30,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {300#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; {300#true} is VALID [2022-02-21 04:26:30,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {300#true} assume !(0 != ~mode4~0 % 256); {300#true} is VALID [2022-02-21 04:26:30,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {300#true} assume !(~r4~0 < 3); {300#true} is VALID [2022-02-21 04:26:30,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {300#true} ~mode4~0 := 1; {300#true} is VALID [2022-02-21 04:26:30,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {300#true} assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {300#true} is VALID [2022-02-21 04:26:30,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {300#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {302#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:26:30,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {302#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {303#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:26:30,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {303#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {304#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:26:30,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {304#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {301#false} is VALID [2022-02-21 04:26:30,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {301#false} assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; {301#false} is VALID [2022-02-21 04:26:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:26:30,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:30,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954574604] [2022-02-21 04:26:30,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954574604] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:30,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:30,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:26:30,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482688996] [2022-02-21 04:26:30,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:30,824 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:26:30,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:26:30,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:26:30,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:26:30,862 INFO L87 Difference]: Start difference. First operand has 291 states, 290 states have (on average 1.796551724137931) internal successors, (521), 290 states have internal predecessors, (521), 0 states have call successors, (0), 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 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 04:26:31,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:31,876 INFO L93 Difference]: Finished difference Result 295 states and 521 transitions. [2022-02-21 04:26:31,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:26:31,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 04:26:31,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:31,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 521 transitions. [2022-02-21 04:26:31,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2022-02-21 04:26:31,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 286 states and 504 transitions. [2022-02-21 04:26:31,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 286 [2022-02-21 04:26:31,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 286 [2022-02-21 04:26:31,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 504 transitions. [2022-02-21 04:26:31,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:31,935 INFO L681 BuchiCegarLoop]: Abstraction has 286 states and 504 transitions. [2022-02-21 04:26:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 504 transitions. [2022-02-21 04:26:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-02-21 04:26:31,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:26:31,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states and 504 transitions. Second operand has 286 states, 286 states have (on average 1.7622377622377623) internal successors, (504), 285 states have internal predecessors, (504), 0 states have call successors, (0), 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 04:26:31,967 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states and 504 transitions. Second operand has 286 states, 286 states have (on average 1.7622377622377623) internal successors, (504), 285 states have internal predecessors, (504), 0 states have call successors, (0), 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 04:26:31,969 INFO L87 Difference]: Start difference. First operand 286 states and 504 transitions. Second operand has 286 states, 286 states have (on average 1.7622377622377623) internal successors, (504), 285 states have internal predecessors, (504), 0 states have call successors, (0), 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 04:26:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:31,985 INFO L93 Difference]: Finished difference Result 286 states and 504 transitions. [2022-02-21 04:26:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 504 transitions. [2022-02-21 04:26:31,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:31,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:31,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 286 states, 286 states have (on average 1.7622377622377623) internal successors, (504), 285 states have internal predecessors, (504), 0 states have call successors, (0), 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 286 states and 504 transitions. [2022-02-21 04:26:31,989 INFO L87 Difference]: Start difference. First operand has 286 states, 286 states have (on average 1.7622377622377623) internal successors, (504), 285 states have internal predecessors, (504), 0 states have call successors, (0), 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 286 states and 504 transitions. [2022-02-21 04:26:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:32,002 INFO L93 Difference]: Finished difference Result 286 states and 504 transitions. [2022-02-21 04:26:32,002 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 504 transitions. [2022-02-21 04:26:32,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:32,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:32,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:26:32,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:26:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 286 states have (on average 1.7622377622377623) internal successors, (504), 285 states have internal predecessors, (504), 0 states have call successors, (0), 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 04:26:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 504 transitions. [2022-02-21 04:26:32,014 INFO L704 BuchiCegarLoop]: Abstraction has 286 states and 504 transitions. [2022-02-21 04:26:32,014 INFO L587 BuchiCegarLoop]: Abstraction has 286 states and 504 transitions. [2022-02-21 04:26:32,014 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:26:32,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 286 states and 504 transitions. [2022-02-21 04:26:32,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2022-02-21 04:26:32,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:32,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:32,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:32,018 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 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 04:26:32,018 INFO L791 eck$LassoCheckResult]: Stem: 889#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; 859#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 846#L393 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 753#L404 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 820#L414 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 635#L425 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 886#L435 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 691#L446 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 806#L456 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 723#L467 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 835#L477 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 732#L488 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 733#L498 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 670#L509 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 705#L519 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 696#L530 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 697#L540 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 805#L551 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 736#L561 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 714#L572 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 801#L582 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 642#L593 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 743#L603 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 676#L614 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 858#L624 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 655#L635 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 656#L645 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 679#L656 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 785#L666 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 614#L677 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 615#L687 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 685#L698 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 621#L708 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 622#L719 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 857#L729 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 606#L740 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 862#L750 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 780#L761 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 781#L771 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 745#L782 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 827#L792 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 620#L803 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 652#L813 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 698#L824 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 819#L834 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 673#L845 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 626#L855 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 627#L866 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 779#L876 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 648#L887 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 829#L897 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 639#L897-1 init_#res#1 := init_~tmp___23~0#1; 807#L1018 main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 790#L21 assume !(0 == assume_abort_if_not_~cond#1); 791#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 844#L1155-2 [2022-02-21 04:26:32,018 INFO L793 eck$LassoCheckResult]: Loop: 844#L1155-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; 815#L109 assume !(0 != ~mode1~0 % 256); 700#L141 assume !(~r1~0 < 3); 702#L141-1 ~mode1~0 := 1; 831#L109-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; 832#L162 assume !(0 != ~mode2~0 % 256); 855#L194 assume !(~r2~0 < 3); 609#L194-1 ~mode2~0 := 1; 610#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; 722#L215 assume !(0 != ~mode3~0 % 256); 802#L247 assume !(~r3~0 < 3); 664#L247-1 ~mode3~0 := 1; 853#L215-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; 848#L268 assume !(0 != ~mode4~0 % 256); 849#L300 assume !(~r4~0 < 3); 703#L300-1 ~mode4~0 := 1; 704#L268-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 875#L1026 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 653#L1027 assume ~st1~0 + ~nl1~0 <= 1; 654#L1028 assume ~st2~0 + ~nl2~0 <= 1; 834#L1029 assume ~st3~0 + ~nl3~0 <= 1; 877#L1030 assume ~st4~0 + ~nl4~0 <= 1; 769#L1031 assume ~r1~0 >= 3; 681#L1035 assume ~r1~0 < 3; 682#L1040 assume ~r1~0 >= 3; 687#L1045 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 645#L1026-1 check_#res#1 := check_~tmp~1#1; 646#L1078 main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 712#L1198 assume !(0 == assert_~arg#1 % 256); 851#L1193 assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; 844#L1155-2 [2022-02-21 04:26:32,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1972521662, now seen corresponding path program 2 times [2022-02-21 04:26:32,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:32,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338804171] [2022-02-21 04:26:32,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:32,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:32,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {1465#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; {1465#true} is VALID [2022-02-21 04:26:32,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {1465#true} is VALID [2022-02-21 04:26:32,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {1465#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {1465#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {1465#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {1465#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {1465#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {1465#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {1465#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {1465#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {1465#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {1465#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {1465#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {1465#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {1465#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {1465#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {1465#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {1465#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {1465#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {1465#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {1465#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {1465#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {1465#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {1465#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {1465#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {1465#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {1465#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {1465#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {1465#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {1465#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {1465#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {1465#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {1465#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {1465#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {1465#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {1465#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {1465#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {1465#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {1465#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {1465#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {1465#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,113 INFO L290 TraceCheckUtils]: 44: Hoare triple {1465#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {1465#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {1465#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {1465#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {1465#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {1465#true} is VALID [2022-02-21 04:26:32,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {1465#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {1465#true} is VALID [2022-02-21 04:26:32,115 INFO L290 TraceCheckUtils]: 50: Hoare triple {1465#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {1467#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:26:32,115 INFO L290 TraceCheckUtils]: 51: Hoare triple {1467#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {1468#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:26:32,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {1468#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1469#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:26:32,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {1469#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {1466#false} is VALID [2022-02-21 04:26:32,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {1466#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1466#false} is VALID [2022-02-21 04:26:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:26:32,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:32,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338804171] [2022-02-21 04:26:32,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338804171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:32,118 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:32,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:26:32,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803736362] [2022-02-21 04:26:32,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:32,118 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:26:32,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:32,119 INFO L85 PathProgramCache]: Analyzing trace with hash 970511552, now seen corresponding path program 1 times [2022-02-21 04:26:32,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:32,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308725167] [2022-02-21 04:26:32,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:32,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:32,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {1470#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; {1470#true} is VALID [2022-02-21 04:26:32,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {1470#true} assume !(0 != ~mode1~0 % 256); {1470#true} is VALID [2022-02-21 04:26:32,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {1470#true} assume !(~r1~0 < 3); {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {1472#(not (<= ~r1~0 2))} ~mode1~0 := 1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {1472#(not (<= ~r1~0 2))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {1472#(not (<= ~r1~0 2))} assume !(0 != ~mode2~0 % 256); {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {1472#(not (<= ~r1~0 2))} assume !(~r2~0 < 3); {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {1472#(not (<= ~r1~0 2))} ~mode2~0 := 1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {1472#(not (<= ~r1~0 2))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {1472#(not (<= ~r1~0 2))} assume !(0 != ~mode3~0 % 256); {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {1472#(not (<= ~r1~0 2))} assume !(~r3~0 < 3); {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {1472#(not (<= ~r1~0 2))} ~mode3~0 := 1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {1472#(not (<= ~r1~0 2))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {1472#(not (<= ~r1~0 2))} assume !(0 != ~mode4~0 % 256); {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {1472#(not (<= ~r1~0 2))} assume !(~r4~0 < 3); {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {1472#(not (<= ~r1~0 2))} ~mode4~0 := 1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {1472#(not (<= ~r1~0 2))} assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {1472#(not (<= ~r1~0 2))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {1472#(not (<= ~r1~0 2))} assume ~st1~0 + ~nl1~0 <= 1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {1472#(not (<= ~r1~0 2))} assume ~st2~0 + ~nl2~0 <= 1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {1472#(not (<= ~r1~0 2))} assume ~st3~0 + ~nl3~0 <= 1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {1472#(not (<= ~r1~0 2))} assume ~st4~0 + ~nl4~0 <= 1; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {1472#(not (<= ~r1~0 2))} assume ~r1~0 >= 3; {1472#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:32,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {1472#(not (<= ~r1~0 2))} assume ~r1~0 < 3; {1471#false} is VALID [2022-02-21 04:26:32,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {1471#false} assume ~r1~0 >= 3; {1471#false} is VALID [2022-02-21 04:26:32,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {1471#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {1471#false} is VALID [2022-02-21 04:26:32,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {1471#false} check_#res#1 := check_~tmp~1#1; {1471#false} is VALID [2022-02-21 04:26:32,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {1471#false} main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1471#false} is VALID [2022-02-21 04:26:32,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {1471#false} assume !(0 == assert_~arg#1 % 256); {1471#false} is VALID [2022-02-21 04:26:32,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {1471#false} assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; {1471#false} is VALID [2022-02-21 04:26:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:26:32,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:32,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308725167] [2022-02-21 04:26:32,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308725167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:32,156 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:32,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:26:32,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740984440] [2022-02-21 04:26:32,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:32,157 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:26:32,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:26:32,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:26:32,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:26:32,158 INFO L87 Difference]: Start difference. First operand 286 states and 504 transitions. cyclomatic complexity: 219 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:26:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:32,755 INFO L93 Difference]: Finished difference Result 371 states and 638 transitions. [2022-02-21 04:26:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:26:32,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 04:26:32,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:32,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 371 states and 638 transitions. [2022-02-21 04:26:32,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 191 [2022-02-21 04:26:32,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 371 states to 371 states and 638 transitions. [2022-02-21 04:26:32,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 371 [2022-02-21 04:26:32,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2022-02-21 04:26:32,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 638 transitions. [2022-02-21 04:26:32,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:32,839 INFO L681 BuchiCegarLoop]: Abstraction has 371 states and 638 transitions. [2022-02-21 04:26:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 638 transitions. [2022-02-21 04:26:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2022-02-21 04:26:32,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:26:32,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 371 states and 638 transitions. Second operand has 371 states, 371 states have (on average 1.719676549865229) internal successors, (638), 370 states have internal predecessors, (638), 0 states have call successors, (0), 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 04:26:32,849 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states and 638 transitions. Second operand has 371 states, 371 states have (on average 1.719676549865229) internal successors, (638), 370 states have internal predecessors, (638), 0 states have call successors, (0), 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 04:26:32,849 INFO L87 Difference]: Start difference. First operand 371 states and 638 transitions. Second operand has 371 states, 371 states have (on average 1.719676549865229) internal successors, (638), 370 states have internal predecessors, (638), 0 states have call successors, (0), 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 04:26:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:32,866 INFO L93 Difference]: Finished difference Result 371 states and 638 transitions. [2022-02-21 04:26:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 638 transitions. [2022-02-21 04:26:32,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:32,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:32,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 371 states, 371 states have (on average 1.719676549865229) internal successors, (638), 370 states have internal predecessors, (638), 0 states have call successors, (0), 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 371 states and 638 transitions. [2022-02-21 04:26:32,869 INFO L87 Difference]: Start difference. First operand has 371 states, 371 states have (on average 1.719676549865229) internal successors, (638), 370 states have internal predecessors, (638), 0 states have call successors, (0), 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 371 states and 638 transitions. [2022-02-21 04:26:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:32,880 INFO L93 Difference]: Finished difference Result 371 states and 638 transitions. [2022-02-21 04:26:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 638 transitions. [2022-02-21 04:26:32,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:32,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:32,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:26:32,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:26:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 371 states have (on average 1.719676549865229) internal successors, (638), 370 states have internal predecessors, (638), 0 states have call successors, (0), 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 04:26:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 638 transitions. [2022-02-21 04:26:32,892 INFO L704 BuchiCegarLoop]: Abstraction has 371 states and 638 transitions. [2022-02-21 04:26:32,892 INFO L587 BuchiCegarLoop]: Abstraction has 371 states and 638 transitions. [2022-02-21 04:26:32,893 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:26:32,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 638 transitions. [2022-02-21 04:26:32,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 191 [2022-02-21 04:26:32,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:32,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:32,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:32,895 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:32,896 INFO L791 eck$LassoCheckResult]: Stem: 2134#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; 2098#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 2085#L393 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1992#L404 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 2059#L414 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1878#L425 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 2130#L435 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 1930#L446 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 2046#L456 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 1963#L467 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 2077#L477 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 1973#L488 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1974#L498 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 1910#L509 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1943#L519 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 1935#L530 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 1936#L540 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 2044#L551 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 1975#L561 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 1952#L572 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 2040#L582 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 1882#L593 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 1982#L603 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 1916#L614 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 2097#L624 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 1895#L635 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 1896#L645 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 1919#L656 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 2021#L666 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 1854#L677 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 1855#L687 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 1922#L698 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 1861#L708 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 1862#L719 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 2096#L729 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 1846#L740 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 2101#L750 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 2018#L761 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 2019#L771 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 1984#L782 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 2066#L792 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 1857#L803 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 1889#L813 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 1937#L824 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 2058#L834 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 1913#L845 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 1866#L855 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 1867#L866 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 2017#L876 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 1888#L887 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 2068#L897 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 1876#L897-1 init_#res#1 := init_~tmp___23~0#1; 2045#L1018 main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 2028#L21 assume !(0 == assume_abort_if_not_~cond#1); 2029#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 2083#L1155-2 [2022-02-21 04:26:32,896 INFO L793 eck$LassoCheckResult]: Loop: 2083#L1155-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; 2210#L109 assume !(0 != ~mode1~0 % 256); 2209#L141 assume ~r1~0 < 3; 2033#L142 assume !(0 != ~ep12~0 % 256); 1865#L142-2 assume !(0 != ~ep13~0 % 256); 1970#L145-1 assume !(0 != ~ep14~0 % 256); 1971#L141-1 ~mode1~0 := 1; 2188#L109-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; 2186#L162 assume !(0 != ~mode2~0 % 256); 2187#L194 assume !(~r2~0 < 3); 2175#L194-1 ~mode2~0 := 1; 2174#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; 2170#L215 assume !(0 != ~mode3~0 % 256); 2166#L247 assume !(~r3~0 < 3); 2159#L247-1 ~mode3~0 := 1; 2158#L215-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; 2156#L268 assume !(0 != ~mode4~0 % 256); 2146#L300 assume !(~r4~0 < 3); 2142#L300-1 ~mode4~0 := 1; 2141#L268-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 2140#L1026 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 2139#L1027 assume ~st1~0 + ~nl1~0 <= 1; 2138#L1028 assume ~st2~0 + ~nl2~0 <= 1; 2137#L1029 assume ~st3~0 + ~nl3~0 <= 1; 2136#L1030 assume ~st4~0 + ~nl4~0 <= 1; 2135#L1031 assume !(~r1~0 >= 3); 2109#L1034 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 2110#L1035 assume ~r1~0 < 3; 2208#L1040 assume !(~r1~0 >= 3); 2115#L1044 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 2116#L1045 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 2214#L1026-1 check_#res#1 := check_~tmp~1#1; 2213#L1078 main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 2212#L1198 assume !(0 == assert_~arg#1 % 256); 2211#L1193 assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; 2083#L1155-2 [2022-02-21 04:26:32,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1972521662, now seen corresponding path program 3 times [2022-02-21 04:26:32,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:32,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211415351] [2022-02-21 04:26:32,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:32,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {2960#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; {2960#true} is VALID [2022-02-21 04:26:32,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {2960#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {2960#true} is VALID [2022-02-21 04:26:32,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {2960#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {2960#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {2960#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {2960#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {2960#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {2960#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {2960#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {2960#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {2960#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {2960#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {2960#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {2960#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {2960#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {2960#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {2960#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {2960#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {2960#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {2960#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {2960#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {2960#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {2960#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {2960#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {2960#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {2960#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {2960#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {2960#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {2960#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {2960#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {2960#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {2960#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {2960#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {2960#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {2960#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {2960#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {2960#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {2960#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {2960#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,986 INFO L290 TraceCheckUtils]: 39: Hoare triple {2960#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {2960#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {2960#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {2960#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {2960#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {2960#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,991 INFO L290 TraceCheckUtils]: 45: Hoare triple {2960#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,991 INFO L290 TraceCheckUtils]: 46: Hoare triple {2960#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,992 INFO L290 TraceCheckUtils]: 47: Hoare triple {2960#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,992 INFO L290 TraceCheckUtils]: 48: Hoare triple {2960#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {2960#true} is VALID [2022-02-21 04:26:32,992 INFO L290 TraceCheckUtils]: 49: Hoare triple {2960#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {2960#true} is VALID [2022-02-21 04:26:32,992 INFO L290 TraceCheckUtils]: 50: Hoare triple {2960#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {2962#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:26:32,993 INFO L290 TraceCheckUtils]: 51: Hoare triple {2962#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {2963#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:26:32,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {2963#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2964#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:26:32,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {2964#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {2961#false} is VALID [2022-02-21 04:26:32,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {2961#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2961#false} is VALID [2022-02-21 04:26:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:26:32,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:32,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211415351] [2022-02-21 04:26:32,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211415351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:32,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:32,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:26:32,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827162950] [2022-02-21 04:26:32,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:32,995 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:26:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash -419942892, now seen corresponding path program 1 times [2022-02-21 04:26:32,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:32,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365606111] [2022-02-21 04:26:32,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:32,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:26:33,016 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:26:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:26:33,058 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:26:33,985 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:26:33,986 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:26:33,986 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:26:33,986 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:26:33,986 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:26:33,986 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:33,986 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:26:33,986 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:26:33,986 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:26:33,986 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:26:33,987 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:26:34,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,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 04:26:34,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,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 04:26:34,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:34,937 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:26:34,938 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:26:34,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:34,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:34,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:34,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:26:34,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:26:34,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:26:34,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:34,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:34,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:34,977 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:34,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:26:34,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:26:34,979 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:26:35,115 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:26:35,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:35,119 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:26:35,119 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:26:35,119 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:26:35,119 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:26:35,119 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:26:35,119 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:35,120 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:26:35,120 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:26:35,120 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:26:35,120 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:26:35,120 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:26:35,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,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 04:26:35,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 04:26:35,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:35,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:36,117 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:26:36,121 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:26:36,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:26:36,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,179 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:26:36,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,216 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:26:36,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,267 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:26:36,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,328 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:26:36,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,356 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:26:36,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,383 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:26:36,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,412 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:26:36,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,441 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:26:36,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,468 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:26:36,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,499 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:26:36,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,550 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:26:36,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 04:26:36,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,597 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:26:36,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 04:26:36,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,660 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:26:36,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,687 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:26:36,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,723 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:26:36,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,751 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:26:36,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,789 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:26:36,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:36,831 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 04:26:36,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,832 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:26:36,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:36,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:36,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:36,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:36,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:36,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:36,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:36,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:36,856 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:26:36,860 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:26:36,860 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:26:36,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:36,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:36,862 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:36,871 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:26:36,871 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:26:36,871 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:26:36,872 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2022-02-21 04:26:36,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:26:36,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:36,912 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:26:36,917 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1;" "assume !(0 != ~mode1~0 % 256);" "assume ~r1~0 < 3;" "assume !(0 != ~ep12~0 % 256);" "assume !(0 != ~ep13~0 % 256);" "assume !(0 != ~ep14~0 % 256);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 3);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 3);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1;" "assume !(0 != ~mode4~0 % 256);" "assume !(~r4~0 < 3);" "~mode4~0 := 1;" "assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~st4~0 + ~nl4~0 <= 1;" "assume !(~r1~0 >= 3);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0;" "assume ~r1~0 < 3;" "assume !(~r1~0 >= 3);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0;" "assume ~r1~0 < 3;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1;" [2022-02-21 04:26:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:36,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:37,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:26:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:37,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:26:37,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {2967#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; {2967#unseeded} is VALID [2022-02-21 04:26:37,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {2967#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {2967#unseeded} is VALID [2022-02-21 04:26:37,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {2967#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {2967#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {2967#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {2967#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {2967#unseeded} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {2967#unseeded} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {2967#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {2967#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {2967#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {2967#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {2967#unseeded} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {2967#unseeded} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {2967#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {2967#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {2967#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {2967#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {2967#unseeded} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {2967#unseeded} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {2967#unseeded} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {2967#unseeded} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {2967#unseeded} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {2967#unseeded} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {2967#unseeded} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {2967#unseeded} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {2967#unseeded} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {2967#unseeded} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {2967#unseeded} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {2967#unseeded} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {2967#unseeded} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {2967#unseeded} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {2967#unseeded} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {2967#unseeded} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {2967#unseeded} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {2967#unseeded} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {2967#unseeded} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,261 INFO L290 TraceCheckUtils]: 37: Hoare triple {2967#unseeded} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {2967#unseeded} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {2967#unseeded} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {2967#unseeded} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {2967#unseeded} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {2967#unseeded} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {2967#unseeded} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {2967#unseeded} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {2967#unseeded} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,267 INFO L290 TraceCheckUtils]: 46: Hoare triple {2967#unseeded} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,267 INFO L290 TraceCheckUtils]: 47: Hoare triple {2967#unseeded} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,267 INFO L290 TraceCheckUtils]: 48: Hoare triple {2967#unseeded} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {2967#unseeded} is VALID [2022-02-21 04:26:37,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {2967#unseeded} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {2967#unseeded} is VALID [2022-02-21 04:26:37,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {2967#unseeded} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {2967#unseeded} is VALID [2022-02-21 04:26:37,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {2967#unseeded} init_#res#1 := init_~tmp___23~0#1; {2967#unseeded} is VALID [2022-02-21 04:26:37,268 INFO L290 TraceCheckUtils]: 52: Hoare triple {2967#unseeded} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2967#unseeded} is VALID [2022-02-21 04:26:37,269 INFO L290 TraceCheckUtils]: 53: Hoare triple {2967#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {2967#unseeded} is VALID [2022-02-21 04:26:37,269 INFO L290 TraceCheckUtils]: 54: Hoare triple {2967#unseeded} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2967#unseeded} is VALID [2022-02-21 04:26:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:37,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:26:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:37,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:26:37,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {2970#(>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode1~0 % 256); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep12~0 % 256); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep13~0 % 256); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep14~0 % 256); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode1~0 := 1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode2~0 % 256); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r2~0 < 3); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode2~0 := 1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode3~0 % 256); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r3~0 < 3); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode3~0 := 1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode4~0 % 256); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r4~0 < 3); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode4~0 := 1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~nl1~0 <= 1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st2~0 + ~nl2~0 <= 1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st3~0 + ~nl3~0 <= 1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st4~0 + ~nl4~0 <= 1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} check_#res#1 := check_~tmp~1#1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 == assert_~arg#1 % 256); {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:37,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {3147#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; {2980#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:26:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:26:37,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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 04:26:37,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:37,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:37,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:37,607 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 04:26:37,607 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 371 states and 638 transitions. cyclomatic complexity: 268 Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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 04:26:37,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:38,066 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 371 states and 638 transitions. cyclomatic complexity: 268. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Result 561 states and 946 transitions. Complement of second has 4 states. [2022-02-21 04:26:38,067 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 04:26:38,067 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:26:38,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 638 transitions. cyclomatic complexity: 268 [2022-02-21 04:26:38,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:38,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:38,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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 04:26:38,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:26:38,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:38,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:38,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 561 states and 946 transitions. [2022-02-21 04:26:38,081 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:26:38,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:26:38,083 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 371 states and 638 transitions. cyclomatic complexity: 268 [2022-02-21 04:26:38,165 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 191 examples of accepted words. [2022-02-21 04:26:38,165 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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 04:26:38,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:26:38,169 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:26:38,169 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 561 states and 946 transitions. cyclomatic complexity: 386 [2022-02-21 04:26:38,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 561 states and 946 transitions. cyclomatic complexity: 386 [2022-02-21 04:26:38,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:26:38,169 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:26:38,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:38,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:38,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:38,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:38,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:38,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:38,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 561 letters. Loop has 561 letters. [2022-02-21 04:26:38,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 561 letters. Loop has 561 letters. [2022-02-21 04:26:38,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 561 letters. Loop has 561 letters. [2022-02-21 04:26:38,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 371 letters. Loop has 371 letters. [2022-02-21 04:26:38,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 371 letters. Loop has 371 letters. [2022-02-21 04:26:38,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 371 letters. Loop has 371 letters. [2022-02-21 04:26:38,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:26:38,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:26:38,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:26:38,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:26:38,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:26:38,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:26:38,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:26:38,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:26:38,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:26:38,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:26:38,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:26:38,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:26:38,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:26:38,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:26:38,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:26:38,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:26:38,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:26:38,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:26:38,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:26:38,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:26:38,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:26:38,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:26:38,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:26:38,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:26:38,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:26:38,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:26:38,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:26:38,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:38,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:38,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:38,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:26:38,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:26:38,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:26:38,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:26:38,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:26:38,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:26:38,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:26:38,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:26:38,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:26:38,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:26:38,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:26:38,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:26:38,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:26:38,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:26:38,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:26:38,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:26:38,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:26:38,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:26:38,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:26:38,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:26:38,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:26:38,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:26:38,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:26:38,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:26:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:26:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:26:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:26:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:26:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:26:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:26:38,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:26:38,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:26:38,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:26:38,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:26:38,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:26:38,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:26:38,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:26:38,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:26:38,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:26:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:26:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:26:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:26:38,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 81 letters. Loop has 35 letters. [2022-02-21 04:26:38,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 81 letters. Loop has 35 letters. [2022-02-21 04:26:38,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 81 letters. Loop has 35 letters. [2022-02-21 04:26:38,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 82 letters. Loop has 35 letters. [2022-02-21 04:26:38,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 82 letters. Loop has 35 letters. [2022-02-21 04:26:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 82 letters. Loop has 35 letters. [2022-02-21 04:26:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:38,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:38,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:26:38,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:26:38,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:26:38,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:26:38,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:26:38,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:26:38,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 84 letters. Loop has 35 letters. [2022-02-21 04:26:38,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 84 letters. Loop has 35 letters. [2022-02-21 04:26:38,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 84 letters. Loop has 35 letters. [2022-02-21 04:26:38,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:38,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:38,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:38,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 85 letters. Loop has 35 letters. [2022-02-21 04:26:38,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 85 letters. Loop has 35 letters. [2022-02-21 04:26:38,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 85 letters. Loop has 35 letters. [2022-02-21 04:26:38,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:26:38,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:26:38,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:26:38,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:26:38,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:26:38,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:26:38,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:26:38,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:26:38,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:26:38,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:26:38,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:26:38,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:26:38,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:26:38,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:26:38,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:26:38,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:26:38,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:26:38,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:26:38,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:38,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:38,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:38,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:26:38,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:26:38,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:26:38,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:38,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:38,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:38,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:26:38,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:26:38,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:26:38,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 80 letters. Loop has 35 letters. [2022-02-21 04:26:38,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 80 letters. Loop has 35 letters. [2022-02-21 04:26:38,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 80 letters. Loop has 35 letters. [2022-02-21 04:26:38,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 79 letters. Loop has 35 letters. [2022-02-21 04:26:38,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 79 letters. Loop has 35 letters. [2022-02-21 04:26:38,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 79 letters. Loop has 35 letters. [2022-02-21 04:26:38,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 78 letters. Loop has 35 letters. [2022-02-21 04:26:38,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 78 letters. Loop has 35 letters. [2022-02-21 04:26:38,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 78 letters. Loop has 35 letters. [2022-02-21 04:26:38,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:26:38,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:26:38,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:26:38,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:26:38,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:26:38,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:26:38,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:26:38,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:26:38,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:26:38,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:26:38,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:26:38,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:26:38,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:26:38,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:26:38,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:26:38,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:26:38,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:26:38,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:26:38,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:26:38,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:26:38,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:26:38,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:26:38,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:26:38,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:26:38,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:26:38,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:26:38,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:26:38,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:26:38,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:26:38,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:26:38,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:26:38,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:26:38,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:26:38,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:26:38,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:26:38,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:26:38,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:38,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:38,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:38,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:38,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:38,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:38,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:38,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:38,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:38,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:26:38,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:26:38,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:26:38,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:26:38,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:26:38,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:26:38,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:26:38,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:26:38,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:26:38,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:26:38,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:26:38,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:26:38,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:26:38,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:26:38,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:26:38,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:26:38,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:26:38,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:26:38,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:26:38,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:26:38,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:26:38,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:26:38,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:26:38,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:26:38,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:26:38,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:26:38,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:26:38,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:38,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:38,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:38,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:26:38,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:26:38,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:26:38,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:26:38,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:26:38,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:26:38,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:38,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:38,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:38,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:26:38,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:26:38,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:26:38,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:38,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:38,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:38,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:38,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:38,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:38,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:26:38,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:26:38,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:26:38,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:26:38,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:26:38,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:26:38,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:26:38,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:26:38,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:26:38,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:38,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:38,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:38,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:26:38,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:26:38,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:26:38,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:38,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:38,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:38,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:38,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:38,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:38,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:38,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:38,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:38,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:26:38,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:26:38,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:26:38,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:26:38,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:26:38,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:26:38,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:26:38,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:26:38,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:26:38,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:38,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:38,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:38,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:26:38,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:26:38,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:26:38,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:26:38,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:26:38,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:26:38,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:26:38,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:26:38,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:26:38,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:26:38,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:26:38,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:26:38,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:26:38,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:26:38,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:26:38,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:38,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:38,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:38,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:26:38,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:26:38,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:26:38,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:26:38,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:26:38,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:26:38,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:26:38,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:26:38,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:26:38,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:38,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:38,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:38,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:26:38,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:26:38,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:26:38,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:26:38,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:26:38,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:26:38,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:26:38,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:26:38,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:26:38,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:38,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:38,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:38,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:38,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:38,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:38,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:26:38,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:26:38,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:26:38,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:26:38,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:26:38,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:26:38,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:26:38,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:26:38,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:26:38,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:26:38,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:26:38,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:26:38,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:26:38,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:26:38,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:26:38,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:26:38,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:26:38,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:26:38,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:26:38,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:26:38,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:26:38,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:26:38,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:26:38,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:26:38,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:26:38,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:26:38,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:26:38,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:26:38,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:26:38,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:26:38,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:26:38,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:26:38,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:26:38,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:26:38,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:26:38,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:26:38,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:26:38,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:26:38,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:26:38,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:26:38,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:26:38,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:26:38,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:38,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:38,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:38,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:38,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:38,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:38,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:38,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:38,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:38,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:26:38,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:26:38,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:26:38,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:26:38,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:26:38,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:26:38,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:26:38,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:26:38,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:26:38,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:26:38,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:26:38,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:26:38,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:26:38,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:26:38,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:26:38,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:26:38,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:26:38,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:26:38,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:26:38,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:26:38,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:26:38,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:26:38,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:26:38,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:26:38,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:26:38,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:26:38,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:26:38,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:26:38,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:26:38,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:26:38,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:26:38,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:26:38,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:26:38,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:26:38,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:26:38,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:26:38,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:26:38,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:26:38,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:26:38,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:26:38,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:26:38,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:26:38,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:26:38,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:26:38,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:26:38,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:26:38,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:26:38,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:26:38,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:26:38,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:26:38,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:26:38,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:26:38,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:26:38,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:26:38,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:26:38,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:26:38,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:26:38,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:26:38,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:26:38,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:26:38,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:26:38,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:26:38,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:26:38,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:26:38,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:26:38,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:26:38,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:26:38,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:26:38,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:26:38,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:26:38,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:26:38,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:26:38,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 83 letters. Loop has 35 letters. [2022-02-21 04:26:38,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 83 letters. Loop has 35 letters. [2022-02-21 04:26:38,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 83 letters. Loop has 35 letters. [2022-02-21 04:26:38,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:26:38,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:26:38,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:26:38,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 56 letters. Loop has 35 letters. [2022-02-21 04:26:38,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 56 letters. Loop has 35 letters. [2022-02-21 04:26:38,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 56 letters. Loop has 35 letters. [2022-02-21 04:26:38,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 89 letters. Loop has 35 letters. [2022-02-21 04:26:38,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 89 letters. Loop has 35 letters. [2022-02-21 04:26:38,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 89 letters. Loop has 35 letters. [2022-02-21 04:26:38,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 88 letters. Loop has 35 letters. [2022-02-21 04:26:38,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 88 letters. Loop has 35 letters. [2022-02-21 04:26:38,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 88 letters. Loop has 35 letters. [2022-02-21 04:26:38,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:26:38,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:26:38,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:26:38,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:26:38,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:26:38,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:26:38,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 86 letters. Loop has 35 letters. [2022-02-21 04:26:38,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 86 letters. Loop has 35 letters. [2022-02-21 04:26:38,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 86 letters. Loop has 35 letters. [2022-02-21 04:26:38,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:26:38,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:26:38,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:26:38,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:26:38,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:26:38,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:26:38,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:38,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:38,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:38,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:26:38,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:26:38,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:26:38,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:26:38,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:26:38,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:26:38,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:26:38,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:26:38,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:26:38,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:26:38,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:26:38,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:26:38,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:26:38,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:26:38,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:26:38,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:26:38,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:26:38,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:26:38,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:38,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:38,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:38,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:26:38,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:26:38,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:26:38,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:26:38,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:26:38,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:26:38,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:38,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:38,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:38,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:38,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:38,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:38,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:38,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:38,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:38,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:26:38,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:26:38,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:26:38,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:26:38,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:26:38,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:26:38,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:38,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:38,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:38,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:38,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:38,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:38,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:26:38,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:26:38,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:26:38,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:38,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:38,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:38,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:26:38,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:26:38,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:26:38,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:26:38,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:26:38,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:26:38,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:38,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:38,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:38,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:26:38,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:26:38,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:26:38,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:26:38,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:26:38,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:26:38,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:26:38,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:26:38,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:26:38,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:26:38,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:26:38,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:26:38,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:26:38,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:26:38,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:26:38,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:26:38,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:26:38,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:26:38,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:38,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:38,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:38,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:26:38,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:26:38,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:26:38,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:38,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:38,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:38,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:26:38,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:26:38,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:26:38,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:26:38,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:26:38,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:26:38,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:26:38,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:26:38,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:26:38,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:26:38,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:26:38,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:26:38,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:38,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:38,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:38,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:26:38,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:26:38,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:26:38,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:38,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:38,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:38,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:38,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:38,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:38,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,371 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:26:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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 04:26:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-02-21 04:26:38,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 504 transitions. Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:38,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 504 transitions. Stem has 90 letters. Loop has 35 letters. [2022-02-21 04:26:38,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 504 transitions. Stem has 55 letters. Loop has 70 letters. [2022-02-21 04:26:38,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:38,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 946 transitions. cyclomatic complexity: 386 [2022-02-21 04:26:38,387 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:26:38,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 0 states and 0 transitions. [2022-02-21 04:26:38,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:26:38,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:26:38,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:26:38,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:38,388 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:38,388 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:38,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:26:38,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:26:38,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:26:38,388 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 04:26:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:38,389 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:26:38,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:26:38,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 04:26:38,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:38,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:26:38,424 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:26:38,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:26:38,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:26:38,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:26:38,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:26:38,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:38,425 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:38,425 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:38,425 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:38,425 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:26:38,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:26:38,425 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:26:38,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:26:38,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:26:38 BoogieIcfgContainer [2022-02-21 04:26:38,430 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:26:38,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:26:38,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:26:38,430 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:26:38,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:26:30" (3/4) ... [2022-02-21 04:26:38,432 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:26:38,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:26:38,433 INFO L158 Benchmark]: Toolchain (without parser) took 9801.88ms. Allocated memory was 109.1MB in the beginning and 195.0MB in the end (delta: 86.0MB). Free memory was 70.8MB in the beginning and 64.8MB in the end (delta: 5.9MB). Peak memory consumption was 90.3MB. Max. memory is 16.1GB. [2022-02-21 04:26:38,433 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:26:38,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.48ms. Allocated memory is still 109.1MB. Free memory was 70.6MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:26:38,434 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.23ms. Allocated memory is still 109.1MB. Free memory was 68.4MB in the beginning and 62.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:26:38,434 INFO L158 Benchmark]: Boogie Preprocessor took 67.42ms. Allocated memory is still 109.1MB. Free memory was 62.2MB in the beginning and 58.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:26:38,434 INFO L158 Benchmark]: RCFGBuilder took 936.25ms. Allocated memory is still 109.1MB. Free memory was 58.0MB in the beginning and 43.6MB in the end (delta: 14.4MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2022-02-21 04:26:38,435 INFO L158 Benchmark]: BuchiAutomizer took 8272.14ms. Allocated memory was 109.1MB in the beginning and 195.0MB in the end (delta: 86.0MB). Free memory was 43.6MB in the beginning and 64.8MB in the end (delta: -21.2MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2022-02-21 04:26:38,435 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 195.0MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:26:38,436 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.48ms. Allocated memory is still 109.1MB. Free memory was 70.6MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.23ms. Allocated memory is still 109.1MB. Free memory was 68.4MB in the beginning and 62.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.42ms. Allocated memory is still 109.1MB. Free memory was 62.2MB in the beginning and 58.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 936.25ms. Allocated memory is still 109.1MB. Free memory was 58.0MB in the beginning and 43.6MB in the end (delta: 14.4MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 8272.14ms. Allocated memory was 109.1MB in the beginning and 195.0MB in the end (delta: 86.0MB). Free memory was 43.6MB in the beginning and 64.8MB in the end (delta: -21.2MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 195.0MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 + -2 * i2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.0s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 371 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 624 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 624 mSDsluCounter, 3709 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2189 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1520 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital193 mio100 ax100 hnf100 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:26:38,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE