./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-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_opt-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 77af8780d2ec99ad0d03b475aa25db67a7ba0a218594f51cddbe35460cd2b670 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:31:42,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:31:42,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:31:42,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:31:42,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:31:42,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:31:42,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:31:42,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:31:42,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:31:42,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:31:42,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:31:42,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:31:42,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:31:42,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:31:42,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:31:42,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:31:42,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:31:42,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:31:42,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:31:42,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:31:42,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:31:42,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:31:42,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:31:42,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:31:42,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:31:42,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:31:42,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:31:42,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:31:42,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:31:42,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:31:42,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:31:42,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:31:42,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:31:42,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:31:42,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:31:42,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:31:42,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:31:42,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:31:42,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:31:42,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:31:42,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:31:42,615 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:31:42,656 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:31:42,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:31:42,657 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:31:42,657 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:31:42,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:31:42,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:31:42,659 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:31:42,659 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:31:42,659 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:31:42,659 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:31:42,660 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:31:42,660 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:31:42,660 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:31:42,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:31:42,660 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:31:42,661 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:31:42,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:31:42,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:31:42,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:31:42,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:31:42,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:31:42,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:31:42,662 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:31:42,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:31:42,662 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:31:42,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:31:42,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:31:42,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:31:42,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:31:42,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:31:42,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:31:42,664 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:31:42,664 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 -> 77af8780d2ec99ad0d03b475aa25db67a7ba0a218594f51cddbe35460cd2b670 [2022-02-21 04:31:42,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:31:42,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:31:42,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:31:42,900 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:31:42,900 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:31:42,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2022-02-21 04:31:42,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913a8479b/d19223e0d4f448758910353dcb42b881/FLAG78b977266 [2022-02-21 04:31:43,514 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:31:43,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2022-02-21 04:31:43,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913a8479b/d19223e0d4f448758910353dcb42b881/FLAG78b977266 [2022-02-21 04:31:43,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913a8479b/d19223e0d4f448758910353dcb42b881 [2022-02-21 04:31:43,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:31:43,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:31:43,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:31:43,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:31:43,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:31:43,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:31:43" (1/1) ... [2022-02-21 04:31:43,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e6d741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:43, skipping insertion in model container [2022-02-21 04:31:43,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:31:43" (1/1) ... [2022-02-21 04:31:43,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:31:44,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:31:44,319 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_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c[26618,26631] [2022-02-21 04:31:44,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:31:44,326 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:31:44,396 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_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c[26618,26631] [2022-02-21 04:31:44,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:31:44,411 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:31:44,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:44 WrapperNode [2022-02-21 04:31:44,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:31:44,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:31:44,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:31:44,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:31:44,417 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:31:44" (1/1) ... [2022-02-21 04:31:44,434 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:31:44" (1/1) ... [2022-02-21 04:31:44,486 INFO L137 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 957 [2022-02-21 04:31:44,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:31:44,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:31:44,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:31:44,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:31:44,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:44" (1/1) ... [2022-02-21 04:31:44,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:44" (1/1) ... [2022-02-21 04:31:44,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:44" (1/1) ... [2022-02-21 04:31:44,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:44" (1/1) ... [2022-02-21 04:31:44,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:44" (1/1) ... [2022-02-21 04:31:44,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:44" (1/1) ... [2022-02-21 04:31:44,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:44" (1/1) ... [2022-02-21 04:31:44,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:31:44,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:31:44,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:31:44,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:31:44,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:44" (1/1) ... [2022-02-21 04:31:44,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:44,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:44,584 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:31:44,593 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:31:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:31:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:31:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:31:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:31:44,776 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:31:44,777 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:31:45,611 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:31:45,619 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:31:45,619 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:31:45,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:45 BoogieIcfgContainer [2022-02-21 04:31:45,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:31:45,622 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:31:45,623 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:31:45,625 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:31:45,626 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:45,626 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:31:43" (1/3) ... [2022-02-21 04:31:45,626 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15d301dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:31:45, skipping insertion in model container [2022-02-21 04:31:45,627 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:45,627 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:44" (2/3) ... [2022-02-21 04:31:45,627 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15d301dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:31:45, skipping insertion in model container [2022-02-21 04:31:45,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:45,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:45" (3/3) ... [2022-02-21 04:31:45,631 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2022-02-21 04:31:45,667 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:31:45,669 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:31:45,669 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:31:45,669 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:31:45,669 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:31:45,669 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:31:45,669 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:31:45,670 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:31:45,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 311 states, 310 states have (on average 1.7967741935483872) internal successors, (557), 310 states have internal predecessors, (557), 0 states have call successors, (0), 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:31:45,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2022-02-21 04:31:45,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:45,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:45,825 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:31:45,826 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:31:45,826 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:31:45,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 311 states, 310 states have (on average 1.7967741935483872) internal successors, (557), 310 states have internal predecessors, (557), 0 states have call successors, (0), 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:31:45,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2022-02-21 04:31:45,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:45,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:45,858 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:31:45,858 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:31:45,869 INFO L791 eck$LassoCheckResult]: Stem: 294#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 204#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~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#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;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#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; 33#L441true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 239#L452true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 105#L462true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 149#L473true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 277#L483true assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 242#L494true init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 243#L504true assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 58#L515true init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 3#L525true assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 233#L536true init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 53#L546true assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 310#L557true init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 67#L567true assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 210#L578true init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 115#L588true assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 227#L599true init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 102#L609true assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 75#L620true init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 107#L630true assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 206#L641true init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 292#L651true assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 212#L662true init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 139#L672true assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 247#L683true init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 298#L693true assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 224#L704true init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 169#L714true assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 13#L725true init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 304#L735true assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 114#L746true init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 96#L756true assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 281#L767true init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 36#L777true assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 156#L788true init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 209#L798true assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 300#L809true init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 213#L819true assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 278#L830true init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 134#L840true assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 250#L851true init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 193#L861true assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 253#L872true init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 203#L882true assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 103#L893true init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 273#L903true assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 99#L914true init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 260#L924true assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 89#L935true init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 129#L945true assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 215#L945-1true init_#res#1 := init_~tmp___23~0#1; 100#L1082true main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#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; 123#L21true assume !(0 == assume_abort_if_not_~cond#1); 183#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; 22#L1223-2true [2022-02-21 04:31:45,876 INFO L793 eck$LassoCheckResult]: Loop: 22#L1223-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, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 72#L114true assume !(0 != ~mode1~0 % 256); 268#L150true assume !(~r1~0 < 3); 170#L150-1true ~mode1~0 := 1; 59#L114-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 43#L178true assume !(0 != ~mode2~0 % 256); 303#L214true assume !(~r2~0 < 3); 106#L214-1true ~mode2~0 := 1; 171#L178-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 311#L242true assume !(0 != ~mode3~0 % 256); 162#L278true assume !(~r3~0 < 3); 127#L278-1true ~mode3~0 := 1; 221#L242-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 152#L306true assume !(0 != ~mode4~0 % 256); 52#L342true assume !(~r4~0 < 3); 17#L342-1true ~mode4~0 := 1; 62#L306-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; 41#L1090true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 37#L1090-1true check_#res#1 := check_~tmp~1#1; 267#L1142true main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#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; 39#L1266true assume !(0 == assert_~arg#1 % 256); 257#L1261true assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; 22#L1223-2true [2022-02-21 04:31:45,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1995424982, now seen corresponding path program 1 times [2022-02-21 04:31:45,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:45,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191973647] [2022-02-21 04:31:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:45,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:46,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {315#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; {315#true} is VALID [2022-02-21 04:31:46,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {315#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~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#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;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#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; {315#true} is VALID [2022-02-21 04:31:46,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {315#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {315#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {315#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {315#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {315#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {315#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {315#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {315#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {315#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {315#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {315#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {315#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {315#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {315#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {315#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {315#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {315#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {315#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {315#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {315#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {315#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {315#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {315#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,266 INFO L290 TraceCheckUtils]: 36: Hoare triple {315#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {315#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {315#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {315#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {315#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {315#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {315#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,268 INFO L290 TraceCheckUtils]: 43: Hoare triple {315#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,268 INFO L290 TraceCheckUtils]: 44: Hoare triple {315#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,268 INFO L290 TraceCheckUtils]: 45: Hoare triple {315#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {315#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,269 INFO L290 TraceCheckUtils]: 47: Hoare triple {315#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {315#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {315#true} is VALID [2022-02-21 04:31:46,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {315#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {315#true} is VALID [2022-02-21 04:31:46,273 INFO L290 TraceCheckUtils]: 50: Hoare triple {315#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {317#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:31:46,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {317#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {318#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:31:46,276 INFO L290 TraceCheckUtils]: 52: Hoare triple {318#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#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; {319#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:31:46,277 INFO L290 TraceCheckUtils]: 53: Hoare triple {319#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {316#false} is VALID [2022-02-21 04:31:46,277 INFO L290 TraceCheckUtils]: 54: Hoare triple {316#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; {316#false} is VALID [2022-02-21 04:31:46,278 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:31:46,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:46,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191973647] [2022-02-21 04:31:46,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191973647] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:46,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:46,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:46,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226220177] [2022-02-21 04:31:46,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:46,287 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:46,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash 967034741, now seen corresponding path program 1 times [2022-02-21 04:31:46,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:46,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054049524] [2022-02-21 04:31:46,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:46,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:46,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {320#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, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {320#true} is VALID [2022-02-21 04:31:46,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#true} assume !(0 != ~mode1~0 % 256); {320#true} is VALID [2022-02-21 04:31:46,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {320#true} assume !(~r1~0 < 3); {320#true} is VALID [2022-02-21 04:31:46,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {320#true} ~mode1~0 := 1; {320#true} is VALID [2022-02-21 04:31:46,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {320#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {320#true} is VALID [2022-02-21 04:31:46,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {320#true} assume !(0 != ~mode2~0 % 256); {320#true} is VALID [2022-02-21 04:31:46,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {320#true} assume !(~r2~0 < 3); {320#true} is VALID [2022-02-21 04:31:46,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {320#true} ~mode2~0 := 1; {320#true} is VALID [2022-02-21 04:31:46,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {320#true} is VALID [2022-02-21 04:31:46,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#true} assume !(0 != ~mode3~0 % 256); {320#true} is VALID [2022-02-21 04:31:46,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {320#true} assume !(~r3~0 < 3); {320#true} is VALID [2022-02-21 04:31:46,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {320#true} ~mode3~0 := 1; {320#true} is VALID [2022-02-21 04:31:46,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {320#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; {320#true} is VALID [2022-02-21 04:31:46,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {320#true} assume !(0 != ~mode4~0 % 256); {320#true} is VALID [2022-02-21 04:31:46,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {320#true} assume !(~r4~0 < 3); {320#true} is VALID [2022-02-21 04:31:46,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {320#true} ~mode4~0 := 1; {320#true} is VALID [2022-02-21 04:31:46,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {320#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; {320#true} is VALID [2022-02-21 04:31:46,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {320#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {322#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:31:46,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {322#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {323#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:31:46,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {323#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#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; {324#(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:31:46,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {324#(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); {321#false} is VALID [2022-02-21 04:31:46,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {321#false} assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; {321#false} is VALID [2022-02-21 04:31:46,405 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:31:46,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:46,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054049524] [2022-02-21 04:31:46,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054049524] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:46,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:46,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:46,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439105192] [2022-02-21 04:31:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:46,407 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:46,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:46,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:31:46,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:31:46,435 INFO L87 Difference]: Start difference. First operand has 311 states, 310 states have (on average 1.7967741935483872) internal successors, (557), 310 states have internal predecessors, (557), 0 states have call successors, (0), 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:31:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:47,648 INFO L93 Difference]: Finished difference Result 315 states and 557 transitions. [2022-02-21 04:31:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:31:47,650 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:31:47,673 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:31:47,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 557 transitions. [2022-02-21 04:31:47,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2022-02-21 04:31:47,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 306 states and 540 transitions. [2022-02-21 04:31:47,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2022-02-21 04:31:47,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2022-02-21 04:31:47,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 540 transitions. [2022-02-21 04:31:47,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:47,712 INFO L681 BuchiCegarLoop]: Abstraction has 306 states and 540 transitions. [2022-02-21 04:31:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 540 transitions. [2022-02-21 04:31:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-02-21 04:31:47,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:47,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states and 540 transitions. Second operand has 306 states, 306 states have (on average 1.7647058823529411) internal successors, (540), 305 states have internal predecessors, (540), 0 states have call successors, (0), 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:31:47,748 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states and 540 transitions. Second operand has 306 states, 306 states have (on average 1.7647058823529411) internal successors, (540), 305 states have internal predecessors, (540), 0 states have call successors, (0), 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:31:47,750 INFO L87 Difference]: Start difference. First operand 306 states and 540 transitions. Second operand has 306 states, 306 states have (on average 1.7647058823529411) internal successors, (540), 305 states have internal predecessors, (540), 0 states have call successors, (0), 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:31:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:47,769 INFO L93 Difference]: Finished difference Result 306 states and 540 transitions. [2022-02-21 04:31:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 540 transitions. [2022-02-21 04:31:47,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:47,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:47,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 306 states, 306 states have (on average 1.7647058823529411) internal successors, (540), 305 states have internal predecessors, (540), 0 states have call successors, (0), 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 306 states and 540 transitions. [2022-02-21 04:31:47,774 INFO L87 Difference]: Start difference. First operand has 306 states, 306 states have (on average 1.7647058823529411) internal successors, (540), 305 states have internal predecessors, (540), 0 states have call successors, (0), 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 306 states and 540 transitions. [2022-02-21 04:31:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:47,782 INFO L93 Difference]: Finished difference Result 306 states and 540 transitions. [2022-02-21 04:31:47,782 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 540 transitions. [2022-02-21 04:31:47,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:47,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:47,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:47,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 306 states have (on average 1.7647058823529411) internal successors, (540), 305 states have internal predecessors, (540), 0 states have call successors, (0), 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:31:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 540 transitions. [2022-02-21 04:31:47,796 INFO L704 BuchiCegarLoop]: Abstraction has 306 states and 540 transitions. [2022-02-21 04:31:47,796 INFO L587 BuchiCegarLoop]: Abstraction has 306 states and 540 transitions. [2022-02-21 04:31:47,796 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:31:47,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 306 states and 540 transitions. [2022-02-21 04:31:47,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2022-02-21 04:31:47,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:47,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:47,799 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:31:47,800 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:31:47,800 INFO L791 eck$LassoCheckResult]: Stem: 948#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 926#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~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#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;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#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; 715#L441 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 716#L452 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 836#L462 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 798#L473 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 880#L483 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 912#L494 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 940#L504 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 743#L515 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 647#L525 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 648#L536 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 757#L546 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 758#L557 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 779#L567 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 780#L578 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 846#L588 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 699#L599 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 834#L609 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 763#L620 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 796#L630 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 741#L641 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 927#L651 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 701#L662 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 873#L672 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 874#L683 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 941#L693 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 687#L704 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 902#L714 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 672#L725 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 673#L735 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 651#L746 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 823#L756 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 664#L767 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 720#L777 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 721#L788 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 889#L798 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 864#L809 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 930#L819 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 898#L830 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 868#L840 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 822#L851 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 920#L861 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 769#L872 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 925#L882 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 748#L893 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 835#L903 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 828#L914 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 829#L924 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 812#L935 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 813#L945 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 658#L945-1 init_#res#1 := init_~tmp___23~0#1; 830#L1082 main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#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; 831#L21 assume !(0 == assume_abort_if_not_~cond#1); 856#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; 689#L1223-2 [2022-02-21 04:31:47,800 INFO L793 eck$LassoCheckResult]: Loop: 689#L1223-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, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 690#L114 assume !(0 != ~mode1~0 % 256); 789#L150 assume !(~r1~0 < 3); 784#L150-1 ~mode1~0 := 1; 767#L114-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 734#L178 assume !(0 != ~mode2~0 % 256); 735#L214 assume !(~r2~0 < 3); 685#L214-1 ~mode2~0 := 1; 838#L178-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 903#L242 assume !(0 != ~mode3~0 % 256); 895#L278 assume !(~r3~0 < 3); 801#L278-1 ~mode3~0 := 1; 855#L242-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 883#L306 assume !(0 != ~mode4~0 % 256); 753#L342 assume !(~r4~0 < 3); 678#L342-1 ~mode4~0 := 1; 679#L306-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; 732#L1090 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 733#L1091 assume ~st1~0 + ~nl1~0 <= 1; 804#L1092 assume ~st2~0 + ~nl2~0 <= 1; 915#L1093 assume ~st3~0 + ~nl3~0 <= 1; 939#L1094 assume ~st4~0 + ~nl4~0 <= 1; 936#L1095 assume ~r1~0 >= 3; 827#L1099 assume ~r1~0 < 3; 943#L1104 assume ~r1~0 >= 3; 719#L1109 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 723#L1090-1 check_#res#1 := check_~tmp~1#1; 724#L1142 main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#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; 727#L1266 assume !(0 == assert_~arg#1 % 256); 728#L1261 assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; 689#L1223-2 [2022-02-21 04:31:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1995424982, now seen corresponding path program 2 times [2022-02-21 04:31:47,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:47,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390968197] [2022-02-21 04:31:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:47,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {1565#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; {1565#true} is VALID [2022-02-21 04:31:47,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {1565#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~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#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;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#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; {1565#true} is VALID [2022-02-21 04:31:47,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {1565#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {1565#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {1565#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {1565#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {1565#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {1565#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {1565#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {1565#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {1565#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {1565#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {1565#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {1565#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {1565#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {1565#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {1565#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {1565#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {1565#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {1565#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {1565#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {1565#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {1565#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {1565#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {1565#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {1565#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {1565#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {1565#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {1565#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {1565#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {1565#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {1565#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {1565#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {1565#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {1565#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {1565#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {1565#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {1565#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {1565#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {1565#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {1565#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {1565#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {1565#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,901 INFO L290 TraceCheckUtils]: 43: Hoare triple {1565#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {1565#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {1565#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,901 INFO L290 TraceCheckUtils]: 46: Hoare triple {1565#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {1565#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,902 INFO L290 TraceCheckUtils]: 48: Hoare triple {1565#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {1565#true} is VALID [2022-02-21 04:31:47,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {1565#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {1565#true} is VALID [2022-02-21 04:31:47,903 INFO L290 TraceCheckUtils]: 50: Hoare triple {1565#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {1567#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:31:47,903 INFO L290 TraceCheckUtils]: 51: Hoare triple {1567#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {1568#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:31:47,904 INFO L290 TraceCheckUtils]: 52: Hoare triple {1568#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#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; {1569#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:31:47,904 INFO L290 TraceCheckUtils]: 53: Hoare triple {1569#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {1566#false} is VALID [2022-02-21 04:31:47,904 INFO L290 TraceCheckUtils]: 54: Hoare triple {1566#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; {1566#false} is VALID [2022-02-21 04:31:47,917 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:31:47,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:47,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390968197] [2022-02-21 04:31:47,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390968197] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:47,918 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:47,918 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:47,918 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166870624] [2022-02-21 04:31:47,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:47,918 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1889919164, now seen corresponding path program 1 times [2022-02-21 04:31:47,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:47,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962023639] [2022-02-21 04:31:47,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:47,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {1570#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, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {1570#true} is VALID [2022-02-21 04:31:47,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {1570#true} assume !(0 != ~mode1~0 % 256); {1570#true} is VALID [2022-02-21 04:31:47,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {1570#true} assume !(~r1~0 < 3); {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,976 INFO L290 TraceCheckUtils]: 3: Hoare triple {1572#(not (<= ~r1~0 2))} ~mode1~0 := 1; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,976 INFO L290 TraceCheckUtils]: 4: Hoare triple {1572#(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, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {1572#(not (<= ~r1~0 2))} assume !(0 != ~mode2~0 % 256); {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {1572#(not (<= ~r1~0 2))} assume !(~r2~0 < 3); {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#(not (<= ~r1~0 2))} ~mode2~0 := 1; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {1572#(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, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {1572#(not (<= ~r1~0 2))} assume !(0 != ~mode3~0 % 256); {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {1572#(not (<= ~r1~0 2))} assume !(~r3~0 < 3); {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {1572#(not (<= ~r1~0 2))} ~mode3~0 := 1; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {1572#(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, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {1572#(not (<= ~r1~0 2))} assume !(0 != ~mode4~0 % 256); {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {1572#(not (<= ~r1~0 2))} assume !(~r4~0 < 3); {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {1572#(not (<= ~r1~0 2))} ~mode4~0 := 1; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {1572#(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; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {1572#(not (<= ~r1~0 2))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {1572#(not (<= ~r1~0 2))} assume ~st1~0 + ~nl1~0 <= 1; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {1572#(not (<= ~r1~0 2))} assume ~st2~0 + ~nl2~0 <= 1; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {1572#(not (<= ~r1~0 2))} assume ~st3~0 + ~nl3~0 <= 1; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {1572#(not (<= ~r1~0 2))} assume ~st4~0 + ~nl4~0 <= 1; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {1572#(not (<= ~r1~0 2))} assume ~r1~0 >= 3; {1572#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:47,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {1572#(not (<= ~r1~0 2))} assume ~r1~0 < 3; {1571#false} is VALID [2022-02-21 04:31:47,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {1571#false} assume ~r1~0 >= 3; {1571#false} is VALID [2022-02-21 04:31:47,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {1571#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {1571#false} is VALID [2022-02-21 04:31:47,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {1571#false} check_#res#1 := check_~tmp~1#1; {1571#false} is VALID [2022-02-21 04:31:47,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {1571#false} main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#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; {1571#false} is VALID [2022-02-21 04:31:47,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {1571#false} assume !(0 == assert_~arg#1 % 256); {1571#false} is VALID [2022-02-21 04:31:47,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {1571#false} assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; {1571#false} is VALID [2022-02-21 04:31:47,986 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:31:47,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:47,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962023639] [2022-02-21 04:31:47,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962023639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:47,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:47,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:47,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667047492] [2022-02-21 04:31:47,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:47,987 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:47,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:47,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:47,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:47,989 INFO L87 Difference]: Start difference. First operand 306 states and 540 transitions. cyclomatic complexity: 235 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:31:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:48,424 INFO L93 Difference]: Finished difference Result 403 states and 695 transitions. [2022-02-21 04:31:48,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:48,425 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:31:48,449 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:31:48,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 403 states and 695 transitions. [2022-02-21 04:31:48,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2022-02-21 04:31:48,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 403 states to 403 states and 695 transitions. [2022-02-21 04:31:48,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 403 [2022-02-21 04:31:48,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 403 [2022-02-21 04:31:48,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 403 states and 695 transitions. [2022-02-21 04:31:48,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:48,472 INFO L681 BuchiCegarLoop]: Abstraction has 403 states and 695 transitions. [2022-02-21 04:31:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states and 695 transitions. [2022-02-21 04:31:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2022-02-21 04:31:48,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:48,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states and 695 transitions. Second operand has 403 states, 403 states have (on average 1.7245657568238213) internal successors, (695), 402 states have internal predecessors, (695), 0 states have call successors, (0), 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:31:48,489 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states and 695 transitions. Second operand has 403 states, 403 states have (on average 1.7245657568238213) internal successors, (695), 402 states have internal predecessors, (695), 0 states have call successors, (0), 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:31:48,491 INFO L87 Difference]: Start difference. First operand 403 states and 695 transitions. Second operand has 403 states, 403 states have (on average 1.7245657568238213) internal successors, (695), 402 states have internal predecessors, (695), 0 states have call successors, (0), 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:31:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:48,561 INFO L93 Difference]: Finished difference Result 403 states and 695 transitions. [2022-02-21 04:31:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 695 transitions. [2022-02-21 04:31:48,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:48,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:48,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 403 states, 403 states have (on average 1.7245657568238213) internal successors, (695), 402 states have internal predecessors, (695), 0 states have call successors, (0), 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 403 states and 695 transitions. [2022-02-21 04:31:48,566 INFO L87 Difference]: Start difference. First operand has 403 states, 403 states have (on average 1.7245657568238213) internal successors, (695), 402 states have internal predecessors, (695), 0 states have call successors, (0), 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 403 states and 695 transitions. [2022-02-21 04:31:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:48,587 INFO L93 Difference]: Finished difference Result 403 states and 695 transitions. [2022-02-21 04:31:48,587 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 695 transitions. [2022-02-21 04:31:48,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:48,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:48,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:48,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 403 states have (on average 1.7245657568238213) internal successors, (695), 402 states have internal predecessors, (695), 0 states have call successors, (0), 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:31:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 695 transitions. [2022-02-21 04:31:48,602 INFO L704 BuchiCegarLoop]: Abstraction has 403 states and 695 transitions. [2022-02-21 04:31:48,602 INFO L587 BuchiCegarLoop]: Abstraction has 403 states and 695 transitions. [2022-02-21 04:31:48,602 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:31:48,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 403 states and 695 transitions. [2022-02-21 04:31:48,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2022-02-21 04:31:48,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:48,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:48,605 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:31:48,606 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:31:48,606 INFO L791 eck$LassoCheckResult]: Stem: 2289#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 2264#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~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#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;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#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; 2045#L441 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 2046#L452 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 2169#L462 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 2131#L473 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 2215#L483 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 2249#L494 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 2280#L504 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 2075#L515 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 1976#L525 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 1977#L536 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 2089#L546 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 2090#L557 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 2111#L567 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 2112#L578 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 2179#L588 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 2029#L599 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 2166#L609 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 2094#L620 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 2129#L630 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 2070#L641 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 2265#L651 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 2031#L662 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 2208#L672 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 2209#L683 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 2281#L693 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 2019#L704 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 2237#L714 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 2001#L725 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 2002#L735 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 1980#L746 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 2156#L756 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 1996#L767 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 2052#L777 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 2053#L788 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 2224#L798 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 2199#L809 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 2268#L819 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 2233#L830 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 2203#L840 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 2155#L851 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 2258#L861 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 2101#L872 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 2263#L882 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 2080#L893 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 2167#L903 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 2161#L914 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 2162#L924 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 2145#L935 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 2146#L945 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 1989#L945-1 init_#res#1 := init_~tmp___23~0#1; 2163#L1082 main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#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; 2164#L21 assume !(0 == assume_abort_if_not_~cond#1); 2188#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; 2250#L1223-2 [2022-02-21 04:31:48,606 INFO L793 eck$LassoCheckResult]: Loop: 2250#L1223-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, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 2374#L114 assume !(0 != ~mode1~0 % 256); 2373#L150 assume ~r1~0 < 3; 2173#L151 assume !(0 != ~ep12~0 % 256); 2078#L151-1 assume !(0 != ~ep13~0 % 256); 2000#L156 assume !(0 != ~ep14~0 % 256); 2116#L150-1 ~mode1~0 := 1; 2238#L114-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 2358#L178 assume !(0 != ~mode2~0 % 256); 2344#L214 assume !(~r2~0 < 3); 2343#L214-1 ~mode2~0 := 1; 2337#L178-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 2332#L242 assume !(0 != ~mode3~0 % 256); 2326#L278 assume !(~r3~0 < 3); 2321#L278-1 ~mode3~0 := 1; 2319#L242-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 2315#L306 assume !(0 != ~mode4~0 % 256); 2306#L342 assume !(~r4~0 < 3); 2301#L342-1 ~mode4~0 := 1; 2299#L306-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; 2298#L1090 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 2297#L1091 assume ~st1~0 + ~nl1~0 <= 1; 2296#L1092 assume ~st2~0 + ~nl2~0 <= 1; 2295#L1093 assume ~st3~0 + ~nl3~0 <= 1; 2294#L1094 assume ~st4~0 + ~nl4~0 <= 1; 2293#L1095 assume !(~r1~0 >= 3); 2159#L1098 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 2160#L1099 assume ~r1~0 < 3; 2292#L1104 assume !(~r1~0 >= 3); 2050#L1108 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 2051#L1109 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 2378#L1090-1 check_#res#1 := check_~tmp~1#1; 2377#L1142 main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#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; 2376#L1266 assume !(0 == assert_~arg#1 % 256); 2375#L1261 assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; 2250#L1223-2 [2022-02-21 04:31:48,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1995424982, now seen corresponding path program 3 times [2022-02-21 04:31:48,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:48,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560230902] [2022-02-21 04:31:48,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:48,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:48,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {3188#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; {3188#true} is VALID [2022-02-21 04:31:48,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {3188#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~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#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;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#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; {3188#true} is VALID [2022-02-21 04:31:48,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {3188#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {3188#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {3188#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {3188#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {3188#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {3188#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {3188#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {3188#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {3188#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {3188#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {3188#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {3188#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {3188#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {3188#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {3188#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {3188#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {3188#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {3188#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {3188#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {3188#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {3188#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {3188#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {3188#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {3188#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {3188#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {3188#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {3188#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {3188#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {3188#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {3188#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {3188#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {3188#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {3188#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {3188#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {3188#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {3188#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {3188#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {3188#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {3188#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {3188#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {3188#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {3188#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {3188#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {3188#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {3188#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {3188#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {3188#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {3188#true} is VALID [2022-02-21 04:31:48,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {3188#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3188#true} is VALID [2022-02-21 04:31:48,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {3188#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {3190#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:31:48,676 INFO L290 TraceCheckUtils]: 51: Hoare triple {3190#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {3191#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:31:48,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {3191#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#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; {3192#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:31:48,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {3192#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {3189#false} is VALID [2022-02-21 04:31:48,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {3189#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; {3189#false} is VALID [2022-02-21 04:31:48,677 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:31:48,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:48,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560230902] [2022-02-21 04:31:48,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560230902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:48,678 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:48,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:48,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187282173] [2022-02-21 04:31:48,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:48,679 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:48,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:48,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2081002357, now seen corresponding path program 1 times [2022-02-21 04:31:48,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:48,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522145436] [2022-02-21 04:31:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:48,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:48,696 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:48,725 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:49,757 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:49,758 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:49,758 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:49,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:49,758 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:31:49,758 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:49,758 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:49,759 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:49,759 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:31:49,759 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:49,759 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:49,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:49,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:49,792 INFO L141 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:31:49,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:49,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:49,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:49,801 INFO L141 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:31:49,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:49,816 INFO L141 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:31:49,820 INFO L141 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:31:49,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:49,826 INFO L141 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:31:49,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:49,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:49,833 INFO L141 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:31:49,835 INFO L141 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:31:49,838 INFO L141 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:31:49,840 INFO L141 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:31:49,843 INFO L141 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:31:49,846 INFO L141 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:31:49,854 INFO L141 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:31:49,856 INFO L141 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:31:49,857 INFO L141 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:31:49,859 INFO L141 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:31:49,863 INFO L141 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:31:49,901 INFO L141 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:31:49,904 INFO L141 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:31:49,906 INFO L141 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:31:49,910 INFO L141 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:31:49,912 INFO L141 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:31:49,914 INFO L141 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:31:49,917 INFO L141 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:31:49,920 INFO L141 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:31:49,922 INFO L141 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:31:50,674 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:31:50,675 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:31:50,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:50,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:50,687 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:31:50,691 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:31:50,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:31:50,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:50,754 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:31:50,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:50,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:50,756 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:31:50,758 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:31:50,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:31:50,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:50,905 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:31:50,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 04:31:50,909 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:50,909 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:50,909 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:50,910 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:50,910 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:31:50,910 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:50,910 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:50,910 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:50,910 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:31:50,910 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:50,910 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:50,912 INFO L141 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:31:50,925 INFO L141 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:31:50,930 INFO L141 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:31:50,932 INFO L141 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:31:50,934 INFO L141 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:31:50,936 INFO L141 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:31:50,938 INFO L141 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:31:50,940 INFO L141 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:31:50,942 INFO L141 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:31:50,947 INFO L141 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:31:50,950 INFO L141 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:31:50,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:50,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:51,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:51,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:51,013 INFO L141 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:31:51,015 INFO L141 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:31:51,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:31:51,020 INFO L141 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:31:51,022 INFO L141 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:31:51,025 INFO L141 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:31:51,029 INFO L141 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:31:51,038 INFO L141 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:31:51,040 INFO L141 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:31:51,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:31:51,043 INFO L141 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:31:51,044 INFO L141 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:31:51,049 INFO L141 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:31:51,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:51,054 INFO L141 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:31:51,065 INFO L141 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:31:51,069 INFO L141 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:31:51,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:51,073 INFO L141 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:31:51,821 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:31:51,824 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:31:51,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:51,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:51,826 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:31:51,827 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:31:51,828 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:31:51,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:51,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:51,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:51,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:51,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:51,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:51,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:51,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:51,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 04:31:51,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:51,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:51,871 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:31:51,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:31:51,873 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:31:51,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:51,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:51,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:51,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:51,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:51,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:51,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:51,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:51,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 04:31:51,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:51,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:51,915 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:31:51,934 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:31:51,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:51,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:51,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:51,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:51,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:51,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:51,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:51,943 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:31:51,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:51,960 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:31:51,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:51,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:51,964 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:31:51,965 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:31:51,967 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:31:51,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:51,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:51,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:51,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:51,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:51,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:51,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:51,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:51,989 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:31:51,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:51,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:51,991 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:31:51,993 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:31:51,994 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:31:52,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,025 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:31:52,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,026 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:31:52,027 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:31:52,028 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:31:52,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,052 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:31:52,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,054 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:31:52,054 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:31:52,056 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:31:52,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,091 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:31:52,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,093 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:31:52,094 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:31:52,095 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:31:52,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,119 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:31:52,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,121 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:31:52,122 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:31:52,122 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:31:52,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 04:31:52,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,167 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:31:52,168 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:31:52,169 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:31:52,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 04:31:52,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,209 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:31:52,216 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:31:52,216 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:31:52,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,240 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:31:52,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,242 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:31:52,242 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:31:52,243 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:31:52,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:52,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,269 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:31:52,269 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:31:52,271 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:31:52,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,313 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:31:52,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,315 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:31:52,316 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:31:52,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:52,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,394 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:31:52,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,406 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:31:52,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:52,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,426 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:31:52,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,453 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:31:52,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,454 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:31:52,456 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:31:52,457 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:31:52,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 04:31:52,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,514 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:31:52,515 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:31:52,516 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:31:52,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,540 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:31:52,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,543 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:31:52,546 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:31:52,546 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:31:52,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,568 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:31:52,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,570 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:31:52,570 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:31:52,573 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:31:52,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 04:31:52,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,606 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:31:52,608 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:31:52,608 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:31:52,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:52,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 04:31:52,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,646 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:52,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:31:52,648 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:31:52,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:52,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:52,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:52,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:52,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:52,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:52,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:52,658 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:31:52,662 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:31:52,662 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:31:52,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:52,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:52,665 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:52,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:31:52,668 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:31:52,668 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:31:52,668 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:31:52,668 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:31:52,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 04:31:52,702 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:31:52,715 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, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0;" "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, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0;" "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, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0;" "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, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0;" "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~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#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~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1;" [2022-02-21 04:31:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:52,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:52,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:31:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:52,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:31:53,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:53,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {3195#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; {3195#unseeded} is VALID [2022-02-21 04:31:53,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {3195#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~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#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;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#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; {3195#unseeded} is VALID [2022-02-21 04:31:53,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {3195#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {3195#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {3195#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {3195#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {3195#unseeded} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {3195#unseeded} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {3195#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {3195#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {3195#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {3195#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {3195#unseeded} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {3195#unseeded} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {3195#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {3195#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {3195#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {3195#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {3195#unseeded} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {3195#unseeded} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {3195#unseeded} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {3195#unseeded} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {3195#unseeded} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {3195#unseeded} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {3195#unseeded} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {3195#unseeded} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {3195#unseeded} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {3195#unseeded} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {3195#unseeded} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {3195#unseeded} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {3195#unseeded} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {3195#unseeded} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {3195#unseeded} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {3195#unseeded} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {3195#unseeded} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {3195#unseeded} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {3195#unseeded} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {3195#unseeded} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {3195#unseeded} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {3195#unseeded} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {3195#unseeded} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {3195#unseeded} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {3195#unseeded} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {3195#unseeded} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {3195#unseeded} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {3195#unseeded} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {3195#unseeded} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {3195#unseeded} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {3195#unseeded} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {3195#unseeded} is VALID [2022-02-21 04:31:53,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {3195#unseeded} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3195#unseeded} is VALID [2022-02-21 04:31:53,062 INFO L290 TraceCheckUtils]: 50: Hoare triple {3195#unseeded} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {3195#unseeded} is VALID [2022-02-21 04:31:53,062 INFO L290 TraceCheckUtils]: 51: Hoare triple {3195#unseeded} init_#res#1 := init_~tmp___23~0#1; {3195#unseeded} is VALID [2022-02-21 04:31:53,063 INFO L290 TraceCheckUtils]: 52: Hoare triple {3195#unseeded} main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#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; {3195#unseeded} is VALID [2022-02-21 04:31:53,063 INFO L290 TraceCheckUtils]: 53: Hoare triple {3195#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {3195#unseeded} is VALID [2022-02-21 04:31:53,063 INFO L290 TraceCheckUtils]: 54: Hoare triple {3195#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; {3195#unseeded} is VALID [2022-02-21 04:31:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:53,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:31:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:53,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:31:53,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {3198#(>= 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, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode1~0 % 256); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep12~0 % 256); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep13~0 % 256); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep14~0 % 256); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode1~0 := 1; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {3375#(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, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode2~0 % 256); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r2~0 < 3); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode2~0 := 1; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {3375#(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, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode3~0 % 256); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r3~0 < 3); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode3~0 := 1; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {3375#(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, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode4~0 % 256); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r4~0 < 3); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode4~0 := 1; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {3375#(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; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {3375#(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; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~nl1~0 <= 1; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st2~0 + ~nl2~0 <= 1; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st3~0 + ~nl3~0 <= 1; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st4~0 + ~nl4~0 <= 1; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {3375#(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; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {3375#(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; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {3375#(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; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} check_#res#1 := check_~tmp~1#1; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#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; {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 == assert_~arg#1 % 256); {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:53,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {3375#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; {3208#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:31:53,431 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:31:53,432 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:31:53,455 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:31:53,456 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:31:53,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:53,459 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:31:53,460 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 403 states and 695 transitions. cyclomatic complexity: 293 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:31:53,981 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 403 states and 695 transitions. cyclomatic complexity: 293. 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 621 states and 1052 transitions. Complement of second has 4 states. [2022-02-21 04:31:53,981 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:31:53,981 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:31:53,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 403 states and 695 transitions. cyclomatic complexity: 293 [2022-02-21 04:31:53,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:53,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:53,982 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:31:53,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:31:53,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:53,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:53,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 621 states and 1052 transitions. [2022-02-21 04:31:53,989 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:53,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:31:53,991 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 403 states and 695 transitions. cyclomatic complexity: 293 [2022-02-21 04:31:54,072 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 219 examples of accepted words. [2022-02-21 04:31:54,073 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:31:54,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:31:54,076 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:31:54,076 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 621 states and 1052 transitions. cyclomatic complexity: 432 [2022-02-21 04:31:54,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 621 states and 1052 transitions. cyclomatic complexity: 432 [2022-02-21 04:31:54,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:31:54,076 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:31:54,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:31:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,077 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:31:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:31:54,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:54,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,078 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:31:54,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:54,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 621 letters. Loop has 621 letters. [2022-02-21 04:31:54,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,079 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 621 letters. Loop has 621 letters. [2022-02-21 04:31:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 621 letters. Loop has 621 letters. [2022-02-21 04:31:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 403 letters. Loop has 403 letters. [2022-02-21 04:31:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,080 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 403 letters. Loop has 403 letters. [2022-02-21 04:31:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 403 letters. Loop has 403 letters. [2022-02-21 04:31:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:31:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,081 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:31:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:31:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:31:54,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,082 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:31:54,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:31:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:31:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,083 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:31:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:31:54,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 84 letters. Loop has 35 letters. [2022-02-21 04:31:54,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,084 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:31:54,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 84 letters. Loop has 35 letters. [2022-02-21 04:31:54,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 85 letters. Loop has 35 letters. [2022-02-21 04:31:54,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,085 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:31:54,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 85 letters. Loop has 35 letters. [2022-02-21 04:31:54,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:31:54,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,086 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:31:54,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:31:54,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:31:54,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,088 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:31:54,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:31:54,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:31:54,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,089 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:31:54,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:31:54,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:31:54,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,090 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:31:54,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:31:54,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:31:54,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,091 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:31:54,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:31:54,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:31:54,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,092 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:31:54,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:31:54,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:31:54,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,093 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:31:54,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:31:54,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:31:54,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,094 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:31:54,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:31:54,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:31:54,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,095 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:31:54,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:31:54,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:54,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,096 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:31:54,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:54,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:54,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,097 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:31:54,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:54,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:31:54,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,098 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:31:54,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:31:54,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:31:54,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,099 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:31:54,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:31:54,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:31:54,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,100 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:31:54,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:31:54,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:31:54,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,101 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:31:54,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:31:54,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:31:54,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,102 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:31:54,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:31:54,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:31:54,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,104 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:31:54,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:31:54,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:31:54,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,105 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 36 letters. [2022-02-21 04:31:54,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:31:54,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:31:54,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,106 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:31:54,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:31:54,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:31:54,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,107 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:31:54,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:31:54,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:31:54,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,108 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:31:54,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:31:54,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:31:54,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,109 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:31:54,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:31:54,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:31:54,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,110 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:31:54,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:31:54,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:54,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,111 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:31:54,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:54,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:31:54,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,112 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:31:54,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:31:54,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:31:54,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,113 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:31:54,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:31:54,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:31:54,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,114 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:31:54,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:31:54,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:31:54,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,115 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:31:54,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:31:54,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:31:54,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,116 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:31:54,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:31:54,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 63 letters. Loop has 38 letters. [2022-02-21 04:31:54,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,117 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 38 letters. [2022-02-21 04:31:54,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 63 letters. Loop has 38 letters. [2022-02-21 04:31:54,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:31:54,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,118 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:31:54,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:31:54,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:31:54,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,119 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:31:54,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:31:54,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:31:54,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,120 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:31:54,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:31:54,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 57 letters. Loop has 36 letters. [2022-02-21 04:31:54,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,121 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 36 letters. [2022-02-21 04:31:54,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 57 letters. Loop has 36 letters. [2022-02-21 04:31:54,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:31:54,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,122 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:31:54,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:31:54,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:31:54,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,123 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:31:54,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:31:54,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:31:54,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,124 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:31:54,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:31:54,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:31:54,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,125 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:31:54,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:31:54,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:31:54,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,126 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:31:54,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:31:54,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:31:54,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,127 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:31:54,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:31:54,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:31:54,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,128 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:31:54,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:31:54,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:31:54,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,129 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:31:54,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:31:54,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:31:54,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,130 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:31:54,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:31:54,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:31:54,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,131 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:31:54,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:31:54,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 81 letters. Loop has 35 letters. [2022-02-21 04:31:54,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,132 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:31:54,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 81 letters. Loop has 35 letters. [2022-02-21 04:31:54,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 82 letters. Loop has 35 letters. [2022-02-21 04:31:54,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,133 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:31:54,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 82 letters. Loop has 35 letters. [2022-02-21 04:31:54,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:31:54,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,134 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:31:54,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:31:54,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:54,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,135 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:31:54,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:54,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:31:54,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,136 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:31:54,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:31:54,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:31:54,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,137 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:31:54,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:31:54,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:31:54,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,138 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:31:54,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:31:54,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:31:54,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,139 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:31:54,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:31:54,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:31:54,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,147 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:31:54,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:31:54,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:31:54,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,148 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:31:54,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:31:54,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:31:54,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,150 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:31:54,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:31:54,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:31:54,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,151 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:31:54,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:31:54,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:31:54,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,152 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:31:54,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:31:54,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:31:54,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,153 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:31:54,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:31:54,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:31:54,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,155 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:31:54,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:31:54,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:31:54,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,158 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:31:54,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:31:54,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:31:54,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,159 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:31:54,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:31:54,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:31:54,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,160 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:31:54,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:31:54,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:31:54,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,162 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:31:54,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:31:54,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:31:54,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,163 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:31:54,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:31:54,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:31:54,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,164 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:31:54,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:31:54,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:31:54,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,166 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:31:54,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:31:54,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:31:54,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,167 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:31:54,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:31:54,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:31:54,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,169 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:31:54,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:31:54,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:31:54,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 65 letters. Loop has 32 letters. [2022-02-21 04:31:54,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:31:54,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:31:54,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 64 letters. Loop has 36 letters. [2022-02-21 04:31:54,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:31:54,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:31:54,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 62 letters. Loop has 35 letters. [2022-02-21 04:31:54,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:31:54,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:31:54,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 64 letters. Loop has 32 letters. [2022-02-21 04:31:54,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:31:54,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:31:54,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 72 letters. Loop has 39 letters. [2022-02-21 04:31:54,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:31:54,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:31:54,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 62 letters. Loop has 38 letters. [2022-02-21 04:31:54,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:31:54,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:31:54,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 68 letters. Loop has 38 letters. [2022-02-21 04:31:54,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:31:54,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:31:54,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 69 letters. Loop has 38 letters. [2022-02-21 04:31:54,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:31:54,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:31:54,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 55 letters. Loop has 35 letters. [2022-02-21 04:31:54,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:31:54,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:31:54,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 72 letters. Loop has 37 letters. [2022-02-21 04:31:54,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:31:54,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:31:54,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 75 letters. Loop has 32 letters. [2022-02-21 04:31:54,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:31:54,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:31:54,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 58 letters. Loop has 37 letters. [2022-02-21 04:31:54,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:31:54,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:31:54,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 58 letters. Loop has 36 letters. [2022-02-21 04:31:54,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:31:54,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:31:54,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 38 letters. [2022-02-21 04:31:54,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:31:54,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:31:54,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 74 letters. Loop has 38 letters. [2022-02-21 04:31:54,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:31:54,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:31:54,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 71 letters. Loop has 40 letters. [2022-02-21 04:31:54,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:31:54,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:31:54,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 71 letters. Loop has 39 letters. [2022-02-21 04:31:54,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:31:54,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:31:54,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,205 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:31:54,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:31:54,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:31:54,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 78 letters. Loop has 32 letters. [2022-02-21 04:31:54,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:31:54,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:31:54,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 73 letters. Loop has 36 letters. [2022-02-21 04:31:54,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:31:54,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:31:54,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 76 letters. Loop has 32 letters. [2022-02-21 04:31:54,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:31:54,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:31:54,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,210 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:31:54,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:31:54,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:31:54,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,211 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:31:54,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:31:54,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:31:54,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,213 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:31:54,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:31:54,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:31:54,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,214 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:31:54,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:31:54,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:54,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,215 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:31:54,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:54,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:31:54,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,223 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:31:54,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:31:54,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:31:54,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 68 letters. Loop has 36 letters. [2022-02-21 04:31:54,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:31:54,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:31:54,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 65 letters. Loop has 36 letters. [2022-02-21 04:31:54,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:31:54,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 83 letters. Loop has 35 letters. [2022-02-21 04:31:54,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,228 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:31:54,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 83 letters. Loop has 35 letters. [2022-02-21 04:31:54,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 80 letters. Loop has 35 letters. [2022-02-21 04:31:54,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 80 letters. Loop has 35 letters. [2022-02-21 04:31:54,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 80 letters. Loop has 35 letters. [2022-02-21 04:31:54,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 79 letters. Loop has 35 letters. [2022-02-21 04:31:54,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 79 letters. Loop has 35 letters. [2022-02-21 04:31:54,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 79 letters. Loop has 35 letters. [2022-02-21 04:31:54,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 78 letters. Loop has 35 letters. [2022-02-21 04:31:54,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 78 letters. Loop has 35 letters. [2022-02-21 04:31:54,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 78 letters. Loop has 35 letters. [2022-02-21 04:31:54,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:31:54,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 77 letters. Loop has 35 letters. [2022-02-21 04:31:54,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:31:54,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:31:54,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 76 letters. Loop has 35 letters. [2022-02-21 04:31:54,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:31:54,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:31:54,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 75 letters. Loop has 35 letters. [2022-02-21 04:31:54,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:31:54,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:31:54,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 74 letters. Loop has 35 letters. [2022-02-21 04:31:54,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:31:54,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:31:54,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 77 letters. Loop has 39 letters. [2022-02-21 04:31:54,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:31:54,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:31:54,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 73 letters. Loop has 35 letters. [2022-02-21 04:31:54,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:31:54,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:31:54,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 76 letters. Loop has 39 letters. [2022-02-21 04:31:54,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:31:54,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:31:54,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 77 letters. Loop has 40 letters. [2022-02-21 04:31:54,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:31:54,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:31:54,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 75 letters. Loop has 38 letters. [2022-02-21 04:31:54,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:31:54,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:31:54,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 76 letters. Loop has 39 letters. [2022-02-21 04:31:54,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:31:54,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:31:54,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 72 letters. Loop has 35 letters. [2022-02-21 04:31:54,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:31:54,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:31:54,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 73 letters. Loop has 38 letters. [2022-02-21 04:31:54,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:31:54,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 78 letters. Loop has 41 letters. [2022-02-21 04:31:54,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 78 letters. Loop has 41 letters. [2022-02-21 04:31:54,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 78 letters. Loop has 41 letters. [2022-02-21 04:31:54,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 77 letters. Loop has 41 letters. [2022-02-21 04:31:54,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 77 letters. Loop has 41 letters. [2022-02-21 04:31:54,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 77 letters. Loop has 41 letters. [2022-02-21 04:31:54,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:31:54,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 75 letters. Loop has 39 letters. [2022-02-21 04:31:54,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:31:54,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 77 letters. Loop has 41 letters. [2022-02-21 04:31:54,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 77 letters. Loop has 41 letters. [2022-02-21 04:31:54,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 77 letters. Loop has 41 letters. [2022-02-21 04:31:54,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:31:54,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 39 letters. [2022-02-21 04:31:54,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:31:54,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 76 letters. Loop has 41 letters. [2022-02-21 04:31:54,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 41 letters. [2022-02-21 04:31:54,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 76 letters. Loop has 41 letters. [2022-02-21 04:31:54,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:31:54,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 74 letters. Loop has 38 letters. [2022-02-21 04:31:54,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:31:54,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:31:54,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 71 letters. Loop has 35 letters. [2022-02-21 04:31:54,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:31:54,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 76 letters. Loop has 41 letters. [2022-02-21 04:31:54,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 76 letters. Loop has 41 letters. [2022-02-21 04:31:54,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 76 letters. Loop has 41 letters. [2022-02-21 04:31:54,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:31:54,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 74 letters. Loop has 39 letters. [2022-02-21 04:31:54,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:31:54,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 75 letters. Loop has 41 letters. [2022-02-21 04:31:54,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 75 letters. Loop has 41 letters. [2022-02-21 04:31:54,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 75 letters. Loop has 41 letters. [2022-02-21 04:31:54,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:31:54,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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:31:54,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:31:54,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:31:54,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 73 letters. Loop has 39 letters. [2022-02-21 04:31:54,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:31:54,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:31:54,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 69 letters. Loop has 35 letters. [2022-02-21 04:31:54,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:31:54,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 74 letters. Loop has 41 letters. [2022-02-21 04:31:54,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 74 letters. Loop has 41 letters. [2022-02-21 04:31:54,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 74 letters. Loop has 41 letters. [2022-02-21 04:31:54,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:31:54,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 72 letters. Loop has 39 letters. [2022-02-21 04:31:54,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:31:54,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 41 letters. [2022-02-21 04:31:54,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 73 letters. Loop has 41 letters. [2022-02-21 04:31:54,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 41 letters. [2022-02-21 04:31:54,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:31:54,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 71 letters. Loop has 38 letters. [2022-02-21 04:31:54,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:31:54,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:31:54,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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:31:54,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:31:54,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:31:54,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 69 letters. Loop has 38 letters. [2022-02-21 04:31:54,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:31:54,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:31:54,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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:31:54,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:31:54,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:31:54,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 72 letters. Loop has 39 letters. [2022-02-21 04:31:54,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:31:54,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:31:54,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 75 letters. Loop has 40 letters. [2022-02-21 04:31:54,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:31:54,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:31:54,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 74 letters. Loop has 39 letters. [2022-02-21 04:31:54,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:31:54,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:31:54,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 67 letters. Loop has 35 letters. [2022-02-21 04:31:54,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:31:54,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:31:54,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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:31:54,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:31:54,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 72 letters. Loop has 41 letters. [2022-02-21 04:31:54,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 72 letters. Loop has 41 letters. [2022-02-21 04:31:54,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 72 letters. Loop has 41 letters. [2022-02-21 04:31:54,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:31:54,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 70 letters. Loop has 38 letters. [2022-02-21 04:31:54,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:31:54,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 41 letters. [2022-02-21 04:31:54,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 73 letters. Loop has 41 letters. [2022-02-21 04:31:54,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 41 letters. [2022-02-21 04:31:54,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:31:54,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 66 letters. Loop has 35 letters. [2022-02-21 04:31:54,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:31:54,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:31:54,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 74 letters. Loop has 40 letters. [2022-02-21 04:31:54,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:31:54,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:31:54,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 70 letters. Loop has 39 letters. [2022-02-21 04:31:54,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:31:54,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 72 letters. Loop has 41 letters. [2022-02-21 04:31:54,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 72 letters. Loop has 41 letters. [2022-02-21 04:31:54,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 72 letters. Loop has 41 letters. [2022-02-21 04:31:54,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 71 letters. Loop has 41 letters. [2022-02-21 04:31:54,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 71 letters. Loop has 41 letters. [2022-02-21 04:31:54,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 71 letters. Loop has 41 letters. [2022-02-21 04:31:54,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:31:54,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 69 letters. Loop has 39 letters. [2022-02-21 04:31:54,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:31:54,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:31:54,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 65 letters. Loop has 35 letters. [2022-02-21 04:31:54,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:31:54,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:31:54,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 64 letters. Loop has 35 letters. [2022-02-21 04:31:54,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:31:54,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:31:54,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 65 letters. Loop has 38 letters. [2022-02-21 04:31:54,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:31:54,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 41 letters. [2022-02-21 04:31:54,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 70 letters. Loop has 41 letters. [2022-02-21 04:31:54,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 41 letters. [2022-02-21 04:31:54,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:31:54,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 68 letters. Loop has 39 letters. [2022-02-21 04:31:54,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:31:54,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:31:54,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 69 letters. Loop has 41 letters. [2022-02-21 04:31:54,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:31:54,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:31:54,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 67 letters. Loop has 38 letters. [2022-02-21 04:31:54,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:31:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:31:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 70 letters. Loop has 37 letters. [2022-02-21 04:31:54,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:31:54,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:31:54,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 69 letters. Loop has 41 letters. [2022-02-21 04:31:54,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:31:54,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:31:54,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 67 letters. Loop has 39 letters. [2022-02-21 04:31:54,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:31:54,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 68 letters. Loop has 41 letters. [2022-02-21 04:31:54,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 68 letters. Loop has 41 letters. [2022-02-21 04:31:54,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 68 letters. Loop has 41 letters. [2022-02-21 04:31:54,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:31:54,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 66 letters. Loop has 38 letters. [2022-02-21 04:31:54,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:31:54,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 68 letters. Loop has 41 letters. [2022-02-21 04:31:54,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 41 letters. [2022-02-21 04:31:54,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 68 letters. Loop has 41 letters. [2022-02-21 04:31:54,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:31:54,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 39 letters. [2022-02-21 04:31:54,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:31:54,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 67 letters. Loop has 41 letters. [2022-02-21 04:31:54,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 41 letters. [2022-02-21 04:31:54,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 67 letters. Loop has 41 letters. [2022-02-21 04:31:54,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:31:54,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 63 letters. Loop has 35 letters. [2022-02-21 04:31:54,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:31:54,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:31:54,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 64 letters. Loop has 39 letters. [2022-02-21 04:31:54,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:31:54,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:31:54,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 69 letters. Loop has 40 letters. [2022-02-21 04:31:54,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:31:54,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:31:54,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 68 letters. Loop has 39 letters. [2022-02-21 04:31:54,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:31:54,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:31:54,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 67 letters. Loop has 39 letters. [2022-02-21 04:31:54,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:31:54,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:31:54,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 68 letters. Loop has 37 letters. [2022-02-21 04:31:54,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:31:54,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:31:54,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 67 letters. Loop has 36 letters. [2022-02-21 04:31:54,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:31:54,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:31:54,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 66 letters. Loop has 39 letters. [2022-02-21 04:31:54,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:31:54,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:31:54,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 67 letters. Loop has 40 letters. [2022-02-21 04:31:54,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:31:54,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:31:54,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 67 letters. Loop has 37 letters. [2022-02-21 04:31:54,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:31:54,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:31:54,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 66 letters. Loop has 36 letters. [2022-02-21 04:31:54,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:31:54,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:31:54,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 66 letters. Loop has 37 letters. [2022-02-21 04:31:54,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:31:54,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:31:54,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 66 letters. Loop has 40 letters. [2022-02-21 04:31:54,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:31:54,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:31:54,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 65 letters. Loop has 39 letters. [2022-02-21 04:31:54,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:31:54,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:31:54,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 65 letters. Loop has 40 letters. [2022-02-21 04:31:54,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:31:54,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:31:54,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 57 letters. Loop has 35 letters. [2022-02-21 04:31:54,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:31:54,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 56 letters. Loop has 35 letters. [2022-02-21 04:31:54,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 56 letters. Loop has 35 letters. [2022-02-21 04:31:54,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 56 letters. Loop has 35 letters. [2022-02-21 04:31:54,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 89 letters. Loop has 35 letters. [2022-02-21 04:31:54,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 89 letters. Loop has 35 letters. [2022-02-21 04:31:54,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 89 letters. Loop has 35 letters. [2022-02-21 04:31:54,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 88 letters. Loop has 35 letters. [2022-02-21 04:31:54,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 88 letters. Loop has 35 letters. [2022-02-21 04:31:54,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 88 letters. Loop has 35 letters. [2022-02-21 04:31:54,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:31:54,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 87 letters. Loop has 35 letters. [2022-02-21 04:31:54,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:31:54,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 86 letters. Loop has 35 letters. [2022-02-21 04:31:54,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 86 letters. Loop has 35 letters. [2022-02-21 04:31:54,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 86 letters. Loop has 35 letters. [2022-02-21 04:31:54,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:31:54,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 61 letters. Loop has 36 letters. [2022-02-21 04:31:54,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:31:54,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:31:54,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 62 letters. Loop has 37 letters. [2022-02-21 04:31:54,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:31:54,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:31:54,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 62 letters. Loop has 36 letters. [2022-02-21 04:31:54,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:31:54,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:31:54,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 60 letters. Loop has 36 letters. [2022-02-21 04:31:54,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:31:54,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:31:54,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 61 letters. Loop has 38 letters. [2022-02-21 04:31:54,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:31:54,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:31:54,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 60 letters. Loop has 35 letters. [2022-02-21 04:31:54,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:31:54,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 60 letters. Loop has 38 letters. [2022-02-21 04:31:54,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 38 letters. [2022-02-21 04:31:54,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 60 letters. Loop has 38 letters. [2022-02-21 04:31:54,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:31:54,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 61 letters. Loop has 38 letters. [2022-02-21 04:31:54,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:31:54,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:31:54,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 68 letters. Loop has 39 letters. [2022-02-21 04:31:54,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:31:54,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:31:54,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 69 letters. Loop has 39 letters. [2022-02-21 04:31:54,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:31:54,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:31:54,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 69 letters. Loop has 40 letters. [2022-02-21 04:31:54,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:31:54,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:31:54,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 70 letters. Loop has 37 letters. [2022-02-21 04:31:54,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:31:54,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:31:54,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 36 letters. [2022-02-21 04:31:54,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:31:54,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:31:54,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 32 letters. [2022-02-21 04:31:54,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:31:54,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:31:54,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 32 letters. [2022-02-21 04:31:54,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:31:54,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:31:54,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 70 letters. Loop has 38 letters. [2022-02-21 04:31:54,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:31:54,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:31:54,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 68 letters. Loop has 35 letters. [2022-02-21 04:31:54,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:31:54,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:31:54,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 65 letters. Loop has 36 letters. [2022-02-21 04:31:54,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:31:54,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:31:54,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 66 letters. Loop has 38 letters. [2022-02-21 04:31:54,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:31:54,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:54,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 62 letters. Loop has 32 letters. [2022-02-21 04:31:54,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:54,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:31:54,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 87 letters. Loop has 32 letters. [2022-02-21 04:31:54,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:31:54,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:31:54,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 88 letters. Loop has 32 letters. [2022-02-21 04:31:54,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:31:54,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:31:54,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 66 letters. Loop has 38 letters. [2022-02-21 04:31:54,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:31:54,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:31:54,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 64 letters. Loop has 35 letters. [2022-02-21 04:31:54,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:31:54,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:31:54,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 72 letters. Loop has 36 letters. [2022-02-21 04:31:54,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:31:54,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:31:54,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 73 letters. Loop has 36 letters. [2022-02-21 04:31:54,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:31:54,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:31:54,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 63 letters. Loop has 36 letters. [2022-02-21 04:31:54,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:31:54,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:31:54,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 64 letters. Loop has 36 letters. [2022-02-21 04:31:54,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:31:54,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:31:54,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 64 letters. Loop has 37 letters. [2022-02-21 04:31:54,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:31:54,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:31:54,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 70 letters. Loop has 40 letters. [2022-02-21 04:31:54,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:31:54,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:31:54,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,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 70 letters. Loop has 39 letters. [2022-02-21 04:31:54,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:31:54,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 403 states and 695 transitions. cyclomatic complexity: 293 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:54,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,379 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:31:54,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 621 states and 1052 transitions. cyclomatic complexity: 432 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:54,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,379 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:31:54,380 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:31:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2022-02-21 04:31:54,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 540 transitions. Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:31:54,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 540 transitions. Stem has 90 letters. Loop has 35 letters. [2022-02-21 04:31:54,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 540 transitions. Stem has 55 letters. Loop has 70 letters. [2022-02-21 04:31:54,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:54,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 621 states and 1052 transitions. cyclomatic complexity: 432 [2022-02-21 04:31:54,404 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:54,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 621 states to 0 states and 0 transitions. [2022-02-21 04:31:54,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:31:54,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:31:54,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:31:54,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:54,405 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:54,405 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:54,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:54,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:31:54,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:31:54,406 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:31:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:54,407 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:31:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:31:54,407 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:31:54,443 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:31:54,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:31:54,444 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:54,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:31:54,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:31:54,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:31:54,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:31:54,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:54,444 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:54,444 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:54,444 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:54,444 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:31:54,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:31:54,445 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:54,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:31:54,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:31:54 BoogieIcfgContainer [2022-02-21 04:31:54,451 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:31:54,451 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:31:54,452 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:31:54,452 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:31:54,452 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:45" (3/4) ... [2022-02-21 04:31:54,454 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:31:54,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:31:54,457 INFO L158 Benchmark]: Toolchain (without parser) took 10494.63ms. Allocated memory was 79.7MB in the beginning and 197.1MB in the end (delta: 117.4MB). Free memory was 42.2MB in the beginning and 85.5MB in the end (delta: -43.3MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2022-02-21 04:31:54,460 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 79.7MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:31:54,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.70ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 41.9MB in the beginning and 56.1MB in the end (delta: -14.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:31:54,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.87ms. Allocated memory is still 96.5MB. Free memory was 56.1MB in the beginning and 49.5MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:31:54,461 INFO L158 Benchmark]: Boogie Preprocessor took 68.82ms. Allocated memory is still 96.5MB. Free memory was 49.5MB in the beginning and 45.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:31:54,461 INFO L158 Benchmark]: RCFGBuilder took 1065.48ms. Allocated memory is still 96.5MB. Free memory was 45.1MB in the beginning and 57.1MB in the end (delta: -11.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2022-02-21 04:31:54,461 INFO L158 Benchmark]: BuchiAutomizer took 8828.59ms. Allocated memory was 96.5MB in the beginning and 197.1MB in the end (delta: 100.7MB). Free memory was 57.1MB in the beginning and 85.5MB in the end (delta: -28.4MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2022-02-21 04:31:54,461 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 197.1MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:31:54,462 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.20ms. Allocated memory is still 79.7MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.70ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 41.9MB in the beginning and 56.1MB in the end (delta: -14.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.87ms. Allocated memory is still 96.5MB. Free memory was 56.1MB in the beginning and 49.5MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.82ms. Allocated memory is still 96.5MB. Free memory was 49.5MB in the beginning and 45.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1065.48ms. Allocated memory is still 96.5MB. Free memory was 45.1MB in the beginning and 57.1MB in the end (delta: -11.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 8828.59ms. Allocated memory was 96.5MB in the beginning and 197.1MB in the end (delta: 100.7MB). Free memory was 57.1MB in the beginning and 85.5MB in the end (delta: -28.4MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 197.1MB. Free memory is still 85.5MB. 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.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.0s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 403 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 848 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 848 mSDsluCounter, 3989 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2361 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1628 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital205 mio100 ax100 hnf100 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:31:54,487 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