./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.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 6c7bda6ec8155a470f5f9e07367696d7e5cc6867667668ebd692704e4077816f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:27:19,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:27:19,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:27:19,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:27:19,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:27:19,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:27:19,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:27:19,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:27:19,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:27:19,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:27:19,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:27:19,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:27:19,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:27:19,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:27:19,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:27:19,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:27:19,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:27:19,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:27:19,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:27:19,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:27:19,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:27:19,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:27:19,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:27:19,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:27:19,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:27:19,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:27:19,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:27:19,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:27:19,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:27:19,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:27:19,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:27:19,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:27:19,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:27:19,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:27:19,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:27:19,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:27:19,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:27:19,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:27:19,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:27:19,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:27:19,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:27:19,834 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:27:19,862 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:27:19,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:27:19,863 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:27:19,863 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:27:19,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:27:19,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:27:19,865 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:27:19,865 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:27:19,865 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:27:19,865 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:27:19,866 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:27:19,866 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:27:19,866 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:27:19,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:27:19,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:27:19,866 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:27:19,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:27:19,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:27:19,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:27:19,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:27:19,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:27:19,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:27:19,868 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:27:19,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:27:19,868 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:27:19,868 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:27:19,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:27:19,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:27:19,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:27:19,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:27:19,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:27:19,870 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:27:19,870 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 -> 6c7bda6ec8155a470f5f9e07367696d7e5cc6867667668ebd692704e4077816f [2022-02-21 04:27:20,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:27:20,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:27:20,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:27:20,082 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:27:20,083 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:27:20,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c [2022-02-21 04:27:20,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de39788b3/890f53aca43d4618824d22eee4d8cf1a/FLAGb9b370a5a [2022-02-21 04:27:20,531 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:27:20,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c [2022-02-21 04:27:20,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de39788b3/890f53aca43d4618824d22eee4d8cf1a/FLAGb9b370a5a [2022-02-21 04:27:20,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de39788b3/890f53aca43d4618824d22eee4d8cf1a [2022-02-21 04:27:20,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:27:20,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:27:20,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:27:20,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:27:20,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:27:20,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:27:20" (1/1) ... [2022-02-21 04:27:20,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58562ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:20, skipping insertion in model container [2022-02-21 04:27:20,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:27:20" (1/1) ... [2022-02-21 04:27:20,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:27:20,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:27:21,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c[28192,28205] [2022-02-21 04:27:21,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:27:21,289 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:27:21,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c[28192,28205] [2022-02-21 04:27:21,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:27:21,400 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:27:21,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:21 WrapperNode [2022-02-21 04:27:21,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:27:21,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:27:21,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:27:21,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:27:21,408 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:27:21" (1/1) ... [2022-02-21 04:27:21,425 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:27:21" (1/1) ... [2022-02-21 04:27:21,468 INFO L137 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 925 [2022-02-21 04:27:21,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:27:21,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:27:21,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:27:21,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:27:21,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:21" (1/1) ... [2022-02-21 04:27:21,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:21" (1/1) ... [2022-02-21 04:27:21,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:21" (1/1) ... [2022-02-21 04:27:21,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:21" (1/1) ... [2022-02-21 04:27:21,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:21" (1/1) ... [2022-02-21 04:27:21,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:21" (1/1) ... [2022-02-21 04:27:21,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:21" (1/1) ... [2022-02-21 04:27:21,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:27:21,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:27:21,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:27:21,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:27:21,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:21" (1/1) ... [2022-02-21 04:27:21,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:21,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:21,571 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:27:21,577 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:27:21,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:27:21,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:27:21,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:27:21,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:27:21,698 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:27:21,700 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:27:22,402 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:27:22,414 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:27:22,414 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:27:22,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:27:22 BoogieIcfgContainer [2022-02-21 04:27:22,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:27:22,418 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:27:22,418 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:27:22,421 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:27:22,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:27:22,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:27:20" (1/3) ... [2022-02-21 04:27:22,422 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a2ee20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:27:22, skipping insertion in model container [2022-02-21 04:27:22,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:27:22,423 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:21" (2/3) ... [2022-02-21 04:27:22,423 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a2ee20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:27:22, skipping insertion in model container [2022-02-21 04:27:22,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:27:22,423 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:27:22" (3/3) ... [2022-02-21 04:27:22,424 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.c [2022-02-21 04:27:22,462 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:27:22,463 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:27:22,463 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:27:22,463 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:27:22,463 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:27:22,463 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:27:22,463 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:27:22,463 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:27:22,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 303 states, 302 states have (on average 1.804635761589404) internal successors, (545), 302 states have internal predecessors, (545), 0 states have call successors, (0), 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:27:22,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2022-02-21 04:27:22,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:22,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:22,573 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:27:22,573 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:27:22,573 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:27:22,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 303 states, 302 states have (on average 1.804635761589404) internal successors, (545), 302 states have internal predecessors, (545), 0 states have call successors, (0), 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:27:22,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2022-02-21 04:27:22,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:22,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:22,608 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:27:22,608 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:27:22,618 INFO L791 eck$LassoCheckResult]: Stem: 293#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(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; 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~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 176#L393true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 132#L404true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 296#L414true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 277#L425true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 261#L435true assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 275#L446true init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 121#L456true assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 150#L467true init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 193#L477true assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 67#L488true init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 85#L498true assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 47#L509true init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 246#L519true assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 44#L530true init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 187#L540true assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 194#L551true init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 69#L561true assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 117#L572true init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 300#L582true assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 74#L593true init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 292#L603true assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 203#L614true init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 206#L624true assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 24#L635true init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 158#L645true assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 103#L656true init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 170#L666true assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 8#L677true init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 55#L687true assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 262#L698true init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 12#L708true assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 233#L719true init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 201#L729true assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 210#L740true init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 273#L750true assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 98#L761true init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 265#L771true assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 140#L782true init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 169#L792true assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 22#L803true init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 45#L813true assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 267#L824true init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 131#L834true assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 134#L845true init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 14#L855true assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 167#L866true init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 97#L876true assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 143#L887true init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 164#L897true assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 122#L897-1true init_#res#1 := init_~tmp___23~0#1; 305#L1066true main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 108#L21true assume !(0 == assume_abort_if_not_~cond#1); 173#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; 101#L1203-2true [2022-02-21 04:27:22,624 INFO L793 eck$LassoCheckResult]: Loop: 101#L1203-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; 124#L109true assume !(0 != ~mode1~0 % 256); 46#L141true assume !(~r1~0 < 3); 285#L141-1true ~mode1~0 := 1; 146#L109-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; 197#L162true assume !(0 != ~mode2~0 % 256); 263#L194true assume !(~r2~0 < 3); 6#L194-1true ~mode2~0 := 1; 58#L162-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; 155#L215true assume !(0 != ~mode3~0 % 256); 119#L247true assume !(~r3~0 < 3); 286#L247-1true ~mode3~0 := 1; 294#L215-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; 182#L268true assume !(0 != ~mode4~0 % 256); 231#L300true assume !(~r4~0 < 3); 48#L300-1true ~mode4~0 := 1; 270#L268-2true assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 200#L1074true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 195#L1074-1true check_#res#1 := check_~tmp~1#1; 253#L1126true main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 43#L1246true assume !(0 == assert_~arg#1 % 256); 36#L1241true assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; 101#L1203-2true [2022-02-21 04:27:22,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:22,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 1 times [2022-02-21 04:27:22,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:22,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016052417] [2022-02-21 04:27:22,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:22,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:22,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#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(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; {307#true} is VALID [2022-02-21 04:27:22,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {307#true} is VALID [2022-02-21 04:27:22,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {307#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {307#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {307#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {307#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {307#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {307#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {307#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {307#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {307#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {307#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {307#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {307#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {307#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {307#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {307#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {307#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {307#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {307#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {307#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {307#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {307#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {307#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {307#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {307#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {307#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {307#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {307#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {307#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {307#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {307#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {307#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {307#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {307#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {307#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {307#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {307#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {307#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {307#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {307#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {307#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {307#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {307#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,951 INFO L290 TraceCheckUtils]: 48: Hoare triple {307#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:22,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {307#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:22,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {307#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {309#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:27:22,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {309#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {310#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:27:22,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {310#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {311#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:27:22,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {311#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {308#false} is VALID [2022-02-21 04:27:22,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {308#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; {308#false} is VALID [2022-02-21 04:27:22,959 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:27:22,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:22,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016052417] [2022-02-21 04:27:22,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016052417] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:22,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:22,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:22,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029575486] [2022-02-21 04:27:22,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:22,969 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:27:22,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1319514639, now seen corresponding path program 1 times [2022-02-21 04:27:22,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:22,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648958155] [2022-02-21 04:27:22,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:22,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:23,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#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; {312#true} is VALID [2022-02-21 04:27:23,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume !(0 != ~mode1~0 % 256); {312#true} is VALID [2022-02-21 04:27:23,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume !(~r1~0 < 3); {312#true} is VALID [2022-02-21 04:27:23,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~mode1~0 := 1; {312#true} is VALID [2022-02-21 04:27:23,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {312#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; {312#true} is VALID [2022-02-21 04:27:23,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {312#true} assume !(0 != ~mode2~0 % 256); {312#true} is VALID [2022-02-21 04:27:23,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} assume !(~r2~0 < 3); {312#true} is VALID [2022-02-21 04:27:23,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {312#true} ~mode2~0 := 1; {312#true} is VALID [2022-02-21 04:27:23,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {312#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; {312#true} is VALID [2022-02-21 04:27:23,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} assume !(0 != ~mode3~0 % 256); {312#true} is VALID [2022-02-21 04:27:23,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {312#true} assume !(~r3~0 < 3); {312#true} is VALID [2022-02-21 04:27:23,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {312#true} ~mode3~0 := 1; {312#true} is VALID [2022-02-21 04:27:23,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; {312#true} is VALID [2022-02-21 04:27:23,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {312#true} assume !(0 != ~mode4~0 % 256); {312#true} is VALID [2022-02-21 04:27:23,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {312#true} assume !(~r4~0 < 3); {312#true} is VALID [2022-02-21 04:27:23,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#true} ~mode4~0 := 1; {312#true} is VALID [2022-02-21 04:27:23,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {312#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; {312#true} is VALID [2022-02-21 04:27:23,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {312#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {314#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:27:23,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {314#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {315#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:27:23,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {315#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {316#(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:27:23,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {316#(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); {313#false} is VALID [2022-02-21 04:27:23,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; {313#false} is VALID [2022-02-21 04:27:23,085 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:27:23,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:23,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648958155] [2022-02-21 04:27:23,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648958155] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:23,086 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:23,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:23,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654113649] [2022-02-21 04:27:23,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:23,087 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:27:23,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:27:23,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:27:23,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:27:23,110 INFO L87 Difference]: Start difference. First operand has 303 states, 302 states have (on average 1.804635761589404) internal successors, (545), 302 states have internal predecessors, (545), 0 states have call successors, (0), 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:27:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:24,056 INFO L93 Difference]: Finished difference Result 307 states and 545 transitions. [2022-02-21 04:27:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:27:24,057 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:27:24,075 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:27:24,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 545 transitions. [2022-02-21 04:27:24,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2022-02-21 04:27:24,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 298 states and 528 transitions. [2022-02-21 04:27:24,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 298 [2022-02-21 04:27:24,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 298 [2022-02-21 04:27:24,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 528 transitions. [2022-02-21 04:27:24,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:24,098 INFO L681 BuchiCegarLoop]: Abstraction has 298 states and 528 transitions. [2022-02-21 04:27:24,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 528 transitions. [2022-02-21 04:27:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-02-21 04:27:24,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:27:24,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states and 528 transitions. Second operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 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:27:24,144 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states and 528 transitions. Second operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 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:27:24,145 INFO L87 Difference]: Start difference. First operand 298 states and 528 transitions. Second operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 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:27:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:24,154 INFO L93 Difference]: Finished difference Result 298 states and 528 transitions. [2022-02-21 04:27:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 528 transitions. [2022-02-21 04:27:24,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:24,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:24,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 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 298 states and 528 transitions. [2022-02-21 04:27:24,159 INFO L87 Difference]: Start difference. First operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 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 298 states and 528 transitions. [2022-02-21 04:27:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:24,166 INFO L93 Difference]: Finished difference Result 298 states and 528 transitions. [2022-02-21 04:27:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 528 transitions. [2022-02-21 04:27:24,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:24,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:24,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:27:24,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:27:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 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:27:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 528 transitions. [2022-02-21 04:27:24,178 INFO L704 BuchiCegarLoop]: Abstraction has 298 states and 528 transitions. [2022-02-21 04:27:24,178 INFO L587 BuchiCegarLoop]: Abstraction has 298 states and 528 transitions. [2022-02-21 04:27:24,178 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:27:24,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 298 states and 528 transitions. [2022-02-21 04:27:24,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2022-02-21 04:27:24,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:24,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:24,182 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:27:24,182 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:27:24,182 INFO L791 eck$LassoCheckResult]: Stem: 925#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(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; 895#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 878#L393 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 779#L404 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 848#L414 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 667#L425 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 922#L435 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 713#L446 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 833#L456 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 746#L467 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 862#L477 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 756#L488 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 757#L498 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 695#L509 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 728#L519 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 718#L530 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 720#L540 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 832#L551 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 760#L561 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 737#L572 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 828#L582 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 671#L593 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 769#L603 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 701#L614 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 894#L624 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 680#L635 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 681#L645 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 704#L656 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 812#L666 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 641#L677 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 642#L687 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 709#L698 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 651#L708 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 652#L719 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 892#L729 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 630#L740 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 898#L750 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 805#L761 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 806#L771 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 771#L782 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 854#L792 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 647#L803 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 679#L813 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 721#L824 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 847#L834 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 698#L845 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 656#L855 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 657#L866 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 804#L876 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 675#L887 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 856#L897 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 634#L897-1 init_#res#1 := init_~tmp___23~0#1; 834#L1066 main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 817#L21 assume !(0 == assume_abort_if_not_~cond#1); 818#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; 707#L1203-2 [2022-02-21 04:27:24,183 INFO L793 eck$LassoCheckResult]: Loop: 707#L1203-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; 809#L109 assume !(0 != ~mode1~0 % 256); 723#L141 assume !(~r1~0 < 3); 724#L141-1 ~mode1~0 := 1; 858#L109-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; 859#L162 assume !(0 != ~mode2~0 % 256); 889#L194 assume !(~r2~0 < 3); 636#L194-1 ~mode2~0 := 1; 637#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; 745#L215 assume !(0 != ~mode3~0 % 256); 829#L247 assume !(~r3~0 < 3); 692#L247-1 ~mode3~0 := 1; 886#L215-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; 880#L268 assume !(0 != ~mode4~0 % 256); 881#L300 assume !(~r4~0 < 3); 726#L300-1 ~mode4~0 := 1; 727#L268-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 891#L1074 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 837#L1075 assume ~st1~0 + ~nl1~0 <= 1; 838#L1076 assume ~st2~0 + ~nl2~0 <= 1; 861#L1077 assume ~st3~0 + ~nl3~0 <= 1; 735#L1078 assume ~st4~0 + ~nl4~0 <= 1; 648#L1079 assume ~r1~0 >= 3; 650#L1083 assume ~r1~0 < 3; 867#L1088 assume ~r1~0 >= 3; 884#L1093 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 872#L1074-1 check_#res#1 := check_~tmp~1#1; 887#L1126 main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 719#L1246 assume !(0 == assert_~arg#1 % 256); 706#L1241 assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; 707#L1203-2 [2022-02-21 04:27:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 2 times [2022-02-21 04:27:24,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:24,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933107689] [2022-02-21 04:27:24,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:24,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {1525#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(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; {1525#true} is VALID [2022-02-21 04:27:24,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {1525#true} is VALID [2022-02-21 04:27:24,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {1525#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {1525#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {1525#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {1525#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {1525#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {1525#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {1525#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {1525#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {1525#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {1525#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {1525#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {1525#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {1525#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {1525#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {1525#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {1525#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {1525#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {1525#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {1525#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {1525#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {1525#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {1525#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {1525#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {1525#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {1525#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {1525#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {1525#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {1525#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {1525#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {1525#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {1525#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {1525#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {1525#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {1525#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {1525#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {1525#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {1525#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {1525#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {1525#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {1525#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {1525#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {1525#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {1525#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {1525#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {1525#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:24,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {1525#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:24,287 INFO L290 TraceCheckUtils]: 50: Hoare triple {1525#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {1527#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:27:24,287 INFO L290 TraceCheckUtils]: 51: Hoare triple {1527#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {1528#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:27:24,288 INFO L290 TraceCheckUtils]: 52: Hoare triple {1528#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1529#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:27:24,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {1529#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {1526#false} is VALID [2022-02-21 04:27:24,288 INFO L290 TraceCheckUtils]: 54: Hoare triple {1526#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; {1526#false} is VALID [2022-02-21 04:27:24,289 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:27:24,289 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:24,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933107689] [2022-02-21 04:27:24,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933107689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:24,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:24,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:24,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820048649] [2022-02-21 04:27:24,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:24,290 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:27:24,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:24,291 INFO L85 PathProgramCache]: Analyzing trace with hash 94444480, now seen corresponding path program 1 times [2022-02-21 04:27:24,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:24,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981645960] [2022-02-21 04:27:24,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:24,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:24,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {1530#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; {1530#true} is VALID [2022-02-21 04:27:24,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#true} assume !(0 != ~mode1~0 % 256); {1530#true} is VALID [2022-02-21 04:27:24,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {1530#true} assume !(~r1~0 < 3); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {1532#(not (<= ~r1~0 2))} ~mode1~0 := 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {1532#(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; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {1532#(not (<= ~r1~0 2))} assume !(0 != ~mode2~0 % 256); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {1532#(not (<= ~r1~0 2))} assume !(~r2~0 < 3); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {1532#(not (<= ~r1~0 2))} ~mode2~0 := 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {1532#(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; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {1532#(not (<= ~r1~0 2))} assume !(0 != ~mode3~0 % 256); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {1532#(not (<= ~r1~0 2))} assume !(~r3~0 < 3); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {1532#(not (<= ~r1~0 2))} ~mode3~0 := 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {1532#(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; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {1532#(not (<= ~r1~0 2))} assume !(0 != ~mode4~0 % 256); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {1532#(not (<= ~r1~0 2))} assume !(~r4~0 < 3); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {1532#(not (<= ~r1~0 2))} ~mode4~0 := 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {1532#(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; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~st1~0 + ~nl1~0 <= 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~st2~0 + ~nl2~0 <= 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~st3~0 + ~nl3~0 <= 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~st4~0 + ~nl4~0 <= 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~r1~0 >= 3; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:24,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~r1~0 < 3; {1531#false} is VALID [2022-02-21 04:27:24,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {1531#false} assume ~r1~0 >= 3; {1531#false} is VALID [2022-02-21 04:27:24,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {1531#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {1531#false} is VALID [2022-02-21 04:27:24,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {1531#false} check_#res#1 := check_~tmp~1#1; {1531#false} is VALID [2022-02-21 04:27:24,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {1531#false} main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1531#false} is VALID [2022-02-21 04:27:24,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {1531#false} assume !(0 == assert_~arg#1 % 256); {1531#false} is VALID [2022-02-21 04:27:24,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {1531#false} assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; {1531#false} is VALID [2022-02-21 04:27:24,323 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:27:24,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:24,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981645960] [2022-02-21 04:27:24,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981645960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:24,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:24,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:27:24,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183737194] [2022-02-21 04:27:24,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:24,324 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:27:24,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:27:24,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:27:24,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:27:24,325 INFO L87 Difference]: Start difference. First operand 298 states and 528 transitions. cyclomatic complexity: 231 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:27:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:24,711 INFO L93 Difference]: Finished difference Result 383 states and 662 transitions. [2022-02-21 04:27:24,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:27:24,711 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:27:24,736 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:27:24,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 383 states and 662 transitions. [2022-02-21 04:27:24,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 191 [2022-02-21 04:27:24,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 383 states to 383 states and 662 transitions. [2022-02-21 04:27:24,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 383 [2022-02-21 04:27:24,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 383 [2022-02-21 04:27:24,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 383 states and 662 transitions. [2022-02-21 04:27:24,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:24,756 INFO L681 BuchiCegarLoop]: Abstraction has 383 states and 662 transitions. [2022-02-21 04:27:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states and 662 transitions. [2022-02-21 04:27:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2022-02-21 04:27:24,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:27:24,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states and 662 transitions. Second operand has 383 states, 383 states have (on average 1.7284595300261096) internal successors, (662), 382 states have internal predecessors, (662), 0 states have call successors, (0), 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:27:24,762 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states and 662 transitions. Second operand has 383 states, 383 states have (on average 1.7284595300261096) internal successors, (662), 382 states have internal predecessors, (662), 0 states have call successors, (0), 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:27:24,763 INFO L87 Difference]: Start difference. First operand 383 states and 662 transitions. Second operand has 383 states, 383 states have (on average 1.7284595300261096) internal successors, (662), 382 states have internal predecessors, (662), 0 states have call successors, (0), 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:27:24,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:24,771 INFO L93 Difference]: Finished difference Result 383 states and 662 transitions. [2022-02-21 04:27:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 662 transitions. [2022-02-21 04:27:24,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:24,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:24,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 383 states, 383 states have (on average 1.7284595300261096) internal successors, (662), 382 states have internal predecessors, (662), 0 states have call successors, (0), 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 383 states and 662 transitions. [2022-02-21 04:27:24,773 INFO L87 Difference]: Start difference. First operand has 383 states, 383 states have (on average 1.7284595300261096) internal successors, (662), 382 states have internal predecessors, (662), 0 states have call successors, (0), 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 383 states and 662 transitions. [2022-02-21 04:27:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:24,781 INFO L93 Difference]: Finished difference Result 383 states and 662 transitions. [2022-02-21 04:27:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 662 transitions. [2022-02-21 04:27:24,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:24,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:24,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:27:24,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:27:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 383 states have (on average 1.7284595300261096) internal successors, (662), 382 states have internal predecessors, (662), 0 states have call successors, (0), 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:27:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 662 transitions. [2022-02-21 04:27:24,790 INFO L704 BuchiCegarLoop]: Abstraction has 383 states and 662 transitions. [2022-02-21 04:27:24,790 INFO L587 BuchiCegarLoop]: Abstraction has 383 states and 662 transitions. [2022-02-21 04:27:24,790 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:27:24,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 383 states and 662 transitions. [2022-02-21 04:27:24,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 191 [2022-02-21 04:27:24,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:24,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:24,793 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:27:24,793 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:27:24,793 INFO L791 eck$LassoCheckResult]: Stem: 2218#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(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; 2186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 2169#L393 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 2068#L404 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 2138#L414 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1952#L425 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 2214#L435 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 2000#L446 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 2123#L456 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 2032#L467 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 2152#L477 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 2042#L488 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 2043#L498 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 1982#L509 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 2012#L519 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 2005#L530 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 2007#L540 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 2122#L551 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 2047#L561 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 2023#L572 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 2118#L582 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 1958#L593 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 2056#L603 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 1988#L614 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 2185#L624 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 1967#L635 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 1968#L645 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 1991#L656 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 2099#L666 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 1929#L677 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 1930#L687 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 1996#L698 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 1938#L708 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 1939#L719 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 2183#L729 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 1918#L740 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 2189#L750 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 2094#L761 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 2095#L771 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 2058#L782 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 2144#L792 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 1932#L803 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 1963#L813 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 2008#L824 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 2137#L834 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 1985#L845 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 1943#L855 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 1944#L866 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 2093#L876 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 1962#L887 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 2146#L897 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 1922#L897-1 init_#res#1 := init_~tmp___23~0#1; 2124#L1066 main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 2106#L21 assume !(0 == assume_abort_if_not_~cond#1); 2107#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; 2167#L1203-2 [2022-02-21 04:27:24,793 INFO L793 eck$LassoCheckResult]: Loop: 2167#L1203-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; 2293#L109 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); 2128#L111 assume !(0 != ~ep21~0 % 256); 2029#L111-1 assume !(0 != ~ep31~0 % 256); 1974#L118 assume !(0 != ~ep41~0 % 256); 2194#L125 assume !(3 == ~r1~0); 2210#L132 ~mode1~0 := 0; 2275#L109-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; 2273#L162 assume !(0 != ~mode2~0 % 256); 2274#L194 assume !(~r2~0 < 3); 2260#L194-1 ~mode2~0 := 1; 2255#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; 2253#L215 assume !(0 != ~mode3~0 % 256); 2254#L247 assume !(~r3~0 < 3); 2242#L247-1 ~mode3~0 := 1; 2241#L215-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; 2237#L268 assume !(0 != ~mode4~0 % 256); 2233#L300 assume !(~r4~0 < 3); 2226#L300-1 ~mode4~0 := 1; 2225#L268-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 2224#L1074 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 2223#L1075 assume ~st1~0 + ~nl1~0 <= 1; 2222#L1076 assume ~st2~0 + ~nl2~0 <= 1; 2221#L1077 assume ~st3~0 + ~nl3~0 <= 1; 2220#L1078 assume ~st4~0 + ~nl4~0 <= 1; 2219#L1079 assume !(~r1~0 >= 3); 2061#L1082 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 2062#L1083 assume ~r1~0 < 3; 2298#L1088 assume !(~r1~0 >= 3); 2174#L1092 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 2175#L1093 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 2297#L1074-1 check_#res#1 := check_~tmp~1#1; 2296#L1126 main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 2295#L1246 assume !(0 == assert_~arg#1 % 256); 2294#L1241 assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; 2167#L1203-2 [2022-02-21 04:27:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 3 times [2022-02-21 04:27:24,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:24,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869529553] [2022-02-21 04:27:24,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:24,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:24,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {3068#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(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; {3068#true} is VALID [2022-02-21 04:27:24,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {3068#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {3068#true} is VALID [2022-02-21 04:27:24,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {3068#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {3068#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {3068#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {3068#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {3068#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {3068#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {3068#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {3068#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {3068#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {3068#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {3068#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {3068#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {3068#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {3068#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {3068#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {3068#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {3068#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {3068#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {3068#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {3068#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {3068#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {3068#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {3068#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {3068#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {3068#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {3068#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {3068#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {3068#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {3068#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {3068#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {3068#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {3068#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {3068#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {3068#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,845 INFO L290 TraceCheckUtils]: 36: Hoare triple {3068#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,845 INFO L290 TraceCheckUtils]: 37: Hoare triple {3068#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {3068#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,845 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {3068#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {3068#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {3068#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {3068#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {3068#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {3068#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,846 INFO L290 TraceCheckUtils]: 46: Hoare triple {3068#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,846 INFO L290 TraceCheckUtils]: 47: Hoare triple {3068#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {3068#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:24,846 INFO L290 TraceCheckUtils]: 49: Hoare triple {3068#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:24,847 INFO L290 TraceCheckUtils]: 50: Hoare triple {3068#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {3070#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:27:24,847 INFO L290 TraceCheckUtils]: 51: Hoare triple {3070#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {3071#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:27:24,847 INFO L290 TraceCheckUtils]: 52: Hoare triple {3071#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3072#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:27:24,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {3072#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {3069#false} is VALID [2022-02-21 04:27:24,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {3069#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; {3069#false} is VALID [2022-02-21 04:27:24,848 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:27:24,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:24,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869529553] [2022-02-21 04:27:24,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869529553] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:24,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:24,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:24,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074915759] [2022-02-21 04:27:24,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:24,849 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:27:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:24,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1101404608, now seen corresponding path program 1 times [2022-02-21 04:27:24,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:24,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350652316] [2022-02-21 04:27:24,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:24,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:27:24,880 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:27:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:27:24,921 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:27:25,829 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:27:25,830 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:27:25,830 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:27:25,830 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:27:25,830 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:27:25,830 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:25,830 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:27:25,830 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:27:25,831 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:27:25,831 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:27:25,831 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:27:25,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:27:25,852 INFO L141 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:27:25,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:27:25,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:27:25,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:27:25,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:27:25,861 INFO L141 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:27:25,864 INFO L141 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:27:25,867 INFO L141 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:27:25,869 INFO L141 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:27:25,870 INFO L141 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:27:25,872 INFO L141 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:27:25,873 INFO L141 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:27:25,877 INFO L141 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:27:25,879 INFO L141 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:27:25,880 INFO L141 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:27:25,882 INFO L141 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:27:25,884 INFO L141 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:27:25,888 INFO L141 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:27:25,895 INFO L141 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:27:25,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:27:25,907 INFO L141 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:27:25,909 INFO L141 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:27:25,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:27:25,946 INFO L141 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:27:25,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:25,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:27:25,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:27:25,958 INFO L141 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:27:25,960 INFO L141 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:27:26,762 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:27:26,763 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:27:26,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:26,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:26,766 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:27:26,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:27:26,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:26,774 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:27:26,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:27:26,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:26,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:26,813 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:27:26,814 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:27:26,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:27:26,819 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:26,928 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:27:26,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:26,932 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:27:26,932 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:27:26,932 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:27:26,932 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:27:26,932 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:27:26,932 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:26,932 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:27:26,932 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:27:26,932 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:27:26,933 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:27:26,933 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:27:26,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:27:26,944 INFO L141 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:27:26,946 INFO L141 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:27:26,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:26,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:27:26,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:27:26,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:27:26,955 INFO L141 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:27:26,961 INFO L141 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:27:26,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:26,964 INFO L141 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:27:26,999 INFO L141 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:27:27,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:27,005 INFO L141 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:27:27,007 INFO L141 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:27:27,009 INFO L141 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:27:27,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:27,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:27,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:27,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:27:27,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:27:27,033 INFO L141 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:27:27,036 INFO L141 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:27:27,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:27,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:27:27,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:27:27,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:27,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:27:27,051 INFO L141 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:27:27,052 INFO L141 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:27:27,839 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:27:27,842 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:27:27,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:27,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:27,844 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:27:27,845 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:27:27,846 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:27:27,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:27,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:27,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:27,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:27,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:27,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:27,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:27,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:27,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:27,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:27,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:27,876 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:27:27,877 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:27:27,878 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:27:27,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:27,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:27,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:27,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:27,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:27,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:27,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:27,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:27,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:27,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:27,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:27,918 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:27:27,919 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:27:27,921 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:27:27,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:27,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:27,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:27,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:27,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:27,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:27,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:27,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:27,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 04:27:27,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:27,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:27,971 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:27:27,972 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:27:27,973 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:27:27,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:27,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:27,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:27,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:27,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:27,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:27,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:27,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,008 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:27:28,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,010 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:27:28,014 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:27:28,014 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:27:28,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 04:27:28,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,043 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:27:28,044 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:27:28,045 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:27:28,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 04:27:28,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,071 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:27:28,077 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:27:28,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:28,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 04:27:28,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,114 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:27:28,119 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:27:28,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:28,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,160 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:27:28,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,162 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:27:28,162 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:27:28,164 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:27:28,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:28,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,220 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:27:28,223 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:27:28,225 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:27:28,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:28,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,262 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:27:28,264 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:27:28,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:28,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,312 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:27:28,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,314 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:27:28,314 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:27:28,316 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:27:28,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,341 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:27:28,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,343 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:27:28,344 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:27:28,345 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:27:28,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,382 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:27:28,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,384 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:27:28,385 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:27:28,386 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:27:28,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,419 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:27:28,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,421 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:27:28,421 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:27:28,423 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:27:28,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,462 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:27:28,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,464 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:27:28,465 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:27:28,466 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:27:28,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:28,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,506 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:27:28,508 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:27:28,509 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:27:28,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,534 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:27:28,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,535 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:27:28,554 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:27:28,558 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:27:28,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:28,595 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:27:28,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,597 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:27:28,598 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:27:28,599 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:27:28,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:28,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:28,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:28,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:28,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:28,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:28,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:28,621 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:27:28,624 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:27:28,624 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:27:28,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:28,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:28,626 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:27:28,627 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:27:28,628 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:27:28,628 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:27:28,628 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:27:28,628 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:27:28,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:28,659 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:27:28,663 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);" "assume !(0 != ~ep21~0 % 256);" "assume !(0 != ~ep31~0 % 256);" "assume !(0 != ~ep41~0 % 256);" "assume !(3 == ~r1~0);" "~mode1~0 := 0;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 3);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 3);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1;" "assume !(0 != ~mode4~0 % 256);" "assume !(~r4~0 < 3);" "~mode4~0 := 1;" "assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~st4~0 + ~nl4~0 <= 1;" "assume !(~r1~0 >= 3);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0;" "assume ~r1~0 < 3;" "assume !(~r1~0 >= 3);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0;" "assume ~r1~0 < 3;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1;" [2022-02-21 04:27:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:28,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:28,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:27:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:28,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:27:28,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {3075#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(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; {3075#unseeded} is VALID [2022-02-21 04:27:28,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {3075#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {3075#unseeded} is VALID [2022-02-21 04:27:28,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {3075#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {3075#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {3075#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {3075#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {3075#unseeded} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {3075#unseeded} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {3075#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {3075#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {3075#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {3075#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {3075#unseeded} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {3075#unseeded} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {3075#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {3075#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {3075#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {3075#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {3075#unseeded} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {3075#unseeded} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {3075#unseeded} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {3075#unseeded} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {3075#unseeded} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {3075#unseeded} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {3075#unseeded} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {3075#unseeded} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {3075#unseeded} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {3075#unseeded} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {3075#unseeded} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {3075#unseeded} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {3075#unseeded} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {3075#unseeded} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {3075#unseeded} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {3075#unseeded} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {3075#unseeded} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {3075#unseeded} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {3075#unseeded} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {3075#unseeded} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {3075#unseeded} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {3075#unseeded} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,953 INFO L290 TraceCheckUtils]: 40: Hoare triple {3075#unseeded} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,953 INFO L290 TraceCheckUtils]: 41: Hoare triple {3075#unseeded} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {3075#unseeded} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {3075#unseeded} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {3075#unseeded} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {3075#unseeded} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,955 INFO L290 TraceCheckUtils]: 46: Hoare triple {3075#unseeded} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {3075#unseeded} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {3075#unseeded} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:28,955 INFO L290 TraceCheckUtils]: 49: Hoare triple {3075#unseeded} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:28,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {3075#unseeded} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {3075#unseeded} is VALID [2022-02-21 04:27:28,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {3075#unseeded} init_#res#1 := init_~tmp___23~0#1; {3075#unseeded} is VALID [2022-02-21 04:27:28,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {3075#unseeded} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3075#unseeded} is VALID [2022-02-21 04:27:28,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {3075#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {3075#unseeded} is VALID [2022-02-21 04:27:28,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {3075#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; {3075#unseeded} is VALID [2022-02-21 04:27:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:28,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:27:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:28,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:27:29,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {3078#(>= 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; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep21~0 % 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,268 INFO L290 TraceCheckUtils]: 3: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep31~0 % 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep41~0 % 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(3 == ~r1~0); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode1~0 := 0; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {3255#(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; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode2~0 % 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r2~0 < 3); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode2~0 := 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {3255#(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; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode3~0 % 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r3~0 < 3); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode3~0 := 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {3255#(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; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode4~0 % 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r4~0 < 3); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode4~0 := 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {3255#(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; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {3255#(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; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~nl1~0 <= 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st2~0 + ~nl2~0 <= 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st3~0 + ~nl3~0 <= 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st4~0 + ~nl4~0 <= 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {3255#(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; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {3255#(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; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {3255#(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; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} check_#res#1 := check_~tmp~1#1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 == assert_~arg#1 % 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:29,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; {3088#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:27:29,281 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:27:29,282 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:27:29,304 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:27:29,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 55 letters. Loop has 35 letters. [2022-02-21 04:27:29,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,308 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:27:29,309 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 383 states and 662 transitions. cyclomatic complexity: 280 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:27:29,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:29,822 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 383 states and 662 transitions. cyclomatic complexity: 280. 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 573 states and 970 transitions. Complement of second has 4 states. [2022-02-21 04:27:29,822 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:27:29,822 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:27:29,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 383 states and 662 transitions. cyclomatic complexity: 280 [2022-02-21 04:27:29,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:29,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:29,823 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:27:29,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:27:29,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:29,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:29,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 970 transitions. [2022-02-21 04:27:29,837 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:29,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:27:29,839 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 383 states and 662 transitions. cyclomatic complexity: 280 [2022-02-21 04:27:29,909 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 191 examples of accepted words. [2022-02-21 04:27:29,909 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:27:29,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:27:29,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:27:29,913 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 573 states and 970 transitions. cyclomatic complexity: 398 [2022-02-21 04:27:29,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 970 transitions. cyclomatic complexity: 398 [2022-02-21 04:27:29,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:27:29,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:27:29,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:27:29,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:27:29,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:29,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:29,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 573 letters. Loop has 573 letters. [2022-02-21 04:27:29,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 573 letters. Loop has 573 letters. [2022-02-21 04:27:29,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 573 letters. Loop has 573 letters. [2022-02-21 04:27:29,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 383 letters. Loop has 383 letters. [2022-02-21 04:27:29,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 383 letters. Loop has 383 letters. [2022-02-21 04:27:29,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 383 letters. Loop has 383 letters. [2022-02-21 04:27:29,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:27:29,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:27:29,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:27:29,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:27:29,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:29,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:29,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:27:29,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:27:29,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:27:29,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:27:29,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:27:29,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:27:29,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 81 letters. Loop has 35 letters. [2022-02-21 04:27:29,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 81 letters. Loop has 35 letters. [2022-02-21 04:27:29,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 82 letters. Loop has 35 letters. [2022-02-21 04:27:29,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 82 letters. Loop has 35 letters. [2022-02-21 04:27:29,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:29,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:29,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:27:29,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:27:29,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:27:29,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:27:29,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:27:29,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:27:29,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:27:29,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:27:29,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:27:29,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:27:29,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:27:29,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:27:29,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:27:29,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:29,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:29,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:27:29,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:27:29,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:27:29,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:27:29,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:27:29,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:27:29,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:27:29,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:27:29,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:27:29,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:27:29,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:27:29,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:27:29,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:27:29,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:29,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:29,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:27:29,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:27:29,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:27:29,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:27:29,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:29,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:29,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:29,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:27:29,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:27:29,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:27:29,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:27:29,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:27:29,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:27:29,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:27:29,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:27:29,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:27:29,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:27:29,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:29,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:29,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:27:29,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:27:29,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:27:29,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:27:29,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:27:29,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:27:29,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:29,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:29,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:27:29,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:27:29,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:27:29,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:27:29,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:27:29,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:27:29,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:27:29,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:27:29,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:27:29,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:27:29,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:27:29,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:27:29,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:27:29,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:27:29,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:27:29,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:27:29,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:27:29,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:27:29,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:27:29,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:27:29,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:27:29,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:27:29,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 84 letters. Loop has 35 letters. [2022-02-21 04:27:29,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 84 letters. Loop has 35 letters. [2022-02-21 04:27:29,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 85 letters. Loop has 35 letters. [2022-02-21 04:27:29,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 85 letters. Loop has 35 letters. [2022-02-21 04:27:29,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:27:29,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:27:29,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:29,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:29,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:27:29,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:27:29,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:27:29,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:27:29,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:27:29,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:27:29,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:27:29,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:27:29,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:29,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:29,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:27:29,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:27:29,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:27:29,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:27:29,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:29,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:29,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:27:29,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:27:29,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:27:29,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:29,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:29,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:27:29,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:27:29,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:29,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:29,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:29,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:27:29,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:27:29,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:27:29,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:27:29,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:27:29,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:27:29,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:27:29,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:27:29,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:27:29,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:27:29,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:27:29,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:27:29,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:29,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:29,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:29,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:27:29,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:27:29,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:29,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:29,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:29,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:29,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:27:30,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:27:30,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:27:30,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:27:30,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:27:30,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:27:30,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:30,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:30,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:30,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:27:30,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:27:30,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:27:30,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:27:30,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 80 letters. Loop has 35 letters. [2022-02-21 04:27:30,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 80 letters. Loop has 35 letters. [2022-02-21 04:27:30,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:30,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:30,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 79 letters. Loop has 35 letters. [2022-02-21 04:27:30,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 79 letters. Loop has 35 letters. [2022-02-21 04:27:30,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:27:30,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:27:30,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 78 letters. Loop has 35 letters. [2022-02-21 04:27:30,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 78 letters. Loop has 35 letters. [2022-02-21 04:27:30,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:30,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:30,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:27:30,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:27:30,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:27:30,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:27:30,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:27:30,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:27:30,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:30,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:30,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:27:30,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:27:30,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:30,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:30,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:30,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:30,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:27:30,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:27:30,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:27:30,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:30,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:30,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:27:30,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:27:30,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:30,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:30,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:27:30,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:27:30,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:27:30,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:27:30,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:27:30,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:27:30,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:27:30,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:27:30,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:27:30,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:27:30,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:27:30,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:27:30,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:27:30,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:27:30,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:27:30,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:27:30,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:27:30,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:30,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:30,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:30,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:30,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:30,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:30,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:27:30,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:27:30,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:27:30,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:27:30,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:27:30,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:27:30,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:27:30,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:27:30,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:30,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:30,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:27:30,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:27:30,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:27:30,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:27:30,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:27:30,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:27:30,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:30,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:30,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:30,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:30,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:27:30,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:27:30,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:27:30,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:27:30,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:27:30,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:27:30,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:27:30,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:27:30,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:27:30,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:27:30,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:27:30,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:27:30,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:27:30,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:27:30,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:27:30,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:27:30,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:27:30,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:27:30,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:27:30,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:27:30,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:27:30,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:27:30,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:27:30,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:27:30,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:30,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:30,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:30,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:30,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:30,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:30,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:27:30,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:27:30,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:27:30,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:27:30,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:27:30,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:27:30,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:27:30,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:27:30,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:27:30,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:30,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:30,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:27:30,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:27:30,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:27:30,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:27:30,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:27:30,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:27:30,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:27:30,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:27:30,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:27:30,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:27:30,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:27:30,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:27:30,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:27:30,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:27:30,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:27:30,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:27:30,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:27:30,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:27:30,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:27:30,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:27:30,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:27:30,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:27:30,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:27:30,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:27:30,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:27:30,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:27:30,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:27:30,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:27:30,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:27:30,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:27:30,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:27:30,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:27:30,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:27:30,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:27:30,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:27:30,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:27:30,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:27:30,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:27:30,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 64 letters. Loop has 35 letters. [2022-02-21 04:27:30,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:27:30,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:27:30,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 62 letters. Loop has 35 letters. [2022-02-21 04:27:30,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:27:30,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:27:30,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 71 letters. Loop has 40 letters. [2022-02-21 04:27:30,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:27:30,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:27:30,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 76 letters. Loop has 32 letters. [2022-02-21 04:27:30,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:27:30,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:27:30,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 70 letters. Loop has 40 letters. [2022-02-21 04:27:30,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:27:30,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:27:30,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 69 letters. Loop has 40 letters. [2022-02-21 04:27:30,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:27:30,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:27:30,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 67 letters. Loop has 38 letters. [2022-02-21 04:27:30,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:27:30,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:27:30,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 68 letters. Loop has 40 letters. [2022-02-21 04:27:30,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:27:30,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:27:30,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 65 letters. Loop has 38 letters. [2022-02-21 04:27:30,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:27:30,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:27:30,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 68 letters. Loop has 40 letters. [2022-02-21 04:27:30,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:27:30,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:27:30,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 66 letters. Loop has 38 letters. [2022-02-21 04:27:30,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:27:30,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:27:30,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 67 letters. Loop has 40 letters. [2022-02-21 04:27:30,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:27:30,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:27:30,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:27:30,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:27:30,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 67 letters. Loop has 40 letters. [2022-02-21 04:27:30,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:27:30,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:27:30,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 58 letters. Loop has 35 letters. [2022-02-21 04:27:30,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:27:30,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:27:30,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 66 letters. Loop has 40 letters. [2022-02-21 04:27:30,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:27:30,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:27:30,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 64 letters. Loop has 32 letters. [2022-02-21 04:27:30,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:27:30,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:27:30,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 76 letters. Loop has 40 letters. [2022-02-21 04:27:30,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:27:30,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:27:30,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 74 letters. Loop has 38 letters. [2022-02-21 04:27:30,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:27:30,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:27:30,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 75 letters. Loop has 40 letters. [2022-02-21 04:27:30,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:27:30,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:27:30,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 75 letters. Loop has 40 letters. [2022-02-21 04:27:30,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:27:30,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:27:30,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 74 letters. Loop has 40 letters. [2022-02-21 04:27:30,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:27:30,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:30,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 35 letters. [2022-02-21 04:27:30,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:30,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:27:30,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 57 letters. Loop has 35 letters. [2022-02-21 04:27:30,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:27:30,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:27:30,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 73 letters. Loop has 36 letters. [2022-02-21 04:27:30,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:27:30,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 56 letters. Loop has 35 letters. [2022-02-21 04:27:30,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 56 letters. Loop has 35 letters. [2022-02-21 04:27:30,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 56 letters. Loop has 35 letters. [2022-02-21 04:27:30,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 89 letters. Loop has 35 letters. [2022-02-21 04:27:30,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 89 letters. Loop has 35 letters. [2022-02-21 04:27:30,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 89 letters. Loop has 35 letters. [2022-02-21 04:27:30,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:30,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 73 letters. Loop has 35 letters. [2022-02-21 04:27:30,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:30,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 88 letters. Loop has 35 letters. [2022-02-21 04:27:30,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 88 letters. Loop has 35 letters. [2022-02-21 04:27:30,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 88 letters. Loop has 35 letters. [2022-02-21 04:27:30,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:27:30,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 74 letters. Loop has 37 letters. [2022-02-21 04:27:30,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:27:30,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:27:30,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 87 letters. Loop has 35 letters. [2022-02-21 04:27:30,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:27:30,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:27:30,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 63 letters. Loop has 37 letters. [2022-02-21 04:27:30,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:27:30,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 86 letters. Loop has 35 letters. [2022-02-21 04:27:30,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 86 letters. Loop has 35 letters. [2022-02-21 04:27:30,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 86 letters. Loop has 35 letters. [2022-02-21 04:27:30,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:27:30,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:27:30,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 83 letters. Loop has 35 letters. [2022-02-21 04:27:30,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:27:30,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 83 letters. Loop has 35 letters. [2022-02-21 04:27:30,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:27:30,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 60 letters. Loop has 35 letters. [2022-02-21 04:27:30,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:27:30,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:27:30,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 61 letters. Loop has 35 letters. [2022-02-21 04:27:30,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:27:30,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:27:30,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 61 letters. Loop has 37 letters. [2022-02-21 04:27:30,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:27:30,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:30,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,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 1 letters. Loop has 2 letters. [2022-02-21 04:27:30,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:30,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,107 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:27:30,107 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:27:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-02-21 04:27:30,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:27:30,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 90 letters. Loop has 35 letters. [2022-02-21 04:27:30,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 55 letters. Loop has 70 letters. [2022-02-21 04:27:30,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:30,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 573 states and 970 transitions. cyclomatic complexity: 398 [2022-02-21 04:27:30,124 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:30,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 573 states to 0 states and 0 transitions. [2022-02-21 04:27:30,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:27:30,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:27:30,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:27:30,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:30,124 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:30,124 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:30,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:27:30,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:27:30,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:27:30,125 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:27:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:30,125 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:27:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:27:30,126 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:27:30,162 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:27:30,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:27:30,163 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:30,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:27:30,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:27:30,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:27:30,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:27:30,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:30,164 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:30,164 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:30,164 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:30,164 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:27:30,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:27:30,164 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:30,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:27:30,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:27:30 BoogieIcfgContainer [2022-02-21 04:27:30,169 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:27:30,170 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:27:30,170 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:27:30,170 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:27:30,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:27:22" (3/4) ... [2022-02-21 04:27:30,172 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:27:30,172 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:27:30,173 INFO L158 Benchmark]: Toolchain (without parser) took 9287.28ms. Allocated memory was 102.8MB in the beginning and 207.6MB in the end (delta: 104.9MB). Free memory was 68.9MB in the beginning and 93.7MB in the end (delta: -24.9MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2022-02-21 04:27:30,173 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 49.8MB in the beginning and 49.8MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:27:30,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.57ms. Allocated memory is still 102.8MB. Free memory was 68.9MB in the beginning and 62.6MB in the end (delta: 6.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 04:27:30,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.43ms. Allocated memory is still 102.8MB. Free memory was 62.0MB in the beginning and 55.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:27:30,174 INFO L158 Benchmark]: Boogie Preprocessor took 37.77ms. Allocated memory is still 102.8MB. Free memory was 55.7MB in the beginning and 51.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:27:30,174 INFO L158 Benchmark]: RCFGBuilder took 909.81ms. Allocated memory was 102.8MB in the beginning and 142.6MB in the end (delta: 39.8MB). Free memory was 51.5MB in the beginning and 114.0MB in the end (delta: -62.5MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2022-02-21 04:27:30,175 INFO L158 Benchmark]: BuchiAutomizer took 7750.97ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 113.0MB in the beginning and 94.8MB in the end (delta: 18.3MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2022-02-21 04:27:30,175 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 207.6MB. Free memory was 94.8MB in the beginning and 93.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:27:30,176 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 49.8MB in the beginning and 49.8MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.57ms. Allocated memory is still 102.8MB. Free memory was 68.9MB in the beginning and 62.6MB in the end (delta: 6.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.43ms. Allocated memory is still 102.8MB. Free memory was 62.0MB in the beginning and 55.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.77ms. Allocated memory is still 102.8MB. Free memory was 55.7MB in the beginning and 51.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 909.81ms. Allocated memory was 102.8MB in the beginning and 142.6MB in the end (delta: 39.8MB). Free memory was 51.5MB in the beginning and 114.0MB in the end (delta: -62.5MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 7750.97ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 113.0MB in the beginning and 94.8MB in the end (delta: 18.3MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 207.6MB. Free memory was 94.8MB in the beginning and 93.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 7.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 383 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 648 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 648 mSDsluCounter, 3877 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2285 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1592 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital220 mio100 ax100 hnf100 lsp33 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:27:30,223 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