./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.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 1bb463b167b254c80aafe9ad09b54a56308dc50dcf4a4adbb2aa58670e8927d0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:31:50,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:31:50,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:31:50,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:31:50,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:31:50,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:31:50,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:31:50,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:31:50,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:31:50,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:31:50,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:31:50,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:31:50,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:31:50,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:31:50,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:31:50,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:31:50,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:31:50,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:31:50,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:31:50,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:31:50,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:31:50,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:31:50,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:31:50,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:31:50,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:31:50,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:31:50,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:31:50,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:31:50,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:31:50,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:31:50,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:31:50,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:31:50,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:31:50,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:31:50,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:31:50,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:31:50,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:31:50,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:31:50,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:31:50,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:31:50,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:31:50,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:31:50,502 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:31:50,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:31:50,505 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:31:50,505 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:31:50,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:31:50,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:31:50,506 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:31:50,506 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:31:50,507 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:31:50,507 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:31:50,507 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:31:50,508 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:31:50,508 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:31:50,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:31:50,508 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:31:50,508 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:31:50,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:31:50,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:31:50,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:31:50,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:31:50,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:31:50,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:31:50,509 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:31:50,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:31:50,511 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:31:50,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:31:50,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:31:50,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:31:50,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:31:50,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:31:50,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:31:50,513 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:31:50,513 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 -> 1bb463b167b254c80aafe9ad09b54a56308dc50dcf4a4adbb2aa58670e8927d0 [2022-02-21 04:31:50,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:31:50,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:31:50,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:31:50,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:31:50,752 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:31:50,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2022-02-21 04:31:50,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8884adbf/94479bfcbca94c1dbad744ae8975456e/FLAGfb71b27da [2022-02-21 04:31:51,245 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:31:51,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2022-02-21 04:31:51,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8884adbf/94479bfcbca94c1dbad744ae8975456e/FLAGfb71b27da [2022-02-21 04:31:51,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8884adbf/94479bfcbca94c1dbad744ae8975456e [2022-02-21 04:31:51,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:31:51,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:31:51,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:31:51,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:31:51,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:31:51,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:31:51" (1/1) ... [2022-02-21 04:31:51,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa4148d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51, skipping insertion in model container [2022-02-21 04:31:51,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:31:51" (1/1) ... [2022-02-21 04:31:51,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:31:51,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:31:51,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c[30998,31011] [2022-02-21 04:31:51,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:31:51,621 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:31:51,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c[30998,31011] [2022-02-21 04:31:51,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:31:51,713 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:31:51,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51 WrapperNode [2022-02-21 04:31:51,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:31:51,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:31:51,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:31:51,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:31:51,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51" (1/1) ... [2022-02-21 04:31:51,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51" (1/1) ... [2022-02-21 04:31:51,804 INFO L137 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 981 [2022-02-21 04:31:51,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:31:51,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:31:51,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:31:51,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:31:51,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51" (1/1) ... [2022-02-21 04:31:51,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51" (1/1) ... [2022-02-21 04:31:51,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51" (1/1) ... [2022-02-21 04:31:51,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51" (1/1) ... [2022-02-21 04:31:51,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51" (1/1) ... [2022-02-21 04:31:51,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51" (1/1) ... [2022-02-21 04:31:51,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51" (1/1) ... [2022-02-21 04:31:51,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:31:51,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:31:51,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:31:51,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:31:51,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51" (1/1) ... [2022-02-21 04:31:51,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:51,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:51,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:51,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:31:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:31:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:31:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:31:51,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:31:52,048 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:31:52,049 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:31:52,795 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:31:52,810 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:31:52,811 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:31:52,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:52 BoogieIcfgContainer [2022-02-21 04:31:52,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:31:52,815 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:31:52,815 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:31:52,818 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:31:52,818 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:52,819 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:31:51" (1/3) ... [2022-02-21 04:31:52,819 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@238f15b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:31:52, skipping insertion in model container [2022-02-21 04:31:52,820 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:52,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:51" (2/3) ... [2022-02-21 04:31:52,820 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@238f15b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:31:52, skipping insertion in model container [2022-02-21 04:31:52,820 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:52,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:52" (3/3) ... [2022-02-21 04:31:52,821 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c [2022-02-21 04:31:52,857 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:31:52,857 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:31:52,857 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:31:52,857 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:31:52,857 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:31:52,857 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:31:52,857 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:31:52,857 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:31:52,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 323 states, 322 states have (on average 1.8043478260869565) internal successors, (581), 322 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:52,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2022-02-21 04:31:52,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:52,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:52,957 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:52,957 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:52,958 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:31:52,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 323 states, 322 states have (on average 1.8043478260869565) internal successors, (581), 322 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:53,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2022-02-21 04:31:53,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:53,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:53,010 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:53,011 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:53,021 INFO L791 eck$LassoCheckResult]: Stem: 305#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 218#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 34#L441true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 253#L452true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 104#L462true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 153#L473true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 285#L483true assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 256#L494true init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 257#L504true assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 60#L515true init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 3#L525true assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 248#L536true init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 54#L546true assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 321#L557true init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 69#L567true assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 225#L578true init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 115#L588true assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 242#L599true init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 101#L609true assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 77#L620true init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 107#L630true assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 220#L641true init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 303#L651true assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 227#L662true init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 141#L672true assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 260#L683true init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 309#L693true assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 239#L704true init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 180#L714true assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 14#L725true init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 315#L735true assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 114#L746true init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 97#L756true assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 290#L767true init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 36#L777true assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 163#L788true init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 224#L798true assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 311#L809true init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 228#L819true assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 286#L830true init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 135#L840true assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 262#L851true init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 205#L861true assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 264#L872true init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 217#L882true assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 102#L893true init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 282#L903true assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 99#L914true init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 268#L924true assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 90#L935true init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 130#L945true assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 230#L945-1true init_#res#1 := init_~tmp___23~0#1; 13#L1130true main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 125#L21true assume !(0 == assume_abort_if_not_~cond#1); 195#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; 161#L1271-2true [2022-02-21 04:31:53,028 INFO L793 eck$LassoCheckResult]: Loop: 161#L1271-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 74#L114true assume !(0 != ~mode1~0 % 256); 277#L150true assume !(~r1~0 < 3); 181#L150-1true ~mode1~0 := 1; 61#L114-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 41#L178true assume !(0 != ~mode2~0 % 256); 314#L214true assume !(~r2~0 < 3); 105#L214-1true ~mode2~0 := 1; 183#L178-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 322#L242true assume !(0 != ~mode3~0 % 256); 169#L278true assume !(~r3~0 < 3); 129#L278-1true ~mode3~0 := 1; 236#L242-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 156#L306true assume !(0 != ~mode4~0 % 256); 53#L342true assume !(~r4~0 < 3); 18#L342-1true ~mode4~0 := 1; 64#L306-2true assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 171#L1138true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 199#L1138-1true check_#res#1 := check_~tmp~1#1; 139#L1190true main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 201#L1314true assume !(0 == assert_~arg#1 % 256); 289#L1309true assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; 161#L1271-2true [2022-02-21 04:31:53,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:53,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2064134942, now seen corresponding path program 1 times [2022-02-21 04:31:53,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:53,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400459427] [2022-02-21 04:31:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:53,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; {327#true} is VALID [2022-02-21 04:31:53,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {327#true} is VALID [2022-02-21 04:31:53,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,359 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {327#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {327#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {327#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {327#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {327#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {327#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {327#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {327#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {327#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {327#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {327#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {327#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {327#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {327#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {327#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {327#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {327#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {327#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {327#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {327#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {327#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {327#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {327#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {327#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {327#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {327#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {327#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {327#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {327#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {327#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {327#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {327#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {327#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {327#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {327#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {327#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {327#true} is VALID [2022-02-21 04:31:53,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {327#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:31:53,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {327#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {329#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:31:53,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {329#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {330#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:31:53,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {330#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {331#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:31:53,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {331#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {328#false} is VALID [2022-02-21 04:31:53,375 INFO L290 TraceCheckUtils]: 54: Hoare triple {328#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; {328#false} is VALID [2022-02-21 04:31:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:53,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:53,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400459427] [2022-02-21 04:31:53,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400459427] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:53,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:53,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:53,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161927933] [2022-02-21 04:31:53,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:53,384 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:53,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:53,387 INFO L85 PathProgramCache]: Analyzing trace with hash -340497803, now seen corresponding path program 1 times [2022-02-21 04:31:53,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:53,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120531946] [2022-02-21 04:31:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:53,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:53,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {332#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {332#true} is VALID [2022-02-21 04:31:53,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#true} assume !(0 != ~mode1~0 % 256); {332#true} is VALID [2022-02-21 04:31:53,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#true} assume !(~r1~0 < 3); {332#true} is VALID [2022-02-21 04:31:53,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {332#true} ~mode1~0 := 1; {332#true} is VALID [2022-02-21 04:31:53,502 INFO L290 TraceCheckUtils]: 4: Hoare triple {332#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {332#true} is VALID [2022-02-21 04:31:53,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#true} assume !(0 != ~mode2~0 % 256); {332#true} is VALID [2022-02-21 04:31:53,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {332#true} assume !(~r2~0 < 3); {332#true} is VALID [2022-02-21 04:31:53,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {332#true} ~mode2~0 := 1; {332#true} is VALID [2022-02-21 04:31:53,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {332#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {332#true} is VALID [2022-02-21 04:31:53,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {332#true} assume !(0 != ~mode3~0 % 256); {332#true} is VALID [2022-02-21 04:31:53,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {332#true} assume !(~r3~0 < 3); {332#true} is VALID [2022-02-21 04:31:53,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {332#true} ~mode3~0 := 1; {332#true} is VALID [2022-02-21 04:31:53,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {332#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; {332#true} is VALID [2022-02-21 04:31:53,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {332#true} assume !(0 != ~mode4~0 % 256); {332#true} is VALID [2022-02-21 04:31:53,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {332#true} assume !(~r4~0 < 3); {332#true} is VALID [2022-02-21 04:31:53,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {332#true} ~mode4~0 := 1; {332#true} is VALID [2022-02-21 04:31:53,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {332#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; {332#true} is VALID [2022-02-21 04:31:53,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {332#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {334#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:31:53,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {334#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {335#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:31:53,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {335#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {336#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:31:53,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {336#(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); {333#false} is VALID [2022-02-21 04:31:53,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {333#false} assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; {333#false} is VALID [2022-02-21 04:31:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:53,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:53,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120531946] [2022-02-21 04:31:53,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120531946] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:53,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:53,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:53,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767493203] [2022-02-21 04:31:53,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:53,510 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:53,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:53,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:31:53,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:31:53,535 INFO L87 Difference]: Start difference. First operand has 323 states, 322 states have (on average 1.8043478260869565) internal successors, (581), 322 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:54,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:54,584 INFO L93 Difference]: Finished difference Result 327 states and 581 transitions. [2022-02-21 04:31:54,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:31:54,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:54,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:54,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 327 states and 581 transitions. [2022-02-21 04:31:54,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2022-02-21 04:31:54,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 327 states to 318 states and 564 transitions. [2022-02-21 04:31:54,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2022-02-21 04:31:54,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2022-02-21 04:31:54,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 564 transitions. [2022-02-21 04:31:54,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:54,637 INFO L681 BuchiCegarLoop]: Abstraction has 318 states and 564 transitions. [2022-02-21 04:31:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 564 transitions. [2022-02-21 04:31:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-02-21 04:31:54,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:54,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 318 states and 564 transitions. Second operand has 318 states, 318 states have (on average 1.7735849056603774) internal successors, (564), 317 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:54,681 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states and 564 transitions. Second operand has 318 states, 318 states have (on average 1.7735849056603774) internal successors, (564), 317 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:54,682 INFO L87 Difference]: Start difference. First operand 318 states and 564 transitions. Second operand has 318 states, 318 states have (on average 1.7735849056603774) internal successors, (564), 317 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:54,695 INFO L93 Difference]: Finished difference Result 318 states and 564 transitions. [2022-02-21 04:31:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 564 transitions. [2022-02-21 04:31:54,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:54,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:54,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 318 states, 318 states have (on average 1.7735849056603774) internal successors, (564), 317 states have internal predecessors, (564), 0 states have call successors, (0), 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 318 states and 564 transitions. [2022-02-21 04:31:54,701 INFO L87 Difference]: Start difference. First operand has 318 states, 318 states have (on average 1.7735849056603774) internal successors, (564), 317 states have internal predecessors, (564), 0 states have call successors, (0), 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 318 states and 564 transitions. [2022-02-21 04:31:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:54,710 INFO L93 Difference]: Finished difference Result 318 states and 564 transitions. [2022-02-21 04:31:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 564 transitions. [2022-02-21 04:31:54,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:54,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:54,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:54,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.7735849056603774) internal successors, (564), 317 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 564 transitions. [2022-02-21 04:31:54,726 INFO L704 BuchiCegarLoop]: Abstraction has 318 states and 564 transitions. [2022-02-21 04:31:54,726 INFO L587 BuchiCegarLoop]: Abstraction has 318 states and 564 transitions. [2022-02-21 04:31:54,726 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:31:54,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 564 transitions. [2022-02-21 04:31:54,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2022-02-21 04:31:54,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:54,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:54,732 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:54,732 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:54,733 INFO L791 eck$LassoCheckResult]: Stem: 984#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 965#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 743#L441 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 744#L452 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 858#L462 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 825#L473 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 911#L483 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 950#L494 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 978#L504 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 765#L515 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 671#L525 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 672#L536 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 780#L546 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 781#L557 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 805#L567 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 806#L578 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 870#L588 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 724#L599 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 856#L609 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 788#L620 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 823#L630 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 763#L641 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 967#L651 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 726#L662 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 900#L672 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 901#L683 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 979#L693 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 714#L704 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 939#L714 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 700#L725 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 701#L735 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 675#L746 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 849#L756 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 691#L767 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 746#L777 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 747#L788 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 921#L798 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 889#L809 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 970#L819 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 934#L830 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 893#L840 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 848#L851 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 958#L861 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 794#L872 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 964#L882 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 771#L893 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 857#L903 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 852#L914 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 853#L924 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 838#L935 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 839#L945 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 682#L945-1 init_#res#1 := init_~tmp___23~0#1; 693#L1130 main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 694#L21 assume !(0 == assume_abort_if_not_~cond#1); 882#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; 920#L1271-2 [2022-02-21 04:31:54,733 INFO L793 eck$LassoCheckResult]: Loop: 920#L1271-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 814#L114 assume !(0 != ~mode1~0 % 256); 815#L150 assume !(~r1~0 < 3); 810#L150-1 ~mode1~0 := 1; 792#L114-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 754#L178 assume !(0 != ~mode2~0 % 256); 755#L214 assume !(~r2~0 < 3); 711#L214-1 ~mode2~0 := 1; 860#L178-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 941#L242 assume !(0 != ~mode3~0 % 256); 927#L278 assume !(~r3~0 < 3); 829#L278-1 ~mode3~0 := 1; 881#L242-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 914#L306 assume !(0 != ~mode4~0 % 256); 776#L342 assume !(~r4~0 < 3); 704#L342-1 ~mode4~0 := 1; 705#L306-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 797#L1138 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 929#L1139 assume ~st1~0 + ~nl1~0 <= 1; 966#L1140 assume ~st2~0 + ~nl2~0 <= 1; 931#L1141 assume ~st3~0 + ~nl3~0 <= 1; 932#L1142 assume ~st4~0 + ~nl4~0 <= 1; 861#L1143 assume ~r1~0 >= 3; 732#L1147 assume ~r1~0 < 3; 733#L1152 assume ~r1~0 >= 3; 906#L1157 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 908#L1138-1 check_#res#1 := check_~tmp~1#1; 897#L1190 main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 898#L1314 assume !(0 == assert_~arg#1 % 256); 953#L1309 assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; 920#L1271-2 [2022-02-21 04:31:54,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2064134942, now seen corresponding path program 2 times [2022-02-21 04:31:54,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:54,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670217204] [2022-02-21 04:31:54,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:54,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:54,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; {1625#true} is VALID [2022-02-21 04:31:54,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {1625#true} is VALID [2022-02-21 04:31:54,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {1625#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {1625#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {1625#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {1625#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {1625#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {1625#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {1625#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {1625#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {1625#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {1625#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {1625#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {1625#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {1625#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {1625#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {1625#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {1625#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {1625#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {1625#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {1625#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {1625#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {1625#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {1625#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {1625#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {1625#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {1625#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {1625#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {1625#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {1625#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {1625#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {1625#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {1625#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {1625#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {1625#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {1625#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {1625#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {1625#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {1625#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {1625#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {1625#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,815 INFO L290 TraceCheckUtils]: 43: Hoare triple {1625#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {1625#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {1625#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,816 INFO L290 TraceCheckUtils]: 46: Hoare triple {1625#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,816 INFO L290 TraceCheckUtils]: 47: Hoare triple {1625#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {1625#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {1625#true} is VALID [2022-02-21 04:31:54,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {1625#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:31:54,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {1625#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {1627#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:31:54,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {1627#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {1628#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:31:54,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {1628#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1629#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:31:54,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {1629#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {1626#false} is VALID [2022-02-21 04:31:54,825 INFO L290 TraceCheckUtils]: 54: Hoare triple {1626#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; {1626#false} is VALID [2022-02-21 04:31:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:54,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:54,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670217204] [2022-02-21 04:31:54,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670217204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:54,826 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:54,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:54,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182192011] [2022-02-21 04:31:54,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:54,826 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:54,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1528981060, now seen corresponding path program 1 times [2022-02-21 04:31:54,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:54,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132888359] [2022-02-21 04:31:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:54,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:54,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {1630#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {1630#true} is VALID [2022-02-21 04:31:54,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#true} assume !(0 != ~mode1~0 % 256); {1630#true} is VALID [2022-02-21 04:31:54,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#true} assume !(~r1~0 < 3); {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {1632#(not (<= ~r1~0 2))} ~mode1~0 := 1; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,850 INFO L290 TraceCheckUtils]: 4: Hoare triple {1632#(not (<= ~r1~0 2))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {1632#(not (<= ~r1~0 2))} assume !(0 != ~mode2~0 % 256); {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {1632#(not (<= ~r1~0 2))} assume !(~r2~0 < 3); {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {1632#(not (<= ~r1~0 2))} ~mode2~0 := 1; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {1632#(not (<= ~r1~0 2))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {1632#(not (<= ~r1~0 2))} assume !(0 != ~mode3~0 % 256); {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {1632#(not (<= ~r1~0 2))} assume !(~r3~0 < 3); {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {1632#(not (<= ~r1~0 2))} ~mode3~0 := 1; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {1632#(not (<= ~r1~0 2))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {1632#(not (<= ~r1~0 2))} assume !(0 != ~mode4~0 % 256); {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {1632#(not (<= ~r1~0 2))} assume !(~r4~0 < 3); {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {1632#(not (<= ~r1~0 2))} ~mode4~0 := 1; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {1632#(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; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {1632#(not (<= ~r1~0 2))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {1632#(not (<= ~r1~0 2))} assume ~st1~0 + ~nl1~0 <= 1; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {1632#(not (<= ~r1~0 2))} assume ~st2~0 + ~nl2~0 <= 1; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {1632#(not (<= ~r1~0 2))} assume ~st3~0 + ~nl3~0 <= 1; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {1632#(not (<= ~r1~0 2))} assume ~st4~0 + ~nl4~0 <= 1; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {1632#(not (<= ~r1~0 2))} assume ~r1~0 >= 3; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:31:54,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {1632#(not (<= ~r1~0 2))} assume ~r1~0 < 3; {1631#false} is VALID [2022-02-21 04:31:54,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {1631#false} assume ~r1~0 >= 3; {1631#false} is VALID [2022-02-21 04:31:54,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {1631#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {1631#false} is VALID [2022-02-21 04:31:54,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {1631#false} check_#res#1 := check_~tmp~1#1; {1631#false} is VALID [2022-02-21 04:31:54,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#false} main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1631#false} is VALID [2022-02-21 04:31:54,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {1631#false} assume !(0 == assert_~arg#1 % 256); {1631#false} is VALID [2022-02-21 04:31:54,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {1631#false} assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; {1631#false} is VALID [2022-02-21 04:31:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:54,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:54,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132888359] [2022-02-21 04:31:54,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132888359] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:54,858 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:54,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:54,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470147067] [2022-02-21 04:31:54,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:54,858 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:54,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:54,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:54,859 INFO L87 Difference]: Start difference. First operand 318 states and 564 transitions. cyclomatic complexity: 247 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:55,295 INFO L93 Difference]: Finished difference Result 414 states and 718 transitions. [2022-02-21 04:31:55,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:55,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:55,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:55,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 414 states and 718 transitions. [2022-02-21 04:31:55,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 218 [2022-02-21 04:31:55,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 414 states to 414 states and 718 transitions. [2022-02-21 04:31:55,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 414 [2022-02-21 04:31:55,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 414 [2022-02-21 04:31:55,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 414 states and 718 transitions. [2022-02-21 04:31:55,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:55,345 INFO L681 BuchiCegarLoop]: Abstraction has 414 states and 718 transitions. [2022-02-21 04:31:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states and 718 transitions. [2022-02-21 04:31:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-02-21 04:31:55,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:55,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 414 states and 718 transitions. Second operand has 414 states, 414 states have (on average 1.7342995169082125) internal successors, (718), 413 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:55,358 INFO L74 IsIncluded]: Start isIncluded. First operand 414 states and 718 transitions. Second operand has 414 states, 414 states have (on average 1.7342995169082125) internal successors, (718), 413 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:55,358 INFO L87 Difference]: Start difference. First operand 414 states and 718 transitions. Second operand has 414 states, 414 states have (on average 1.7342995169082125) internal successors, (718), 413 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:55,366 INFO L93 Difference]: Finished difference Result 414 states and 718 transitions. [2022-02-21 04:31:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 718 transitions. [2022-02-21 04:31:55,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:55,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:55,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 414 states, 414 states have (on average 1.7342995169082125) internal successors, (718), 413 states have internal predecessors, (718), 0 states have call successors, (0), 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 414 states and 718 transitions. [2022-02-21 04:31:55,368 INFO L87 Difference]: Start difference. First operand has 414 states, 414 states have (on average 1.7342995169082125) internal successors, (718), 413 states have internal predecessors, (718), 0 states have call successors, (0), 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 414 states and 718 transitions. [2022-02-21 04:31:55,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:55,377 INFO L93 Difference]: Finished difference Result 414 states and 718 transitions. [2022-02-21 04:31:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 718 transitions. [2022-02-21 04:31:55,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:55,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:55,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:55,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 414 states have (on average 1.7342995169082125) internal successors, (718), 413 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 718 transitions. [2022-02-21 04:31:55,386 INFO L704 BuchiCegarLoop]: Abstraction has 414 states and 718 transitions. [2022-02-21 04:31:55,386 INFO L587 BuchiCegarLoop]: Abstraction has 414 states and 718 transitions. [2022-02-21 04:31:55,386 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:31:55,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 414 states and 718 transitions. [2022-02-21 04:31:55,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 218 [2022-02-21 04:31:55,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:55,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:55,389 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:55,389 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:55,389 INFO L791 eck$LassoCheckResult]: Stem: 2370#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 2348#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 2119#L441 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 2120#L452 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 2238#L462 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 2204#L473 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 2289#L483 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 2332#L494 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 2361#L504 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 2143#L515 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 2047#L525 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 2048#L536 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 2159#L546 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 2160#L557 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 2184#L567 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 2185#L578 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 2249#L588 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 2101#L599 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 2235#L609 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 2164#L620 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 2202#L630 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 2136#L641 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 2349#L651 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 2103#L662 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 2279#L672 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 2280#L683 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 2362#L693 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 2093#L704 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 2320#L714 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 2074#L725 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 2075#L735 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 2051#L746 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 2229#L756 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 2067#L767 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 2124#L777 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 2125#L788 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 2301#L798 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 2268#L809 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 2353#L819 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 2315#L830 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 2272#L840 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 2228#L851 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 2342#L861 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 2173#L872 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 2347#L882 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 2149#L893 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 2236#L903 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 2232#L914 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 2233#L924 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 2218#L935 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 2219#L945 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 2060#L945-1 init_#res#1 := init_~tmp___23~0#1; 2072#L1130 main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 2073#L21 assume !(0 == assume_abort_if_not_~cond#1); 2260#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; 2333#L1271-2 [2022-02-21 04:31:55,389 INFO L793 eck$LassoCheckResult]: Loop: 2333#L1271-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 2456#L114 assume !(0 != ~mode1~0 % 256); 2455#L150 assume ~r1~0 < 3; 2243#L151 assume !(0 != ~ep12~0 % 256); 2146#L151-1 assume !(0 != ~ep13~0 % 256); 2070#L156 assume !(0 != ~ep14~0 % 256); 2189#L150-1 ~mode1~0 := 1; 2368#L114-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 2418#L178 assume !(0 != ~mode2~0 % 256); 2414#L214 assume !(~r2~0 < 3); 2409#L214-1 ~mode2~0 := 1; 2406#L178-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 2404#L242 assume !(0 != ~mode3~0 % 256); 2400#L278 assume !(~r3~0 < 3); 2397#L278-1 ~mode3~0 := 1; 2393#L242-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 2390#L306 assume !(0 != ~mode4~0 % 256); 2386#L342 assume !(~r4~0 < 3); 2381#L342-1 ~mode4~0 := 1; 2379#L306-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 2378#L1138 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 2377#L1139 assume ~st1~0 + ~nl1~0 <= 1; 2376#L1140 assume ~st2~0 + ~nl2~0 <= 1; 2375#L1141 assume ~st3~0 + ~nl3~0 <= 1; 2374#L1142 assume ~st4~0 + ~nl4~0 <= 1; 2373#L1143 assume !(~r1~0 >= 3); 2298#L1146 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 2299#L1147 assume ~r1~0 < 3; 2372#L1152 assume !(~r1~0 >= 3); 2366#L1156 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 2367#L1157 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 2460#L1138-1 check_#res#1 := check_~tmp~1#1; 2459#L1190 main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 2458#L1314 assume !(0 == assert_~arg#1 % 256); 2457#L1309 assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; 2333#L1271-2 [2022-02-21 04:31:55,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:55,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2064134942, now seen corresponding path program 3 times [2022-02-21 04:31:55,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:55,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311469479] [2022-02-21 04:31:55,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:55,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:55,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {3292#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; {3292#true} is VALID [2022-02-21 04:31:55,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {3292#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {3292#true} is VALID [2022-02-21 04:31:55,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {3292#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {3292#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {3292#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {3292#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {3292#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {3292#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {3292#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {3292#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {3292#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {3292#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {3292#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {3292#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {3292#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {3292#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {3292#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {3292#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {3292#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {3292#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {3292#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {3292#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {3292#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {3292#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {3292#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {3292#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {3292#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {3292#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {3292#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {3292#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {3292#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {3292#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {3292#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {3292#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {3292#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {3292#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {3292#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {3292#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {3292#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {3292#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {3292#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,445 INFO L290 TraceCheckUtils]: 41: Hoare triple {3292#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,445 INFO L290 TraceCheckUtils]: 42: Hoare triple {3292#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {3292#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {3292#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {3292#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {3292#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {3292#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {3292#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {3292#true} is VALID [2022-02-21 04:31:55,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {3292#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3292#true} is VALID [2022-02-21 04:31:55,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {3292#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {3294#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:31:55,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {3294#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {3295#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:31:55,448 INFO L290 TraceCheckUtils]: 52: Hoare triple {3295#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3296#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:31:55,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {3296#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {3293#false} is VALID [2022-02-21 04:31:55,448 INFO L290 TraceCheckUtils]: 54: Hoare triple {3293#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; {3293#false} is VALID [2022-02-21 04:31:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:55,448 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:55,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311469479] [2022-02-21 04:31:55,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311469479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:55,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:55,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:55,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473503002] [2022-02-21 04:31:55,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:55,450 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash -110224707, now seen corresponding path program 1 times [2022-02-21 04:31:55,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:55,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327297439] [2022-02-21 04:31:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:55,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:55,484 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:56,368 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:56,368 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:56,368 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:56,369 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:56,369 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:31:56,369 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:56,369 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:56,369 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:56,369 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:31:56,369 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:56,369 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:56,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:56,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,207 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:31:57,207 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:31:57,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:57,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:57,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:57,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:31:57,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:31:57,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:57,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:57,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:57,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:57,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:57,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:31:57,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:31:57,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:57,411 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:31:57,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 04:31:57,416 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:57,416 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:57,416 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:57,416 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:57,416 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:31:57,416 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:57,416 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:57,416 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:57,416 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:31:57,416 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:57,416 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:57,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:57,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:58,225 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:31:58,228 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:31:58,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:31:58,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 04:31:58,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:31:58,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 04:31:58,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,297 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:31:58,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:58,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:31:58,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:58,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,386 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:31:58,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:58,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,413 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:31:58,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:58,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,440 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:31:58,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:58,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,473 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:31:58,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:58,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,501 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:31:58,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 04:31:58,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,543 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:31:58,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,578 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:31:58,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,579 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:31:58,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:58,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,616 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:31:58,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:58,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,645 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:31:58,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:58,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,705 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:31:58,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:58,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,748 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:31:58,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:58,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,791 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:31:58,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,836 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:31:58,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,838 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:31:58,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:58,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,898 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:31:58,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 04:31:58,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,936 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:31:58,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 04:31:58,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,963 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:31:58,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:58,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:58,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:58,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:58,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:58,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:58,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:58,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:58,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:58,990 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:31:58,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:58,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:58,991 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:58,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:31:58,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:59,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:59,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:59,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:59,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:59,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:59,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:59,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:59,002 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:31:59,005 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:31:59,005 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:31:59,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:59,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:59,008 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:59,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:31:59,009 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:31:59,009 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:31:59,010 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:31:59,010 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2022-02-21 04:31:59,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 04:31:59,032 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:31:59,039 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0;" "assume !(0 != ~mode1~0 % 256);" "assume ~r1~0 < 3;" "assume !(0 != ~ep12~0 % 256);" "assume !(0 != ~ep13~0 % 256);" "assume !(0 != ~ep14~0 % 256);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 3);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 3);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0;" "assume !(0 != ~mode4~0 % 256);" "assume !(~r4~0 < 3);" "~mode4~0 := 1;" "assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~st4~0 + ~nl4~0 <= 1;" "assume !(~r1~0 >= 3);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0;" "assume ~r1~0 < 3;" "assume !(~r1~0 >= 3);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0;" "assume ~r1~0 < 3;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1;" [2022-02-21 04:31:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:59,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:31:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:59,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:31:59,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {3299#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; {3299#unseeded} is VALID [2022-02-21 04:31:59,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {3299#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {3299#unseeded} is VALID [2022-02-21 04:31:59,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {3299#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {3299#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,285 INFO L290 TraceCheckUtils]: 4: Hoare triple {3299#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {3299#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {3299#unseeded} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {3299#unseeded} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {3299#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {3299#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {3299#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {3299#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {3299#unseeded} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {3299#unseeded} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {3299#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {3299#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {3299#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {3299#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {3299#unseeded} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {3299#unseeded} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {3299#unseeded} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {3299#unseeded} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {3299#unseeded} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {3299#unseeded} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {3299#unseeded} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {3299#unseeded} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {3299#unseeded} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {3299#unseeded} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {3299#unseeded} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {3299#unseeded} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {3299#unseeded} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {3299#unseeded} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {3299#unseeded} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {3299#unseeded} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {3299#unseeded} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {3299#unseeded} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {3299#unseeded} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {3299#unseeded} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {3299#unseeded} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {3299#unseeded} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {3299#unseeded} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {3299#unseeded} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {3299#unseeded} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {3299#unseeded} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {3299#unseeded} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {3299#unseeded} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {3299#unseeded} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,312 INFO L290 TraceCheckUtils]: 47: Hoare triple {3299#unseeded} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,312 INFO L290 TraceCheckUtils]: 48: Hoare triple {3299#unseeded} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {3299#unseeded} is VALID [2022-02-21 04:31:59,313 INFO L290 TraceCheckUtils]: 49: Hoare triple {3299#unseeded} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3299#unseeded} is VALID [2022-02-21 04:31:59,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {3299#unseeded} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {3299#unseeded} is VALID [2022-02-21 04:31:59,313 INFO L290 TraceCheckUtils]: 51: Hoare triple {3299#unseeded} init_#res#1 := init_~tmp___23~0#1; {3299#unseeded} is VALID [2022-02-21 04:31:59,313 INFO L290 TraceCheckUtils]: 52: Hoare triple {3299#unseeded} main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3299#unseeded} is VALID [2022-02-21 04:31:59,314 INFO L290 TraceCheckUtils]: 53: Hoare triple {3299#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {3299#unseeded} is VALID [2022-02-21 04:31:59,314 INFO L290 TraceCheckUtils]: 54: Hoare triple {3299#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; {3299#unseeded} is VALID [2022-02-21 04:31:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:59,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:31:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:59,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:31:59,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:59,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {3302#(>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode1~0 % 256); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep12~0 % 256); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,683 INFO L290 TraceCheckUtils]: 4: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep13~0 % 256); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep14~0 % 256); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode1~0 := 1; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode2~0 % 256); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r2~0 < 3); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode2~0 := 1; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode3~0 % 256); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r3~0 < 3); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode3~0 := 1; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode4~0 % 256); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r4~0 < 3); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode4~0 := 1; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {3479#(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; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {3479#(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; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~nl1~0 <= 1; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st2~0 + ~nl2~0 <= 1; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st3~0 + ~nl3~0 <= 1; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st4~0 + ~nl4~0 <= 1; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {3479#(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; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {3479#(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; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {3479#(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; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} check_#res#1 := check_~tmp~1#1; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 == assert_~arg#1 % 256); {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:31:59,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {3479#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; {3312#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:31:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:59,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:59,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:59,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:31:59,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:59,728 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:31:59,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 414 states and 718 transitions. cyclomatic complexity: 305 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:32:00,218 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 414 states and 718 transitions. cyclomatic complexity: 305. 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 631 states and 1074 transitions. Complement of second has 4 states. [2022-02-21 04:32:00,219 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:32:00,219 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:32:00,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 414 states and 718 transitions. cyclomatic complexity: 305 [2022-02-21 04:32:00,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:32:00,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:32:00,219 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:32:00,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:32:00,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:32:00,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:32:00,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 631 states and 1074 transitions. [2022-02-21 04:32:00,230 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:32:00,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:32:00,232 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 414 states and 718 transitions. cyclomatic complexity: 305 [2022-02-21 04:32:00,372 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 218 examples of accepted words. [2022-02-21 04:32:00,372 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:32:00,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:32:00,375 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:32:00,376 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 631 states and 1074 transitions. cyclomatic complexity: 444 [2022-02-21 04:32:00,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 631 states and 1074 transitions. cyclomatic complexity: 444 [2022-02-21 04:32:00,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:32:00,376 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:32:00,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:32:00,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:32:00,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:32:00,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:32:00,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 631 letters. Loop has 631 letters. [2022-02-21 04:32:00,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 631 letters. Loop has 631 letters. [2022-02-21 04:32:00,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 631 letters. Loop has 631 letters. [2022-02-21 04:32:00,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 414 letters. Loop has 414 letters. [2022-02-21 04:32:00,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 414 letters. Loop has 414 letters. [2022-02-21 04:32:00,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 414 letters. Loop has 414 letters. [2022-02-21 04:32:00,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:32:00,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:32:00,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:32:00,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:32:00,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:32:00,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:32:00,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:32:00,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:32:00,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:32:00,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:32:00,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:32:00,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:32:00,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:32:00,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:32:00,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:32:00,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 60 letters. Loop has 38 letters. [2022-02-21 04:32:00,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 38 letters. [2022-02-21 04:32:00,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 60 letters. Loop has 38 letters. [2022-02-21 04:32:00,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:32:00,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:32:00,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:32:00,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:32:00,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:32:00,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:32:00,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:32:00,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:32:00,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:32:00,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:32:00,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:32:00,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:00,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:00,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:32:00,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:32:00,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:32:00,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:32:00,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 41 letters. [2022-02-21 04:32:00,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 41 letters. [2022-02-21 04:32:00,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 41 letters. [2022-02-21 04:32:00,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:32:00,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:32:00,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:32:00,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:32:00,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:32:00,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:32:00,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:32:00,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:32:00,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:32:00,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:32:00,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:32:00,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:32:00,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:32:00,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:32:00,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:32:00,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:32:00,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:32:00,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:32:00,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:32:00,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:32:00,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:32:00,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:32:00,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:32:00,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:32:00,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:32:00,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:32:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:32:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:32:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:32:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:32:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:32:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:32:00,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:32:00,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:32:00,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:00,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:00,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:32:00,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:32:00,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:32:00,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:32:00,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:32:00,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:32:00,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:32:00,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:32:00,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:32:00,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:32:00,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:32:00,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:32:00,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:32:00,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:32:00,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:32:00,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:32:00,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:32:00,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:32:00,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:32:00,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:32:00,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:32:00,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:32:00,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:32:00,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:32:00,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:32:00,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:32:00,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:32:00,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:32:00,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:32:00,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:32:00,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:32:00,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:32:00,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:32:00,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:32:00,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:32:00,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:32:00,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:32:00,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:32:00,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:32:00,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:32:00,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:32:00,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:32:00,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:32:00,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:32:00,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:32:00,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:32:00,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:32:00,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:32:00,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:32:00,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 38 letters. [2022-02-21 04:32:00,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 38 letters. [2022-02-21 04:32:00,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 38 letters. [2022-02-21 04:32:00,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:32:00,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:32:00,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:32:00,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:32:00,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:32:00,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:32:00,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:32:00,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:32:00,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 57 letters. Loop has 36 letters. [2022-02-21 04:32:00,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 36 letters. [2022-02-21 04:32:00,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 57 letters. Loop has 36 letters. [2022-02-21 04:32:00,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:32:00,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:32:00,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:00,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:00,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:32:00,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:32:00,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:32:00,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:32:00,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:00,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:00,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:32:00,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:32:00,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:00,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:00,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:32:00,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:32:00,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:32:00,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:32:00,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:32:00,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:32:00,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:32:00,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:32:00,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:32:00,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:32:00,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:32:00,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:32:00,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:32:00,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:32:00,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:32:00,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 41 letters. [2022-02-21 04:32:00,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 41 letters. [2022-02-21 04:32:00,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 41 letters. [2022-02-21 04:32:00,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:32:00,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:32:00,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:32:00,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:32:00,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:32:00,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:32:00,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:00,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:00,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:32:00,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:32:00,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:32:00,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:32:00,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:32:00,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:32:00,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:32:00,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:32:00,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:32:00,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:32:00,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:32:00,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:32:00,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:32:00,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:32:00,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:32:00,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:32:00,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:32:00,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:32:00,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:00,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:00,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:00,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:00,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 81 letters. Loop has 35 letters. [2022-02-21 04:32:00,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 81 letters. Loop has 35 letters. [2022-02-21 04:32:00,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 82 letters. Loop has 35 letters. [2022-02-21 04:32:00,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 82 letters. Loop has 35 letters. [2022-02-21 04:32:00,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:32:00,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:32:00,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:32:00,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:32:00,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:32:00,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:32:00,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:32:00,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:32:00,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:32:00,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:32:00,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:32:00,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:32:00,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:32:00,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:32:00,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:32:00,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:32:00,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:32:00,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:32:00,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:32:00,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:32:00,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:32:00,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:32:00,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:32:00,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:32:00,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:32:00,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:32:00,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:32:00,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 41 letters. [2022-02-21 04:32:00,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 41 letters. [2022-02-21 04:32:00,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 41 letters. [2022-02-21 04:32:00,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 41 letters. [2022-02-21 04:32:00,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 41 letters. [2022-02-21 04:32:00,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 41 letters. [2022-02-21 04:32:00,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:32:00,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:32:00,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:32:00,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:32:00,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:32:00,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:32:00,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:32:00,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:32:00,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:32:00,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:32:00,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:32:00,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:32:00,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:32:00,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:32:00,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:32:00,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:32:00,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:00,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:00,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:32:00,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:32:00,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:32:00,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:32:00,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:32:00,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:32:00,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:32:00,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:32:00,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:32:00,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:32:00,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:32:00,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:32:00,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 84 letters. Loop has 35 letters. [2022-02-21 04:32:00,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 84 letters. Loop has 35 letters. [2022-02-21 04:32:00,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 85 letters. Loop has 35 letters. [2022-02-21 04:32:00,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 85 letters. Loop has 35 letters. [2022-02-21 04:32:00,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:32:00,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:32:00,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:32:00,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:32:00,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 83 letters. Loop has 35 letters. [2022-02-21 04:32:00,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 83 letters. Loop has 35 letters. [2022-02-21 04:32:00,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 80 letters. Loop has 35 letters. [2022-02-21 04:32:00,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 80 letters. Loop has 35 letters. [2022-02-21 04:32:00,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 79 letters. Loop has 35 letters. [2022-02-21 04:32:00,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 79 letters. Loop has 35 letters. [2022-02-21 04:32:00,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 78 letters. Loop has 35 letters. [2022-02-21 04:32:00,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 78 letters. Loop has 35 letters. [2022-02-21 04:32:00,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:32:00,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:32:00,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:32:00,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:32:00,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:32:00,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:32:00,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:32:00,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:32:00,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:32:00,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:32:00,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:32:00,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:32:00,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:32:00,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 78 letters. Loop has 41 letters. [2022-02-21 04:32:00,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 41 letters. [2022-02-21 04:32:00,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 78 letters. Loop has 41 letters. [2022-02-21 04:32:00,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:32:00,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:32:00,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 41 letters. [2022-02-21 04:32:00,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 41 letters. [2022-02-21 04:32:00,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 41 letters. [2022-02-21 04:32:00,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:32:00,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:32:00,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:32:00,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:32:00,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:32:00,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:32:00,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:32:00,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:32:00,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:32:00,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:32:00,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:32:00,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:32:00,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:32:00,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:32:00,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:32:00,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:32:00,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:32:00,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:32:00,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:32:00,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:32:00,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:32:00,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:32:00,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:32:00,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:32:00,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:32:00,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:32:00,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:32:00,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:32:00,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:32:00,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:32:00,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:32:00,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:32:00,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 41 letters. [2022-02-21 04:32:00,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 41 letters. [2022-02-21 04:32:00,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 41 letters. [2022-02-21 04:32:00,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:32:00,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:32:00,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 41 letters. [2022-02-21 04:32:00,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 41 letters. [2022-02-21 04:32:00,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 41 letters. [2022-02-21 04:32:00,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:32:00,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:32:00,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:32:00,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:32:00,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:32:00,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:32:00,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:32:00,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:32:00,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:32:00,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:32:00,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:32:00,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:32:00,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 41 letters. [2022-02-21 04:32:00,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 41 letters. [2022-02-21 04:32:00,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 41 letters. [2022-02-21 04:32:00,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:32:00,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:32:00,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:32:00,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:32:00,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:32:00,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:32:00,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:32:00,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:32:00,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:32:00,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:32:00,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:32:00,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:32:00,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:32:00,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:32:00,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:32:00,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:32:00,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:32:00,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:32:00,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:32:00,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:32:00,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:32:00,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:32:00,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:32:00,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:32:00,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:32:00,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:32:00,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:32:00,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:32:00,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:32:00,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:32:00,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:32:00,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:32:00,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:32:00,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:32:00,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:32:00,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:32:00,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:32:00,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:32:00,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:32:00,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:32:00,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 41 letters. [2022-02-21 04:32:00,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 41 letters. [2022-02-21 04:32:00,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 41 letters. [2022-02-21 04:32:00,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 41 letters. [2022-02-21 04:32:00,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 41 letters. [2022-02-21 04:32:00,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 41 letters. [2022-02-21 04:32:00,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:32:00,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:32:00,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 41 letters. [2022-02-21 04:32:00,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 41 letters. [2022-02-21 04:32:00,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 41 letters. [2022-02-21 04:32:00,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:32:00,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:32:00,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:32:00,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:32:00,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:32:00,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:32:00,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:32:00,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:32:00,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:32:00,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:32:00,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 41 letters. [2022-02-21 04:32:00,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 41 letters. [2022-02-21 04:32:00,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 41 letters. [2022-02-21 04:32:00,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:32:00,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:32:00,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 41 letters. [2022-02-21 04:32:00,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 41 letters. [2022-02-21 04:32:00,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 41 letters. [2022-02-21 04:32:00,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:00,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:00,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:32:00,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:32:00,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:32:00,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:32:00,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:32:00,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:32:00,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 41 letters. [2022-02-21 04:32:00,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 41 letters. [2022-02-21 04:32:00,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 41 letters. [2022-02-21 04:32:00,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 41 letters. [2022-02-21 04:32:00,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 41 letters. [2022-02-21 04:32:00,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 41 letters. [2022-02-21 04:32:00,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:32:00,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:32:00,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:00,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:00,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:32:00,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:32:00,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:32:00,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:32:00,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:32:00,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:32:00,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:32:00,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:32:00,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:32:00,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:32:00,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:32:00,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:32:00,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:32:00,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:32:00,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 56 letters. Loop has 35 letters. [2022-02-21 04:32:00,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 56 letters. Loop has 35 letters. [2022-02-21 04:32:00,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 89 letters. Loop has 35 letters. [2022-02-21 04:32:00,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 89 letters. Loop has 35 letters. [2022-02-21 04:32:00,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 88 letters. Loop has 35 letters. [2022-02-21 04:32:00,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 88 letters. Loop has 35 letters. [2022-02-21 04:32:00,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:32:00,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:32:00,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 86 letters. Loop has 35 letters. [2022-02-21 04:32:00,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 86 letters. Loop has 35 letters. [2022-02-21 04:32:00,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 414 states and 718 transitions. cyclomatic complexity: 305 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:32:00,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:32:00,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 631 states and 1074 transitions. cyclomatic complexity: 444 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:32:00,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,598 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:32:00,599 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:32:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2022-02-21 04:32:00,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 564 transitions. Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:32:00,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 564 transitions. Stem has 90 letters. Loop has 35 letters. [2022-02-21 04:32:00,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 564 transitions. Stem has 55 letters. Loop has 70 letters. [2022-02-21 04:32:00,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:00,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 631 states and 1074 transitions. cyclomatic complexity: 444 [2022-02-21 04:32:00,615 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:32:00,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 631 states to 0 states and 0 transitions. [2022-02-21 04:32:00,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:32:00,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:32:00,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:32:00,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:32:00,616 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:32:00,616 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:32:00,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:32:00,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:32:00,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:32:00,617 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:32:00,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:32:00,618 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:32:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:32:00,618 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:32:00,654 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:32:00,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:32:00,655 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:32:00,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:32:00,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:32:00,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:32:00,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:32:00,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:32:00,655 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:32:00,655 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:32:00,655 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:32:00,656 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:32:00,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:32:00,656 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:32:00,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:32:00,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:32:00 BoogieIcfgContainer [2022-02-21 04:32:00,660 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:32:00,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:32:00,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:32:00,661 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:32:00,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:52" (3/4) ... [2022-02-21 04:32:00,667 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:32:00,667 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:32:00,670 INFO L158 Benchmark]: Toolchain (without parser) took 9393.23ms. Allocated memory was 88.1MB in the beginning and 184.5MB in the end (delta: 96.5MB). Free memory was 53.1MB in the beginning and 87.9MB in the end (delta: -34.9MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2022-02-21 04:32:00,672 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 58.8MB in the beginning and 58.8MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:32:00,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.28ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 52.9MB in the beginning and 74.5MB in the end (delta: -21.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-21 04:32:00,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.61ms. Allocated memory is still 115.3MB. Free memory was 74.5MB in the beginning and 67.8MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:32:00,673 INFO L158 Benchmark]: Boogie Preprocessor took 67.75ms. Allocated memory is still 115.3MB. Free memory was 67.8MB in the beginning and 90.9MB in the end (delta: -23.1MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2022-02-21 04:32:00,673 INFO L158 Benchmark]: RCFGBuilder took 939.70ms. Allocated memory is still 115.3MB. Free memory was 90.9MB in the beginning and 77.5MB in the end (delta: 13.4MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2022-02-21 04:32:00,673 INFO L158 Benchmark]: BuchiAutomizer took 7845.15ms. Allocated memory was 115.3MB in the beginning and 184.5MB in the end (delta: 69.2MB). Free memory was 77.5MB in the beginning and 89.0MB in the end (delta: -11.5MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2022-02-21 04:32:00,673 INFO L158 Benchmark]: Witness Printer took 6.05ms. Allocated memory is still 184.5MB. Free memory was 89.0MB in the beginning and 87.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:32:00,675 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 88.1MB. Free memory was 58.8MB in the beginning and 58.8MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.28ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 52.9MB in the beginning and 74.5MB in the end (delta: -21.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.61ms. Allocated memory is still 115.3MB. Free memory was 74.5MB in the beginning and 67.8MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.75ms. Allocated memory is still 115.3MB. Free memory was 67.8MB in the beginning and 90.9MB in the end (delta: -23.1MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * RCFGBuilder took 939.70ms. Allocated memory is still 115.3MB. Free memory was 90.9MB in the beginning and 77.5MB in the end (delta: 13.4MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 7845.15ms. Allocated memory was 115.3MB in the beginning and 184.5MB in the end (delta: 69.2MB). Free memory was 77.5MB in the beginning and 89.0MB in the end (delta: -11.5MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * Witness Printer took 6.05ms. Allocated memory is still 184.5MB. Free memory was 89.0MB in the beginning and 87.9MB 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.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. Construction of modules took 0.0s. Büchi inclusion checks took 3.0s. 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 414 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 702 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 702 mSDsluCounter, 4158 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2459 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1699 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital205 mio100 ax100 hnf100 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:32:00,702 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