./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.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 77bdf1fd1feb16a304959a2005739d40d4ccd53f6bcac88343734528a26d2146 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:27:28,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:27:28,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:27:28,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:27:28,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:27:28,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:27:28,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:27:28,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:27:28,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:27:28,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:27:28,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:27:28,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:27:28,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:27:28,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:27:28,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:27:28,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:27:28,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:27:28,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:27:28,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:27:28,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:27:28,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:27:28,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:27:28,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:27:28,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:27:28,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:27:28,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:27:28,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:27:28,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:27:28,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:27:28,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:27:28,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:27:28,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:27:28,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:27:28,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:27:28,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:27:28,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:27:28,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:27:28,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:27:28,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:27:28,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:27:28,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:27:28,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:27:28,723 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:27:28,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:27:28,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:27:28,724 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:27:28,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:27:28,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:27:28,726 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:27:28,726 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:27:28,726 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:27:28,726 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:27:28,727 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:27:28,727 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:27:28,727 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:27:28,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:27:28,728 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:27:28,728 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:27:28,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:27:28,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:27:28,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:27:28,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:27:28,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:27:28,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:27:28,729 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:27:28,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:27:28,729 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:27:28,729 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:27:28,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:27:28,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:27:28,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:27:28,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:27:28,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:27:28,731 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:27:28,731 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 -> 77bdf1fd1feb16a304959a2005739d40d4ccd53f6bcac88343734528a26d2146 [2022-02-21 04:27:28,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:27:28,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:27:28,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:27:28,937 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:27:28,939 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:27:28,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c [2022-02-21 04:27:28,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ca69e2f/4dc1a6878ac54208b8a54b10bfdf67cb/FLAG39dcdef2a [2022-02-21 04:27:29,460 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:27:29,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c [2022-02-21 04:27:29,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ca69e2f/4dc1a6878ac54208b8a54b10bfdf67cb/FLAG39dcdef2a [2022-02-21 04:27:29,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ca69e2f/4dc1a6878ac54208b8a54b10bfdf67cb [2022-02-21 04:27:29,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:27:29,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:27:29,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:27:29,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:27:29,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:27:29,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:27:29" (1/1) ... [2022-02-21 04:27:29,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4127be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:29, skipping insertion in model container [2022-02-21 04:27:29,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:27:29" (1/1) ... [2022-02-21 04:27:29,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:27:29,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:27:29,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c[60917,60930] [2022-02-21 04:27:29,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:27:29,896 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:27:30,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c[60917,60930] [2022-02-21 04:27:30,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:27:30,030 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:27:30,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:30 WrapperNode [2022-02-21 04:27:30,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:27:30,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:27:30,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:27:30,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:27:30,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:30" (1/1) ... [2022-02-21 04:27:30,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:30" (1/1) ... [2022-02-21 04:27:30,148 INFO L137 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 2019 [2022-02-21 04:27:30,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:27:30,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:27:30,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:27:30,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:27:30,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:30" (1/1) ... [2022-02-21 04:27:30,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:30" (1/1) ... [2022-02-21 04:27:30,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:30" (1/1) ... [2022-02-21 04:27:30,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:30" (1/1) ... [2022-02-21 04:27:30,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:30" (1/1) ... [2022-02-21 04:27:30,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:30" (1/1) ... [2022-02-21 04:27:30,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:30" (1/1) ... [2022-02-21 04:27:30,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:27:30,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:27:30,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:27:30,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:27:30,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:30" (1/1) ... [2022-02-21 04:27:30,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:30,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:30,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:30,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:27:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:27:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:27:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:27:30,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:27:30,488 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:27:30,500 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:27:31,669 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:27:31,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:27:31,685 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:27:31,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:27:31 BoogieIcfgContainer [2022-02-21 04:27:31,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:27:31,696 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:27:31,696 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:27:31,698 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:27:31,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:27:31,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:27:29" (1/3) ... [2022-02-21 04:27:31,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73c5f0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:27:31, skipping insertion in model container [2022-02-21 04:27:31,700 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:27:31,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:30" (2/3) ... [2022-02-21 04:27:31,701 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73c5f0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:27:31, skipping insertion in model container [2022-02-21 04:27:31,701 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:27:31,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:27:31" (3/3) ... [2022-02-21 04:27:31,702 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.BOUNDED-10.pals.c [2022-02-21 04:27:31,744 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:27:31,745 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:27:31,745 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:27:31,745 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:27:31,745 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:27:31,745 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:27:31,745 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:27:31,745 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:27:31,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 705 states, 704 states have (on average 1.8494318181818181) internal successors, (1302), 704 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:31,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 155 [2022-02-21 04:27:31,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:31,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:31,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:31,917 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] [2022-02-21 04:27:31,917 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:27:31,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 705 states, 704 states have (on average 1.8494318181818181) internal successors, (1302), 704 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:31,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 155 [2022-02-21 04:27:31,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:31,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:31,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:31,982 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] [2022-02-21 04:27:31,995 INFO L791 eck$LassoCheckResult]: Stem: 691#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; 588#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; 365#L623true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 67#L642true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 353#L652true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 509#L671true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 621#L681true assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 439#L700true init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 96#L710true assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; 217#L729true init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 360#L739true assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; 489#L758true init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 15#L768true assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; 343#L787true init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 293#L797true assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; 624#L816true init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 425#L826true assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; 512#L845true init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 378#L855true assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; 283#L874true init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 572#L884true assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; 319#L903true init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 158#L913true assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; 465#L932true init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 664#L942true assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; 214#L961true init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 276#L971true assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; 133#L990true init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 494#L1000true assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; 640#L1019true init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 705#L1029true assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; 225#L1048true init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 211#L1058true assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; 208#L1077true init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 178#L1087true assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; 637#L1106true init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 311#L1116true assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; 389#L1135true init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 700#L1145true assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; 316#L1164true init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 391#L1174true assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; 268#L1193true init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 562#L1203true assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; 218#L1222true init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 549#L1232true assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; 258#L1251true init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 288#L1261true assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; 267#L1280true init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 362#L1290true assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; 672#L1309true init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 339#L1319true assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; 249#L1338true init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); 220#L1348true assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; 449#L1367true init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); 651#L1377true assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; 93#L1396true init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); 652#L1406true assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; 500#L1425true init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); 475#L1435true assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; 274#L1454true init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); 680#L1464true assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; 531#L1483true init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); 677#L1493true assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; 140#L1512true init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); 681#L1522true assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; 60#L1541true init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); 294#L1551true assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; 90#L1570true init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); 459#L1580true assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; 166#L1599true init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); 32#L1609true assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; 655#L1628true init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); 234#L1638true assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; 135#L1657true init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); 300#L1667true assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; 227#L1686true init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); 414#L1696true assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; 404#L1715true init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); 239#L1725true assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; 460#L1744true init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); 607#L1754true assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; 221#L1773true init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); 240#L1783true assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; 584#L1802true init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); 393#L1812true assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; 550#L1831true init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); 115#L1841true assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; 577#L1860true init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); 88#L1870true assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; 670#L1889true init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); 215#L1899true assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; 629#L1918true init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); 213#L1928true assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; 433#L1947true init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); 662#L1957true assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; 697#L1976true init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); 192#L1986true assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; 222#L2005true init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); 614#L2015true assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; 472#L2034true init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); 641#L2044true assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; 291#L2063true init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); 252#L2073true assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; 216#L2092true init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); 125#L2102true assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; 296#L2121true init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); 175#L2131true assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; 570#L2150true init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); 207#L2160true assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; 55#L2179true init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); 599#L2189true assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; 591#L2208true init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); 255#L2218true assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; 356#L2237true init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); 514#L2247true assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; 426#L2266true init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); 102#L2276true assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; 406#L2295true init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); 219#L2305true assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; 202#L2324true init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); 347#L2334true assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; 23#L2353true init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); 505#L2363true assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; 479#L2363-1true init_#res#1 := init_~tmp___59~0#1; 532#L2604true main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; 490#L21true assume !(0 == assume_abort_if_not_~cond#1); 197#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 421#L2776-2true [2022-02-21 04:27:32,004 INFO L793 eck$LassoCheckResult]: Loop: 421#L2776-2true assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1; 408#L148true assume !(0 != ~mode1~0 % 256); 516#L187true assume !(~r1~0 < 4); 660#L187-1true ~mode1~0 := 1; 415#L148-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1; 321#L211true assume !(0 != ~mode2~0 % 256); 303#L250true assume !(~r2~0 < 4); 485#L250-1true ~mode2~0 := 1; 116#L211-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1; 123#L274true assume !(0 != ~mode3~0 % 256); 39#L313true assume !(~r3~0 < 4); 162#L313-1true ~mode3~0 := 1; 350#L274-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1; 277#L337true assume !(0 != ~mode4~0 % 256); 551#L376true assume !(~r4~0 < 4); 91#L376-1true ~mode4~0 := 1; 164#L337-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1; 456#L400true assume !(0 != ~mode5~0 % 256); 244#L439true assume !(~r5~0 < 4); 594#L439-1true ~mode5~0 := 1; 145#L400-2true assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 349#L2612true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 305#L2612-1true check_#res#1 := check_~tmp~1#1; 325#L2668true main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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; 307#L2836true assume !(0 == assert_~arg#1 % 256); 508#L2831true assume { :end_inline_assert } true;main_#t~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1; 421#L2776-2true [2022-02-21 04:27:32,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:32,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1593308194, now seen corresponding path program 1 times [2022-02-21 04:27:32,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:32,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638830684] [2022-02-21 04:27:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:32,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:32,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {709#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; {709#true} is VALID [2022-02-21 04:27:32,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {709#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; {709#true} is VALID [2022-02-21 04:27:32,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {709#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {709#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,461 INFO L290 TraceCheckUtils]: 4: Hoare triple {709#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {709#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {709#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {709#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {709#true} assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#true} init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#true} init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {709#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {709#true} init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {709#true} init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {709#true} assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {709#true} init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {709#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {709#true} init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {709#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {709#true} init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {709#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {709#true} init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {709#true} assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {709#true} init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {709#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {709#true} init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {709#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {709#true} init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {709#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {709#true} init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {709#true} assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {709#true} init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {709#true} assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {709#true} init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {709#true} assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {709#true} init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {709#true} assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {709#true} init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {709#true} assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {709#true} init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {709#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {709#true} init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {709#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {709#true} init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {709#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,472 INFO L290 TraceCheckUtils]: 47: Hoare triple {709#true} init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {709#true} assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,473 INFO L290 TraceCheckUtils]: 49: Hoare triple {709#true} init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {709#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,475 INFO L290 TraceCheckUtils]: 51: Hoare triple {709#true} init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,476 INFO L290 TraceCheckUtils]: 52: Hoare triple {709#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,476 INFO L290 TraceCheckUtils]: 53: Hoare triple {709#true} init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,476 INFO L290 TraceCheckUtils]: 54: Hoare triple {709#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,478 INFO L290 TraceCheckUtils]: 55: Hoare triple {709#true} init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,478 INFO L290 TraceCheckUtils]: 56: Hoare triple {709#true} assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,478 INFO L290 TraceCheckUtils]: 57: Hoare triple {709#true} init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,478 INFO L290 TraceCheckUtils]: 58: Hoare triple {709#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,479 INFO L290 TraceCheckUtils]: 59: Hoare triple {709#true} init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,479 INFO L290 TraceCheckUtils]: 60: Hoare triple {709#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,480 INFO L290 TraceCheckUtils]: 61: Hoare triple {709#true} init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,480 INFO L290 TraceCheckUtils]: 62: Hoare triple {709#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,480 INFO L290 TraceCheckUtils]: 63: Hoare triple {709#true} init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,481 INFO L290 TraceCheckUtils]: 64: Hoare triple {709#true} assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,482 INFO L290 TraceCheckUtils]: 65: Hoare triple {709#true} init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,483 INFO L290 TraceCheckUtils]: 66: Hoare triple {709#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,483 INFO L290 TraceCheckUtils]: 67: Hoare triple {709#true} init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,483 INFO L290 TraceCheckUtils]: 68: Hoare triple {709#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,483 INFO L290 TraceCheckUtils]: 69: Hoare triple {709#true} init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,484 INFO L290 TraceCheckUtils]: 70: Hoare triple {709#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,484 INFO L290 TraceCheckUtils]: 71: Hoare triple {709#true} init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,484 INFO L290 TraceCheckUtils]: 72: Hoare triple {709#true} assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,484 INFO L290 TraceCheckUtils]: 73: Hoare triple {709#true} init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,488 INFO L290 TraceCheckUtils]: 74: Hoare triple {709#true} assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,489 INFO L290 TraceCheckUtils]: 75: Hoare triple {709#true} init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,489 INFO L290 TraceCheckUtils]: 76: Hoare triple {709#true} assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,489 INFO L290 TraceCheckUtils]: 77: Hoare triple {709#true} init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,489 INFO L290 TraceCheckUtils]: 78: Hoare triple {709#true} assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,490 INFO L290 TraceCheckUtils]: 79: Hoare triple {709#true} init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,490 INFO L290 TraceCheckUtils]: 80: Hoare triple {709#true} assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,490 INFO L290 TraceCheckUtils]: 81: Hoare triple {709#true} init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,490 INFO L290 TraceCheckUtils]: 82: Hoare triple {709#true} assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,490 INFO L290 TraceCheckUtils]: 83: Hoare triple {709#true} init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,491 INFO L290 TraceCheckUtils]: 84: Hoare triple {709#true} assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,491 INFO L290 TraceCheckUtils]: 85: Hoare triple {709#true} init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,491 INFO L290 TraceCheckUtils]: 86: Hoare triple {709#true} assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,491 INFO L290 TraceCheckUtils]: 87: Hoare triple {709#true} init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,491 INFO L290 TraceCheckUtils]: 88: Hoare triple {709#true} assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,491 INFO L290 TraceCheckUtils]: 89: Hoare triple {709#true} init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,492 INFO L290 TraceCheckUtils]: 90: Hoare triple {709#true} assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,492 INFO L290 TraceCheckUtils]: 91: Hoare triple {709#true} init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,492 INFO L290 TraceCheckUtils]: 92: Hoare triple {709#true} assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,492 INFO L290 TraceCheckUtils]: 93: Hoare triple {709#true} init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,493 INFO L290 TraceCheckUtils]: 94: Hoare triple {709#true} assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,493 INFO L290 TraceCheckUtils]: 95: Hoare triple {709#true} init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,493 INFO L290 TraceCheckUtils]: 96: Hoare triple {709#true} assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,493 INFO L290 TraceCheckUtils]: 97: Hoare triple {709#true} init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,494 INFO L290 TraceCheckUtils]: 98: Hoare triple {709#true} assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,494 INFO L290 TraceCheckUtils]: 99: Hoare triple {709#true} init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,494 INFO L290 TraceCheckUtils]: 100: Hoare triple {709#true} assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,494 INFO L290 TraceCheckUtils]: 101: Hoare triple {709#true} init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,494 INFO L290 TraceCheckUtils]: 102: Hoare triple {709#true} assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,495 INFO L290 TraceCheckUtils]: 103: Hoare triple {709#true} init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,495 INFO L290 TraceCheckUtils]: 104: Hoare triple {709#true} assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,495 INFO L290 TraceCheckUtils]: 105: Hoare triple {709#true} init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,497 INFO L290 TraceCheckUtils]: 106: Hoare triple {709#true} assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,497 INFO L290 TraceCheckUtils]: 107: Hoare triple {709#true} init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,497 INFO L290 TraceCheckUtils]: 108: Hoare triple {709#true} assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,497 INFO L290 TraceCheckUtils]: 109: Hoare triple {709#true} init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,498 INFO L290 TraceCheckUtils]: 110: Hoare triple {709#true} assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,498 INFO L290 TraceCheckUtils]: 111: Hoare triple {709#true} init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,498 INFO L290 TraceCheckUtils]: 112: Hoare triple {709#true} assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,498 INFO L290 TraceCheckUtils]: 113: Hoare triple {709#true} init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,499 INFO L290 TraceCheckUtils]: 114: Hoare triple {709#true} assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,499 INFO L290 TraceCheckUtils]: 115: Hoare triple {709#true} init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,500 INFO L290 TraceCheckUtils]: 116: Hoare triple {709#true} assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,501 INFO L290 TraceCheckUtils]: 117: Hoare triple {709#true} init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,501 INFO L290 TraceCheckUtils]: 118: Hoare triple {709#true} assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,507 INFO L290 TraceCheckUtils]: 119: Hoare triple {709#true} init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,509 INFO L290 TraceCheckUtils]: 120: Hoare triple {709#true} assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:32,510 INFO L290 TraceCheckUtils]: 121: Hoare triple {709#true} init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:32,511 INFO L290 TraceCheckUtils]: 122: Hoare triple {709#true} assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; {711#(= |ULTIMATE.start_init_~tmp___59~0#1| 0)} is VALID [2022-02-21 04:27:32,511 INFO L290 TraceCheckUtils]: 123: Hoare triple {711#(= |ULTIMATE.start_init_~tmp___59~0#1| 0)} init_#res#1 := init_~tmp___59~0#1; {712#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:27:32,512 INFO L290 TraceCheckUtils]: 124: Hoare triple {712#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; {713#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:27:32,512 INFO L290 TraceCheckUtils]: 125: Hoare triple {713#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {710#false} is VALID [2022-02-21 04:27:32,513 INFO L290 TraceCheckUtils]: 126: Hoare triple {710#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {710#false} is VALID [2022-02-21 04:27:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:27:32,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:32,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638830684] [2022-02-21 04:27:32,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638830684] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:32,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:32,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:32,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279087576] [2022-02-21 04:27:32,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:32,524 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:27:32,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash -679733109, now seen corresponding path program 1 times [2022-02-21 04:27:32,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:32,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866110348] [2022-02-21 04:27:32,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:32,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:32,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {714#true} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1; {714#true} is VALID [2022-02-21 04:27:32,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {714#true} assume !(0 != ~mode1~0 % 256); {714#true} is VALID [2022-02-21 04:27:32,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {714#true} assume !(~r1~0 < 4); {714#true} is VALID [2022-02-21 04:27:32,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {714#true} ~mode1~0 := 1; {714#true} is VALID [2022-02-21 04:27:32,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {714#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1; {714#true} is VALID [2022-02-21 04:27:32,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {714#true} assume !(0 != ~mode2~0 % 256); {714#true} is VALID [2022-02-21 04:27:32,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {714#true} assume !(~r2~0 < 4); {714#true} is VALID [2022-02-21 04:27:32,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {714#true} ~mode2~0 := 1; {714#true} is VALID [2022-02-21 04:27:32,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {714#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1; {714#true} is VALID [2022-02-21 04:27:32,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {714#true} assume !(0 != ~mode3~0 % 256); {714#true} is VALID [2022-02-21 04:27:32,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {714#true} assume !(~r3~0 < 4); {714#true} is VALID [2022-02-21 04:27:32,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {714#true} ~mode3~0 := 1; {714#true} is VALID [2022-02-21 04:27:32,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {714#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1; {714#true} is VALID [2022-02-21 04:27:32,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {714#true} assume !(0 != ~mode4~0 % 256); {714#true} is VALID [2022-02-21 04:27:32,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {714#true} assume !(~r4~0 < 4); {714#true} is VALID [2022-02-21 04:27:32,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {714#true} ~mode4~0 := 1; {714#true} is VALID [2022-02-21 04:27:32,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {714#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1; {714#true} is VALID [2022-02-21 04:27:32,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {714#true} assume !(0 != ~mode5~0 % 256); {714#true} is VALID [2022-02-21 04:27:32,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {714#true} assume !(~r5~0 < 4); {714#true} is VALID [2022-02-21 04:27:32,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {714#true} ~mode5~0 := 1; {714#true} is VALID [2022-02-21 04:27:32,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {714#true} assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {714#true} is VALID [2022-02-21 04:27:32,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {714#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {716#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:27:32,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {716#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {717#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:27:32,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {717#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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; {718#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:27:32,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {718#(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); {715#false} is VALID [2022-02-21 04:27:32,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {715#false} assume { :end_inline_assert } true;main_#t~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1; {715#false} is VALID [2022-02-21 04:27:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:27:32,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:32,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866110348] [2022-02-21 04:27:32,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866110348] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:32,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:32,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:32,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621452016] [2022-02-21 04:27:32,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:32,662 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:27:32,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:27:32,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:27:32,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:27:32,694 INFO L87 Difference]: Start difference. First operand has 705 states, 704 states have (on average 1.8494318181818181) internal successors, (1302), 704 states have internal predecessors, (1302), 0 states have call successors, (0), 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 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:34,829 INFO L93 Difference]: Finished difference Result 709 states and 1302 transitions. [2022-02-21 04:27:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:27:34,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:34,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:27:34,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 709 states and 1302 transitions. [2022-02-21 04:27:34,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 154 [2022-02-21 04:27:34,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 709 states to 700 states and 1284 transitions. [2022-02-21 04:27:34,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 700 [2022-02-21 04:27:34,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 700 [2022-02-21 04:27:34,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 700 states and 1284 transitions. [2022-02-21 04:27:34,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:34,907 INFO L681 BuchiCegarLoop]: Abstraction has 700 states and 1284 transitions. [2022-02-21 04:27:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states and 1284 transitions. [2022-02-21 04:27:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2022-02-21 04:27:34,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:27:34,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 700 states and 1284 transitions. Second operand has 700 states, 700 states have (on average 1.8342857142857143) internal successors, (1284), 699 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:34,975 INFO L74 IsIncluded]: Start isIncluded. First operand 700 states and 1284 transitions. Second operand has 700 states, 700 states have (on average 1.8342857142857143) internal successors, (1284), 699 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:34,977 INFO L87 Difference]: Start difference. First operand 700 states and 1284 transitions. Second operand has 700 states, 700 states have (on average 1.8342857142857143) internal successors, (1284), 699 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:34,999 INFO L93 Difference]: Finished difference Result 700 states and 1284 transitions. [2022-02-21 04:27:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1284 transitions. [2022-02-21 04:27:35,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:35,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:35,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 700 states, 700 states have (on average 1.8342857142857143) internal successors, (1284), 699 states have internal predecessors, (1284), 0 states have call successors, (0), 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 700 states and 1284 transitions. [2022-02-21 04:27:35,005 INFO L87 Difference]: Start difference. First operand has 700 states, 700 states have (on average 1.8342857142857143) internal successors, (1284), 699 states have internal predecessors, (1284), 0 states have call successors, (0), 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 700 states and 1284 transitions. [2022-02-21 04:27:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:35,022 INFO L93 Difference]: Finished difference Result 700 states and 1284 transitions. [2022-02-21 04:27:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1284 transitions. [2022-02-21 04:27:35,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:35,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:35,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:27:35,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:27:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 700 states have (on average 1.8342857142857143) internal successors, (1284), 699 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1284 transitions. [2022-02-21 04:27:35,043 INFO L704 BuchiCegarLoop]: Abstraction has 700 states and 1284 transitions. [2022-02-21 04:27:35,043 INFO L587 BuchiCegarLoop]: Abstraction has 700 states and 1284 transitions. [2022-02-21 04:27:35,043 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:27:35,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 700 states and 1284 transitions. [2022-02-21 04:27:35,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 154 [2022-02-21 04:27:35,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:35,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:35,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:35,048 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:35,049 INFO L791 eck$LassoCheckResult]: Stem: 2131#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; 2116#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; 2001#L623 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1523#L642 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 1589#L652 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1994#L671 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 2096#L681 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 1859#L700 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 1648#L710 assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; 1635#L729 init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 1848#L739 assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; 1520#L758 init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1467#L768 assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; 1468#L787 init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1942#L797 assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; 1616#L816 init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 2046#L826 assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; 1666#L845 init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 2015#L855 assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; 1477#L874 init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 1934#L884 assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; 1506#L903 init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 1765#L913 assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; 1452#L932 init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 2069#L942 assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; 1844#L961 init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 1845#L971 assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; 1475#L990 init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 1721#L1000 assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; 1770#L1019 init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 2128#L1029 assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; 1628#L1048 init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 1839#L1058 assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; 1484#L1077 init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 1791#L1087 assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; 1631#L1106 init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 1960#L1116 assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; 1610#L1135 init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 2023#L1145 assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; 1479#L1164 init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 1968#L1174 assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; 1594#L1193 init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 1921#L1203 assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; 1673#L1222 init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 1849#L1232 assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; 1910#L1251 init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 1911#L1261 assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; 1892#L1280 init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 1920#L1290 assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; 1671#L1309 init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 1988#L1319 assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; 1753#L1338 init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); 1853#L1348 assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; 1542#L1367 init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); 2062#L1377 assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; 1598#L1396 init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); 1642#L1406 assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; 1741#L1425 init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); 2078#L1435 assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; 1543#L1454 init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); 1925#L1464 assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; 1826#L1483 init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); 2104#L1493 assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; 1732#L1512 init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); 1733#L1522 assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; 1442#L1541 init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); 1573#L1551 assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; 1638#L1570 init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); 1639#L1580 assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; 1777#L1599 init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); 1508#L1609 assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; 1509#L1628 init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); 1868#L1638 assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; 1446#L1657 init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); 1727#L1667 assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; 1618#L1686 init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); 1860#L1696 assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; 1819#L1715 init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); 1882#L1725 assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; 1883#L1744 init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); 2067#L1754 assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; 1851#L1773 init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); 1852#L1783 assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; 1534#L1802 init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); 2026#L1812 assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; 1933#L1831 init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); 1688#L1841 assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; 1575#L1860 init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); 1625#L1870 assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; 1626#L1889 init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); 1846#L1899 assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; 1537#L1918 init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); 1842#L1928 assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; 1843#L1947 init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); 2052#L1957 assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; 2093#L1976 init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); 1814#L1986 assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; 1701#L2005 init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); 1854#L2015 assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; 1602#L2034 init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); 2074#L2044 assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; 1554#L2063 init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); 1898#L2073 assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; 1712#L2092 init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); 1703#L2102 assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; 1591#L2121 init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); 1787#L2131 assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; 1551#L2150 init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); 1836#L2160 assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; 1561#L2179 init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); 1562#L2189 assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; 1838#L2208 init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); 1906#L2218 assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; 1532#L2237 init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); 1996#L2247 assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; 1979#L2266 init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); 1659#L2276 assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; 1661#L2295 init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); 1850#L2305 assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; 1608#L2324 init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); 1829#L2334 assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; 1481#L2353 init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); 1482#L2363 assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; 1434#L2363-1 init_#res#1 := init_~tmp___59~0#1; 2080#L2604 main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; 2085#L21 assume !(0 == assume_abort_if_not_~cond#1); 1822#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1823#L2776-2 [2022-02-21 04:27:35,049 INFO L793 eck$LassoCheckResult]: Loop: 1823#L2776-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1; 2035#L148 assume !(0 != ~mode1~0 % 256); 2036#L187 assume !(~r1~0 < 4); 2008#L187-1 ~mode1~0 := 1; 2034#L148-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1; 1970#L211 assume !(0 != ~mode2~0 % 256); 1949#L250 assume !(~r2~0 < 4); 1950#L250-1 ~mode2~0 := 1; 1690#L211-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1; 1691#L274 assume !(0 != ~mode3~0 % 256); 1525#L313 assume !(~r3~0 < 4); 1526#L313-1 ~mode3~0 := 1; 1771#L274-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1; 1926#L337 assume !(0 != ~mode4~0 % 256); 1927#L376 assume !(~r4~0 < 4); 1636#L376-1 ~mode4~0 := 1; 1637#L337-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1; 1774#L400 assume !(0 != ~mode5~0 % 256); 1888#L439 assume !(~r5~0 < 4); 1889#L439-1 ~mode5~0 := 1; 1742#L400-2 assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1743#L2612 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 1973#L2613 assume ~st1~0 + ~nl1~0 <= 1; 1734#L2614 assume ~st2~0 + ~nl2~0 <= 1; 1465#L2615 assume ~st3~0 + ~nl3~0 <= 1; 1466#L2616 assume ~st4~0 + ~nl4~0 <= 1; 1861#L2617 assume ~st5~0 + ~nl5~0 <= 1; 2000#L2618 assume ~r1~0 >= 4; 1816#L2622 assume ~r1~0 < 4; 1958#L2627 assume ~r1~0 >= 4; 1435#L2632 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 1436#L2612-1 check_#res#1 := check_~tmp~1#1; 1952#L2668 main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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; 1954#L2836 assume !(0 == assert_~arg#1 % 256); 1955#L2831 assume { :end_inline_assert } true;main_#t~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1; 1823#L2776-2 [2022-02-21 04:27:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1593308194, now seen corresponding path program 2 times [2022-02-21 04:27:35,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:35,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897603870] [2022-02-21 04:27:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:35,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:35,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {3535#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; {3535#true} is VALID [2022-02-21 04:27:35,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {3535#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; {3535#true} is VALID [2022-02-21 04:27:35,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {3535#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {3535#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {3535#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {3535#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {3535#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {3535#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {3535#true} assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {3535#true} init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {3535#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {3535#true} init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {3535#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {3535#true} init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {3535#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {3535#true} init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {3535#true} assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {3535#true} init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {3535#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {3535#true} init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {3535#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {3535#true} init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {3535#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {3535#true} init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {3535#true} assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {3535#true} init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {3535#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {3535#true} init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {3535#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {3535#true} init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {3535#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {3535#true} init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {3535#true} assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {3535#true} init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {3535#true} assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {3535#true} init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {3535#true} assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {3535#true} init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {3535#true} assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {3535#true} init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {3535#true} assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {3535#true} init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,134 INFO L290 TraceCheckUtils]: 42: Hoare triple {3535#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {3535#true} init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {3535#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {3535#true} init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {3535#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {3535#true} init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {3535#true} assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {3535#true} init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,136 INFO L290 TraceCheckUtils]: 50: Hoare triple {3535#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {3535#true} init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {3535#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {3535#true} init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,136 INFO L290 TraceCheckUtils]: 54: Hoare triple {3535#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,136 INFO L290 TraceCheckUtils]: 55: Hoare triple {3535#true} init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {3535#true} assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {3535#true} init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,137 INFO L290 TraceCheckUtils]: 58: Hoare triple {3535#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {3535#true} init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,137 INFO L290 TraceCheckUtils]: 60: Hoare triple {3535#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,137 INFO L290 TraceCheckUtils]: 61: Hoare triple {3535#true} init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,137 INFO L290 TraceCheckUtils]: 62: Hoare triple {3535#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,137 INFO L290 TraceCheckUtils]: 63: Hoare triple {3535#true} init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,137 INFO L290 TraceCheckUtils]: 64: Hoare triple {3535#true} assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,138 INFO L290 TraceCheckUtils]: 65: Hoare triple {3535#true} init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,138 INFO L290 TraceCheckUtils]: 66: Hoare triple {3535#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,138 INFO L290 TraceCheckUtils]: 67: Hoare triple {3535#true} init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {3535#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,138 INFO L290 TraceCheckUtils]: 69: Hoare triple {3535#true} init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,138 INFO L290 TraceCheckUtils]: 70: Hoare triple {3535#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,138 INFO L290 TraceCheckUtils]: 71: Hoare triple {3535#true} init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {3535#true} assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,139 INFO L290 TraceCheckUtils]: 73: Hoare triple {3535#true} init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,139 INFO L290 TraceCheckUtils]: 74: Hoare triple {3535#true} assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,139 INFO L290 TraceCheckUtils]: 75: Hoare triple {3535#true} init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,139 INFO L290 TraceCheckUtils]: 76: Hoare triple {3535#true} assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,139 INFO L290 TraceCheckUtils]: 77: Hoare triple {3535#true} init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,139 INFO L290 TraceCheckUtils]: 78: Hoare triple {3535#true} assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,140 INFO L290 TraceCheckUtils]: 79: Hoare triple {3535#true} init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,140 INFO L290 TraceCheckUtils]: 80: Hoare triple {3535#true} assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,140 INFO L290 TraceCheckUtils]: 81: Hoare triple {3535#true} init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,140 INFO L290 TraceCheckUtils]: 82: Hoare triple {3535#true} assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,140 INFO L290 TraceCheckUtils]: 83: Hoare triple {3535#true} init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,140 INFO L290 TraceCheckUtils]: 84: Hoare triple {3535#true} assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,140 INFO L290 TraceCheckUtils]: 85: Hoare triple {3535#true} init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,140 INFO L290 TraceCheckUtils]: 86: Hoare triple {3535#true} assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,141 INFO L290 TraceCheckUtils]: 87: Hoare triple {3535#true} init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,141 INFO L290 TraceCheckUtils]: 88: Hoare triple {3535#true} assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,141 INFO L290 TraceCheckUtils]: 89: Hoare triple {3535#true} init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,141 INFO L290 TraceCheckUtils]: 90: Hoare triple {3535#true} assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,141 INFO L290 TraceCheckUtils]: 91: Hoare triple {3535#true} init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,141 INFO L290 TraceCheckUtils]: 92: Hoare triple {3535#true} assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,141 INFO L290 TraceCheckUtils]: 93: Hoare triple {3535#true} init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,142 INFO L290 TraceCheckUtils]: 94: Hoare triple {3535#true} assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,142 INFO L290 TraceCheckUtils]: 95: Hoare triple {3535#true} init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,142 INFO L290 TraceCheckUtils]: 96: Hoare triple {3535#true} assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,142 INFO L290 TraceCheckUtils]: 97: Hoare triple {3535#true} init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,142 INFO L290 TraceCheckUtils]: 98: Hoare triple {3535#true} assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,142 INFO L290 TraceCheckUtils]: 99: Hoare triple {3535#true} init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,142 INFO L290 TraceCheckUtils]: 100: Hoare triple {3535#true} assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,142 INFO L290 TraceCheckUtils]: 101: Hoare triple {3535#true} init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,143 INFO L290 TraceCheckUtils]: 102: Hoare triple {3535#true} assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,143 INFO L290 TraceCheckUtils]: 103: Hoare triple {3535#true} init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,143 INFO L290 TraceCheckUtils]: 104: Hoare triple {3535#true} assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,143 INFO L290 TraceCheckUtils]: 105: Hoare triple {3535#true} init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,143 INFO L290 TraceCheckUtils]: 106: Hoare triple {3535#true} assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,143 INFO L290 TraceCheckUtils]: 107: Hoare triple {3535#true} init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,143 INFO L290 TraceCheckUtils]: 108: Hoare triple {3535#true} assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,144 INFO L290 TraceCheckUtils]: 109: Hoare triple {3535#true} init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,144 INFO L290 TraceCheckUtils]: 110: Hoare triple {3535#true} assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,144 INFO L290 TraceCheckUtils]: 111: Hoare triple {3535#true} init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,144 INFO L290 TraceCheckUtils]: 112: Hoare triple {3535#true} assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,144 INFO L290 TraceCheckUtils]: 113: Hoare triple {3535#true} init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,144 INFO L290 TraceCheckUtils]: 114: Hoare triple {3535#true} assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,144 INFO L290 TraceCheckUtils]: 115: Hoare triple {3535#true} init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,144 INFO L290 TraceCheckUtils]: 116: Hoare triple {3535#true} assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,145 INFO L290 TraceCheckUtils]: 117: Hoare triple {3535#true} init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,145 INFO L290 TraceCheckUtils]: 118: Hoare triple {3535#true} assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,145 INFO L290 TraceCheckUtils]: 119: Hoare triple {3535#true} init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,145 INFO L290 TraceCheckUtils]: 120: Hoare triple {3535#true} assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:35,145 INFO L290 TraceCheckUtils]: 121: Hoare triple {3535#true} init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:35,146 INFO L290 TraceCheckUtils]: 122: Hoare triple {3535#true} assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; {3537#(= |ULTIMATE.start_init_~tmp___59~0#1| 0)} is VALID [2022-02-21 04:27:35,146 INFO L290 TraceCheckUtils]: 123: Hoare triple {3537#(= |ULTIMATE.start_init_~tmp___59~0#1| 0)} init_#res#1 := init_~tmp___59~0#1; {3538#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:27:35,146 INFO L290 TraceCheckUtils]: 124: Hoare triple {3538#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; {3539#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:27:35,147 INFO L290 TraceCheckUtils]: 125: Hoare triple {3539#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {3536#false} is VALID [2022-02-21 04:27:35,147 INFO L290 TraceCheckUtils]: 126: Hoare triple {3536#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3536#false} is VALID [2022-02-21 04:27:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:27:35,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:35,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897603870] [2022-02-21 04:27:35,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897603870] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:35,148 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:35,148 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:35,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688630739] [2022-02-21 04:27:35,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:35,148 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:27:35,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:35,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1856582015, now seen corresponding path program 1 times [2022-02-21 04:27:35,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:35,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198317753] [2022-02-21 04:27:35,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:35,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:35,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {3540#true} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1; {3540#true} is VALID [2022-02-21 04:27:35,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {3540#true} assume !(0 != ~mode1~0 % 256); {3540#true} is VALID [2022-02-21 04:27:35,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {3540#true} assume !(~r1~0 < 4); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,185 INFO L290 TraceCheckUtils]: 3: Hoare triple {3542#(not (<= ~r1~0 3))} ~mode1~0 := 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,185 INFO L290 TraceCheckUtils]: 4: Hoare triple {3542#(not (<= ~r1~0 3))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(0 != ~mode2~0 % 256); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(~r2~0 < 4); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {3542#(not (<= ~r1~0 3))} ~mode2~0 := 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {3542#(not (<= ~r1~0 3))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(0 != ~mode3~0 % 256); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(~r3~0 < 4); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {3542#(not (<= ~r1~0 3))} ~mode3~0 := 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {3542#(not (<= ~r1~0 3))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(0 != ~mode4~0 % 256); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(~r4~0 < 4); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {3542#(not (<= ~r1~0 3))} ~mode4~0 := 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {3542#(not (<= ~r1~0 3))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(0 != ~mode5~0 % 256); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(~r5~0 < 4); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {3542#(not (<= ~r1~0 3))} ~mode5~0 := 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {3542#(not (<= ~r1~0 3))} assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~st1~0 + ~nl1~0 <= 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~st2~0 + ~nl2~0 <= 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~st3~0 + ~nl3~0 <= 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~st4~0 + ~nl4~0 <= 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~st5~0 + ~nl5~0 <= 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~r1~0 >= 4; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:35,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~r1~0 < 4; {3541#false} is VALID [2022-02-21 04:27:35,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {3541#false} assume ~r1~0 >= 4; {3541#false} is VALID [2022-02-21 04:27:35,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {3541#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {3541#false} is VALID [2022-02-21 04:27:35,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {3541#false} check_#res#1 := check_~tmp~1#1; {3541#false} is VALID [2022-02-21 04:27:35,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {3541#false} main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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; {3541#false} is VALID [2022-02-21 04:27:35,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {3541#false} assume !(0 == assert_~arg#1 % 256); {3541#false} is VALID [2022-02-21 04:27:35,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {3541#false} assume { :end_inline_assert } true;main_#t~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1; {3541#false} is VALID [2022-02-21 04:27:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:27:35,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:35,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198317753] [2022-02-21 04:27:35,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198317753] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:35,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:35,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:27:35,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313509509] [2022-02-21 04:27:35,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:35,196 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:27:35,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:27:35,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:27:35,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:27:35,197 INFO L87 Difference]: Start difference. First operand 700 states and 1284 transitions. cyclomatic complexity: 585 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:36,129 INFO L93 Difference]: Finished difference Result 827 states and 1492 transitions. [2022-02-21 04:27:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:27:36,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:36,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:27:36,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 827 states and 1492 transitions. [2022-02-21 04:27:36,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 281 [2022-02-21 04:27:36,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 827 states to 827 states and 1492 transitions. [2022-02-21 04:27:36,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 827 [2022-02-21 04:27:36,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 827 [2022-02-21 04:27:36,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 827 states and 1492 transitions. [2022-02-21 04:27:36,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:36,201 INFO L681 BuchiCegarLoop]: Abstraction has 827 states and 1492 transitions. [2022-02-21 04:27:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states and 1492 transitions. [2022-02-21 04:27:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 827. [2022-02-21 04:27:36,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:27:36,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 827 states and 1492 transitions. Second operand has 827 states, 827 states have (on average 1.8041112454655381) internal successors, (1492), 826 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:36,227 INFO L74 IsIncluded]: Start isIncluded. First operand 827 states and 1492 transitions. Second operand has 827 states, 827 states have (on average 1.8041112454655381) internal successors, (1492), 826 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:36,228 INFO L87 Difference]: Start difference. First operand 827 states and 1492 transitions. Second operand has 827 states, 827 states have (on average 1.8041112454655381) internal successors, (1492), 826 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:36,248 INFO L93 Difference]: Finished difference Result 827 states and 1492 transitions. [2022-02-21 04:27:36,248 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1492 transitions. [2022-02-21 04:27:36,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:36,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:36,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 827 states have (on average 1.8041112454655381) internal successors, (1492), 826 states have internal predecessors, (1492), 0 states have call successors, (0), 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 827 states and 1492 transitions. [2022-02-21 04:27:36,253 INFO L87 Difference]: Start difference. First operand has 827 states, 827 states have (on average 1.8041112454655381) internal successors, (1492), 826 states have internal predecessors, (1492), 0 states have call successors, (0), 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 827 states and 1492 transitions. [2022-02-21 04:27:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:36,273 INFO L93 Difference]: Finished difference Result 827 states and 1492 transitions. [2022-02-21 04:27:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1492 transitions. [2022-02-21 04:27:36,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:36,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:36,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:27:36,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:27:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 827 states have (on average 1.8041112454655381) internal successors, (1492), 826 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1492 transitions. [2022-02-21 04:27:36,295 INFO L704 BuchiCegarLoop]: Abstraction has 827 states and 1492 transitions. [2022-02-21 04:27:36,296 INFO L587 BuchiCegarLoop]: Abstraction has 827 states and 1492 transitions. [2022-02-21 04:27:36,296 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:27:36,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 827 states and 1492 transitions. [2022-02-21 04:27:36,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 281 [2022-02-21 04:27:36,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:36,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:36,301 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:36,301 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, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:36,301 INFO L791 eck$LassoCheckResult]: Stem: 5076#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; 5060#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; 4941#L623 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 4460#L642 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 4526#L652 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 4934#L671 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 5038#L681 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 4797#L700 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 4586#L710 assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; 4573#L729 init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 4786#L739 assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; 4457#L758 init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 4404#L768 assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; 4405#L787 init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 4881#L797 assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; 4552#L816 init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 4988#L826 assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; 4601#L845 init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 4955#L855 assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; 4414#L874 init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 4873#L884 assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; 4443#L903 init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 4703#L913 assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; 4389#L932 init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 5011#L942 assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; 4782#L961 init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 4783#L971 assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; 4412#L990 init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 4659#L1000 assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; 4708#L1019 init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 5073#L1029 assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; 4564#L1048 init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 4777#L1058 assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; 4419#L1077 init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 4729#L1087 assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; 4567#L1106 init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 4899#L1116 assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; 4547#L1135 init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 4963#L1145 assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; 4416#L1164 init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 4906#L1174 assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; 4531#L1193 init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 4860#L1203 assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; 4611#L1222 init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 4787#L1232 assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; 4848#L1251 init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 4849#L1261 assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; 4831#L1280 init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 4859#L1290 assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; 4609#L1309 init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 4928#L1319 assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; 4691#L1338 init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); 4789#L1348 assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; 4479#L1367 init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); 5004#L1377 assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; 4535#L1396 init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); 4580#L1406 assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; 4679#L1425 init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); 5020#L1435 assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; 4480#L1454 init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); 4864#L1464 assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; 4764#L1483 init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); 5047#L1493 assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; 4668#L1512 init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); 4671#L1522 assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; 4379#L1541 init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); 4510#L1551 assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; 4576#L1570 init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); 4577#L1580 assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; 4714#L1599 init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); 4445#L1609 assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; 4446#L1628 init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); 4807#L1638 assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; 4383#L1657 init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); 4665#L1667 assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; 4556#L1686 init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); 4798#L1696 assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; 4758#L1715 init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); 4820#L1725 assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; 4821#L1744 init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); 5009#L1754 assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; 4790#L1773 init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); 4791#L1783 assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; 4471#L1802 init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); 4967#L1812 assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; 4872#L1831 init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); 4626#L1841 assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; 4514#L1860 init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); 4569#L1870 assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; 4570#L1889 init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); 4784#L1899 assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; 4474#L1918 init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); 4780#L1928 assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; 4781#L1947 init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); 4994#L1957 assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; 5035#L1976 init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); 4752#L1986 assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; 4639#L2005 init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); 4794#L2015 assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; 4539#L2034 init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); 5017#L2044 assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; 4491#L2063 init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); 4839#L2073 assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; 4651#L2092 init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); 4641#L2102 assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; 4528#L2121 init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); 4725#L2131 assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; 4488#L2150 init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); 4774#L2160 assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; 4498#L2179 init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); 4499#L2189 assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; 4776#L2208 init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); 4846#L2218 assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; 4469#L2237 init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); 4936#L2247 assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; 4919#L2266 init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); 4597#L2276 assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; 4599#L2295 init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); 4788#L2305 assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; 4545#L2324 init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); 4767#L2334 assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; 4421#L2353 init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); 4422#L2363 assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; 4374#L2363-1 init_#res#1 := init_~tmp___59~0#1; 5022#L2604 main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; 5027#L21 assume !(0 == assume_abort_if_not_~cond#1); 4761#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 4762#L2776-2 [2022-02-21 04:27:36,302 INFO L793 eck$LassoCheckResult]: Loop: 4762#L2776-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1; 5192#L148 assume !(0 != ~mode1~0 % 256); 5191#L187 assume ~r1~0 < 4; 4431#L188 assume !(0 != ~ep12~0 % 256); 4432#L188-2 assume !(0 != ~ep13~0 % 256); 4685#L191-1 assume !(0 != ~ep14~0 % 256); 4686#L194-1 assume !(0 != ~ep15~0 % 256); 4948#L187-1 ~mode1~0 := 1; 4974#L148-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1; 5164#L211 assume !(0 != ~mode2~0 % 256); 5150#L250 assume !(~r2~0 < 4); 5146#L250-1 ~mode2~0 := 1; 5145#L211-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1; 5144#L274 assume !(0 != ~mode3~0 % 256); 5131#L313 assume !(~r3~0 < 4); 5127#L313-1 ~mode3~0 := 1; 5126#L274-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1; 5124#L337 assume !(0 != ~mode4~0 % 256); 5125#L376 assume !(~r4~0 < 4); 5107#L376-1 ~mode4~0 := 1; 5106#L337-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1; 5105#L400 assume !(0 != ~mode5~0 % 256); 5089#L439 assume !(~r5~0 < 4); 5085#L439-1 ~mode5~0 := 1; 5084#L400-2 assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 5083#L2612 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 5082#L2613 assume ~st1~0 + ~nl1~0 <= 1; 5081#L2614 assume ~st2~0 + ~nl2~0 <= 1; 5080#L2615 assume ~st3~0 + ~nl3~0 <= 1; 5079#L2616 assume ~st4~0 + ~nl4~0 <= 1; 5078#L2617 assume ~st5~0 + ~nl5~0 <= 1; 5077#L2618 assume !(~r1~0 >= 4); 4753#L2621 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 4754#L2622 assume ~r1~0 < 4; 5182#L2627 assume !(~r1~0 >= 4); 4802#L2631 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0 + ~nl5~0; 4803#L2632 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 5196#L2612-1 check_#res#1 := check_~tmp~1#1; 5195#L2668 main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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; 5194#L2836 assume !(0 == assert_~arg#1 % 256); 5193#L2831 assume { :end_inline_assert } true;main_#t~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1; 4762#L2776-2 [2022-02-21 04:27:36,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:36,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1593308194, now seen corresponding path program 3 times [2022-02-21 04:27:36,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:36,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294124571] [2022-02-21 04:27:36,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:36,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:36,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {6854#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; {6854#true} is VALID [2022-02-21 04:27:36,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {6854#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; {6854#true} is VALID [2022-02-21 04:27:36,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {6854#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {6854#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {6854#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {6854#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {6854#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {6854#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {6854#true} assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {6854#true} init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {6854#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {6854#true} init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {6854#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {6854#true} init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {6854#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {6854#true} init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {6854#true} assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {6854#true} init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {6854#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {6854#true} init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {6854#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {6854#true} init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {6854#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {6854#true} init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {6854#true} assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {6854#true} init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {6854#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {6854#true} init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {6854#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {6854#true} init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {6854#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {6854#true} init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {6854#true} assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {6854#true} init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {6854#true} assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {6854#true} init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {6854#true} assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {6854#true} init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {6854#true} assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {6854#true} init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {6854#true} assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {6854#true} init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {6854#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {6854#true} init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {6854#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,372 INFO L290 TraceCheckUtils]: 45: Hoare triple {6854#true} init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,372 INFO L290 TraceCheckUtils]: 46: Hoare triple {6854#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,372 INFO L290 TraceCheckUtils]: 47: Hoare triple {6854#true} init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,372 INFO L290 TraceCheckUtils]: 48: Hoare triple {6854#true} assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,372 INFO L290 TraceCheckUtils]: 49: Hoare triple {6854#true} init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,372 INFO L290 TraceCheckUtils]: 50: Hoare triple {6854#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,372 INFO L290 TraceCheckUtils]: 51: Hoare triple {6854#true} init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {6854#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,373 INFO L290 TraceCheckUtils]: 53: Hoare triple {6854#true} init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,373 INFO L290 TraceCheckUtils]: 54: Hoare triple {6854#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {6854#true} init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {6854#true} assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {6854#true} init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,373 INFO L290 TraceCheckUtils]: 58: Hoare triple {6854#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,373 INFO L290 TraceCheckUtils]: 59: Hoare triple {6854#true} init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,374 INFO L290 TraceCheckUtils]: 60: Hoare triple {6854#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,374 INFO L290 TraceCheckUtils]: 61: Hoare triple {6854#true} init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {6854#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,374 INFO L290 TraceCheckUtils]: 63: Hoare triple {6854#true} init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,374 INFO L290 TraceCheckUtils]: 64: Hoare triple {6854#true} assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,374 INFO L290 TraceCheckUtils]: 65: Hoare triple {6854#true} init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,374 INFO L290 TraceCheckUtils]: 66: Hoare triple {6854#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,374 INFO L290 TraceCheckUtils]: 67: Hoare triple {6854#true} init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,375 INFO L290 TraceCheckUtils]: 68: Hoare triple {6854#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,375 INFO L290 TraceCheckUtils]: 69: Hoare triple {6854#true} init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {6854#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {6854#true} init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {6854#true} assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {6854#true} init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,375 INFO L290 TraceCheckUtils]: 74: Hoare triple {6854#true} assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,376 INFO L290 TraceCheckUtils]: 75: Hoare triple {6854#true} init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,376 INFO L290 TraceCheckUtils]: 76: Hoare triple {6854#true} assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,376 INFO L290 TraceCheckUtils]: 77: Hoare triple {6854#true} init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,376 INFO L290 TraceCheckUtils]: 78: Hoare triple {6854#true} assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,376 INFO L290 TraceCheckUtils]: 79: Hoare triple {6854#true} init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,376 INFO L290 TraceCheckUtils]: 80: Hoare triple {6854#true} assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,376 INFO L290 TraceCheckUtils]: 81: Hoare triple {6854#true} init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,376 INFO L290 TraceCheckUtils]: 82: Hoare triple {6854#true} assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,377 INFO L290 TraceCheckUtils]: 83: Hoare triple {6854#true} init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,377 INFO L290 TraceCheckUtils]: 84: Hoare triple {6854#true} assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,377 INFO L290 TraceCheckUtils]: 85: Hoare triple {6854#true} init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,377 INFO L290 TraceCheckUtils]: 86: Hoare triple {6854#true} assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,377 INFO L290 TraceCheckUtils]: 87: Hoare triple {6854#true} init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,377 INFO L290 TraceCheckUtils]: 88: Hoare triple {6854#true} assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,377 INFO L290 TraceCheckUtils]: 89: Hoare triple {6854#true} init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,377 INFO L290 TraceCheckUtils]: 90: Hoare triple {6854#true} assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,378 INFO L290 TraceCheckUtils]: 91: Hoare triple {6854#true} init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,378 INFO L290 TraceCheckUtils]: 92: Hoare triple {6854#true} assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,378 INFO L290 TraceCheckUtils]: 93: Hoare triple {6854#true} init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,378 INFO L290 TraceCheckUtils]: 94: Hoare triple {6854#true} assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,378 INFO L290 TraceCheckUtils]: 95: Hoare triple {6854#true} init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,378 INFO L290 TraceCheckUtils]: 96: Hoare triple {6854#true} assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,378 INFO L290 TraceCheckUtils]: 97: Hoare triple {6854#true} init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,378 INFO L290 TraceCheckUtils]: 98: Hoare triple {6854#true} assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,379 INFO L290 TraceCheckUtils]: 99: Hoare triple {6854#true} init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,379 INFO L290 TraceCheckUtils]: 100: Hoare triple {6854#true} assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,379 INFO L290 TraceCheckUtils]: 101: Hoare triple {6854#true} init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,379 INFO L290 TraceCheckUtils]: 102: Hoare triple {6854#true} assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,379 INFO L290 TraceCheckUtils]: 103: Hoare triple {6854#true} init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,379 INFO L290 TraceCheckUtils]: 104: Hoare triple {6854#true} assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,379 INFO L290 TraceCheckUtils]: 105: Hoare triple {6854#true} init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,379 INFO L290 TraceCheckUtils]: 106: Hoare triple {6854#true} assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,380 INFO L290 TraceCheckUtils]: 107: Hoare triple {6854#true} init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,380 INFO L290 TraceCheckUtils]: 108: Hoare triple {6854#true} assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,380 INFO L290 TraceCheckUtils]: 109: Hoare triple {6854#true} init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,380 INFO L290 TraceCheckUtils]: 110: Hoare triple {6854#true} assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,380 INFO L290 TraceCheckUtils]: 111: Hoare triple {6854#true} init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,380 INFO L290 TraceCheckUtils]: 112: Hoare triple {6854#true} assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,380 INFO L290 TraceCheckUtils]: 113: Hoare triple {6854#true} init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,380 INFO L290 TraceCheckUtils]: 114: Hoare triple {6854#true} assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,381 INFO L290 TraceCheckUtils]: 115: Hoare triple {6854#true} init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,381 INFO L290 TraceCheckUtils]: 116: Hoare triple {6854#true} assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,381 INFO L290 TraceCheckUtils]: 117: Hoare triple {6854#true} init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,381 INFO L290 TraceCheckUtils]: 118: Hoare triple {6854#true} assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,381 INFO L290 TraceCheckUtils]: 119: Hoare triple {6854#true} init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,381 INFO L290 TraceCheckUtils]: 120: Hoare triple {6854#true} assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; {6854#true} is VALID [2022-02-21 04:27:36,381 INFO L290 TraceCheckUtils]: 121: Hoare triple {6854#true} init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); {6854#true} is VALID [2022-02-21 04:27:36,382 INFO L290 TraceCheckUtils]: 122: Hoare triple {6854#true} assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; {6856#(= |ULTIMATE.start_init_~tmp___59~0#1| 0)} is VALID [2022-02-21 04:27:36,382 INFO L290 TraceCheckUtils]: 123: Hoare triple {6856#(= |ULTIMATE.start_init_~tmp___59~0#1| 0)} init_#res#1 := init_~tmp___59~0#1; {6857#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:27:36,383 INFO L290 TraceCheckUtils]: 124: Hoare triple {6857#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; {6858#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:27:36,383 INFO L290 TraceCheckUtils]: 125: Hoare triple {6858#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {6855#false} is VALID [2022-02-21 04:27:36,383 INFO L290 TraceCheckUtils]: 126: Hoare triple {6855#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6855#false} is VALID [2022-02-21 04:27:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:27:36,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:36,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294124571] [2022-02-21 04:27:36,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294124571] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:36,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:36,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:36,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127170903] [2022-02-21 04:27:36,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:36,385 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:27:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash -991631005, now seen corresponding path program 1 times [2022-02-21 04:27:36,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:36,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316748] [2022-02-21 04:27:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:27:36,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:27:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:27:36,424 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:27:37,810 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:27:37,811 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:27:37,811 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:27:37,811 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:27:37,811 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:27:37,811 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:37,811 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:27:37,811 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:27:37,811 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.5.2.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2022-02-21 04:27:37,811 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:27:37,812 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:27:37,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:37,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:38,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:38,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:38,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:38,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,163 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:27:39,164 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:27:39,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:39,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:39,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:39,169 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:27:39,169 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:39,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:27:39,193 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:27:39,193 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node5_#t~ite23#1=0} Honda state: {ULTIMATE.start_node5_#t~ite23#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:27:39,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:27:39,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:39,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:39,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:39,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:27:39,214 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:27:39,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:39,221 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:27:39,221 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node1_#t~ite7#1=0} Honda state: {ULTIMATE.start_node1_#t~ite7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:27:39,238 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:27:39,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:39,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:39,240 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:39,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:27:39,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:27:39,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:39,260 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:27:39,260 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node5_#t~ite22#1=0} Honda state: {ULTIMATE.start_node5_#t~ite22#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:27:39,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:39,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:39,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:39,295 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:39,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:27:39,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:27:39,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:39,326 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:27:39,326 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node3_#t~ite14#1=0} Honda state: {ULTIMATE.start_node3_#t~ite14#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:27:39,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:39,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:39,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:39,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:39,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:27:39,361 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:27:39,361 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:39,413 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:27:39,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:39,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:39,415 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:39,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:27:39,429 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:27:39,430 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:39,557 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:27:39,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 04:27:39,560 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:27:39,560 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:27:39,560 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:27:39,560 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:27:39,560 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:27:39,560 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:39,560 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:27:39,561 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:27:39,561 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.5.2.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2022-02-21 04:27:39,561 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:27:39,561 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:27:39,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:39,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:40,790 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:27:40,793 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:27:40,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:40,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:40,796 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:40,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:27:40,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:40,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:40,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:40,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:40,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:40,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:40,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:40,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:40,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:40,888 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:27:40,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:40,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:40,890 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:40,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:27:40,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:40,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:40,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:40,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:40,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:40,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:40,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:40,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:40,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:40,925 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:27:40,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:40,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:40,935 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:40,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:27:40,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:40,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:40,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:40,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:40,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:40,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:40,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:40,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:40,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:40,977 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:27:40,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:40,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:40,978 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:40,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:27:40,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:40,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:40,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:40,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:40,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:40,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:40,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:40,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:41,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,038 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:27:41,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:41,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,069 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:27:41,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 04:27:41,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,095 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:27:41,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:41,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,136 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:27:41,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 04:27:41,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,172 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:27:41,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 04:27:41,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,213 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:27:41,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:41,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,254 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:27:41,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:41,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,291 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:27:41,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:41,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,317 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:27:41,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 04:27:41,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,357 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:27:41,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:27:41,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:41,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,383 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:27:41,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:41,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,410 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:27:41,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 04:27:41,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,435 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:27:41,436 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:27:41,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,462 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:27:41,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,463 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:27:41,464 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:27:41,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:41,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 04:27:41,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,488 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:27:41,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:41,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:41,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:41,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:41,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:41,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:41,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:41,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:41,498 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:27:41,502 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:27:41,502 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:27:41,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:41,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:41,505 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:41,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:27:41,507 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:27:41,507 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:27:41,507 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:27:41,507 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 19 Supporting invariants [] [2022-02-21 04:27:41,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:41,539 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:27:41,545 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1;" "assume !(0 != ~mode1~0 % 256);" "assume ~r1~0 < 4;" "assume !(0 != ~ep12~0 % 256);" "assume !(0 != ~ep13~0 % 256);" "assume !(0 != ~ep14~0 % 256);" "assume !(0 != ~ep15~0 % 256);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 4);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 4);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1;" "assume !(0 != ~mode4~0 % 256);" "assume !(~r4~0 < 4);" "~mode4~0 := 1;" "assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1;" "assume !(0 != ~mode5~0 % 256);" "assume !(~r5~0 < 4);" "~mode5~0 := 1;" "assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_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 + ~st5~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 ~st5~0 + ~nl5~0 <= 1;" "assume !(~r1~0 >= 4);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0;" "assume ~r1~0 < 4;" "assume !(~r1~0 >= 4);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0 + ~nl5~0;" "assume ~r1~0 < 4;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1;" [2022-02-21 04:27:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:41,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:41,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:27:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:41,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:27:41,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {6861#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; {6861#unseeded} is VALID [2022-02-21 04:27:41,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {6861#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; {6861#unseeded} is VALID [2022-02-21 04:27:41,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {6861#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {6861#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {6861#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {6861#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {6861#unseeded} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {6861#unseeded} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {6861#unseeded} assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {6861#unseeded} init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {6861#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {6861#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {6861#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {6861#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {6861#unseeded} assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {6861#unseeded} init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {6861#unseeded} assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {6861#unseeded} init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {6861#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {6861#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {6861#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {6861#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {6861#unseeded} assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {6861#unseeded} init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {6861#unseeded} assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {6861#unseeded} init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {6861#unseeded} assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {6861#unseeded} init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {6861#unseeded} assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {6861#unseeded} init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {6861#unseeded} assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {6861#unseeded} init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {6861#unseeded} assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {6861#unseeded} init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {6861#unseeded} assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {6861#unseeded} init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {6861#unseeded} assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {6861#unseeded} init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {6861#unseeded} assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {6861#unseeded} init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {6861#unseeded} assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {6861#unseeded} init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {6861#unseeded} assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,964 INFO L290 TraceCheckUtils]: 43: Hoare triple {6861#unseeded} init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,964 INFO L290 TraceCheckUtils]: 44: Hoare triple {6861#unseeded} assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,965 INFO L290 TraceCheckUtils]: 45: Hoare triple {6861#unseeded} init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,965 INFO L290 TraceCheckUtils]: 46: Hoare triple {6861#unseeded} assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,965 INFO L290 TraceCheckUtils]: 47: Hoare triple {6861#unseeded} init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,965 INFO L290 TraceCheckUtils]: 48: Hoare triple {6861#unseeded} assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,966 INFO L290 TraceCheckUtils]: 49: Hoare triple {6861#unseeded} init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,966 INFO L290 TraceCheckUtils]: 50: Hoare triple {6861#unseeded} assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,966 INFO L290 TraceCheckUtils]: 51: Hoare triple {6861#unseeded} init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {6861#unseeded} assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {6861#unseeded} init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,967 INFO L290 TraceCheckUtils]: 54: Hoare triple {6861#unseeded} assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,967 INFO L290 TraceCheckUtils]: 55: Hoare triple {6861#unseeded} init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {6861#unseeded} assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {6861#unseeded} init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,968 INFO L290 TraceCheckUtils]: 58: Hoare triple {6861#unseeded} assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,969 INFO L290 TraceCheckUtils]: 59: Hoare triple {6861#unseeded} init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,969 INFO L290 TraceCheckUtils]: 60: Hoare triple {6861#unseeded} assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,969 INFO L290 TraceCheckUtils]: 61: Hoare triple {6861#unseeded} init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,969 INFO L290 TraceCheckUtils]: 62: Hoare triple {6861#unseeded} assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,970 INFO L290 TraceCheckUtils]: 63: Hoare triple {6861#unseeded} init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,970 INFO L290 TraceCheckUtils]: 64: Hoare triple {6861#unseeded} assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,970 INFO L290 TraceCheckUtils]: 65: Hoare triple {6861#unseeded} init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,971 INFO L290 TraceCheckUtils]: 66: Hoare triple {6861#unseeded} assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,971 INFO L290 TraceCheckUtils]: 67: Hoare triple {6861#unseeded} init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,971 INFO L290 TraceCheckUtils]: 68: Hoare triple {6861#unseeded} assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,971 INFO L290 TraceCheckUtils]: 69: Hoare triple {6861#unseeded} init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,972 INFO L290 TraceCheckUtils]: 70: Hoare triple {6861#unseeded} assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,972 INFO L290 TraceCheckUtils]: 71: Hoare triple {6861#unseeded} init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,972 INFO L290 TraceCheckUtils]: 72: Hoare triple {6861#unseeded} assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,972 INFO L290 TraceCheckUtils]: 73: Hoare triple {6861#unseeded} init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,973 INFO L290 TraceCheckUtils]: 74: Hoare triple {6861#unseeded} assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,973 INFO L290 TraceCheckUtils]: 75: Hoare triple {6861#unseeded} init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,973 INFO L290 TraceCheckUtils]: 76: Hoare triple {6861#unseeded} assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,974 INFO L290 TraceCheckUtils]: 77: Hoare triple {6861#unseeded} init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,974 INFO L290 TraceCheckUtils]: 78: Hoare triple {6861#unseeded} assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,974 INFO L290 TraceCheckUtils]: 79: Hoare triple {6861#unseeded} init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,974 INFO L290 TraceCheckUtils]: 80: Hoare triple {6861#unseeded} assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,975 INFO L290 TraceCheckUtils]: 81: Hoare triple {6861#unseeded} init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,975 INFO L290 TraceCheckUtils]: 82: Hoare triple {6861#unseeded} assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,975 INFO L290 TraceCheckUtils]: 83: Hoare triple {6861#unseeded} init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,976 INFO L290 TraceCheckUtils]: 84: Hoare triple {6861#unseeded} assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,976 INFO L290 TraceCheckUtils]: 85: Hoare triple {6861#unseeded} init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,976 INFO L290 TraceCheckUtils]: 86: Hoare triple {6861#unseeded} assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,976 INFO L290 TraceCheckUtils]: 87: Hoare triple {6861#unseeded} init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,977 INFO L290 TraceCheckUtils]: 88: Hoare triple {6861#unseeded} assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,977 INFO L290 TraceCheckUtils]: 89: Hoare triple {6861#unseeded} init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,977 INFO L290 TraceCheckUtils]: 90: Hoare triple {6861#unseeded} assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,977 INFO L290 TraceCheckUtils]: 91: Hoare triple {6861#unseeded} init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,978 INFO L290 TraceCheckUtils]: 92: Hoare triple {6861#unseeded} assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,978 INFO L290 TraceCheckUtils]: 93: Hoare triple {6861#unseeded} init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,978 INFO L290 TraceCheckUtils]: 94: Hoare triple {6861#unseeded} assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,978 INFO L290 TraceCheckUtils]: 95: Hoare triple {6861#unseeded} init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,979 INFO L290 TraceCheckUtils]: 96: Hoare triple {6861#unseeded} assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,979 INFO L290 TraceCheckUtils]: 97: Hoare triple {6861#unseeded} init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,979 INFO L290 TraceCheckUtils]: 98: Hoare triple {6861#unseeded} assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,980 INFO L290 TraceCheckUtils]: 99: Hoare triple {6861#unseeded} init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,980 INFO L290 TraceCheckUtils]: 100: Hoare triple {6861#unseeded} assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,980 INFO L290 TraceCheckUtils]: 101: Hoare triple {6861#unseeded} init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,980 INFO L290 TraceCheckUtils]: 102: Hoare triple {6861#unseeded} assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,981 INFO L290 TraceCheckUtils]: 103: Hoare triple {6861#unseeded} init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,981 INFO L290 TraceCheckUtils]: 104: Hoare triple {6861#unseeded} assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,981 INFO L290 TraceCheckUtils]: 105: Hoare triple {6861#unseeded} init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,981 INFO L290 TraceCheckUtils]: 106: Hoare triple {6861#unseeded} assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,982 INFO L290 TraceCheckUtils]: 107: Hoare triple {6861#unseeded} init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,982 INFO L290 TraceCheckUtils]: 108: Hoare triple {6861#unseeded} assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,982 INFO L290 TraceCheckUtils]: 109: Hoare triple {6861#unseeded} init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,983 INFO L290 TraceCheckUtils]: 110: Hoare triple {6861#unseeded} assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,983 INFO L290 TraceCheckUtils]: 111: Hoare triple {6861#unseeded} init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,983 INFO L290 TraceCheckUtils]: 112: Hoare triple {6861#unseeded} assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,983 INFO L290 TraceCheckUtils]: 113: Hoare triple {6861#unseeded} init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,984 INFO L290 TraceCheckUtils]: 114: Hoare triple {6861#unseeded} assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,984 INFO L290 TraceCheckUtils]: 115: Hoare triple {6861#unseeded} init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,984 INFO L290 TraceCheckUtils]: 116: Hoare triple {6861#unseeded} assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,985 INFO L290 TraceCheckUtils]: 117: Hoare triple {6861#unseeded} init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,985 INFO L290 TraceCheckUtils]: 118: Hoare triple {6861#unseeded} assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,985 INFO L290 TraceCheckUtils]: 119: Hoare triple {6861#unseeded} init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,985 INFO L290 TraceCheckUtils]: 120: Hoare triple {6861#unseeded} assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; {6861#unseeded} is VALID [2022-02-21 04:27:41,986 INFO L290 TraceCheckUtils]: 121: Hoare triple {6861#unseeded} init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); {6861#unseeded} is VALID [2022-02-21 04:27:41,986 INFO L290 TraceCheckUtils]: 122: Hoare triple {6861#unseeded} assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; {6861#unseeded} is VALID [2022-02-21 04:27:41,986 INFO L290 TraceCheckUtils]: 123: Hoare triple {6861#unseeded} init_#res#1 := init_~tmp___59~0#1; {6861#unseeded} is VALID [2022-02-21 04:27:41,986 INFO L290 TraceCheckUtils]: 124: Hoare triple {6861#unseeded} main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; {6861#unseeded} is VALID [2022-02-21 04:27:41,987 INFO L290 TraceCheckUtils]: 125: Hoare triple {6861#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {6861#unseeded} is VALID [2022-02-21 04:27:41,987 INFO L290 TraceCheckUtils]: 126: Hoare triple {6861#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6861#unseeded} is VALID [2022-02-21 04:27:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:42,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:27:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:42,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:27:42,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {6864#(>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~mode1~0 % 256); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~r1~0 < 4; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~ep12~0 % 256); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~ep13~0 % 256); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~ep14~0 % 256); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~ep15~0 % 256); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode1~0 := 1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~mode2~0 % 256); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r2~0 < 4); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode2~0 := 1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~mode3~0 % 256); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r3~0 < 4); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode3~0 := 1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~mode4~0 % 256); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r4~0 < 4); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode4~0 := 1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~mode5~0 % 256); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r5~0 < 4); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode5~0 := 1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st1~0 + ~nl1~0 <= 1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st2~0 + ~nl2~0 <= 1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st3~0 + ~nl3~0 <= 1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st4~0 + ~nl4~0 <= 1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st5~0 + ~nl5~0 <= 1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r1~0 >= 4); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~r1~0 < 4; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r1~0 >= 4); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0 + ~nl5~0; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} check_#res#1 := check_~tmp~1#1; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,411 INFO L290 TraceCheckUtils]: 38: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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; {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,411 INFO L290 TraceCheckUtils]: 39: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 == assert_~arg#1 % 256); {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:42,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {7257#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_assert } true;main_#t~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1; {6874#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:27:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:27:42,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:42,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:27:42,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:42,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:42,462 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:27:42,462 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 827 states and 1492 transitions. cyclomatic complexity: 666 Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:42,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:43,381 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 827 states and 1492 transitions. cyclomatic complexity: 666. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 1107 states and 1958 transitions. Complement of second has 4 states. [2022-02-21 04:27:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:27:43,381 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:27:43,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 827 states and 1492 transitions. cyclomatic complexity: 666 [2022-02-21 04:27:43,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:43,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:43,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:43,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:27:43,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:43,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:43,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1107 states and 1958 transitions. [2022-02-21 04:27:43,402 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:43,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:27:43,405 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 827 states and 1492 transitions. cyclomatic complexity: 666 [2022-02-21 04:27:43,606 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 281 examples of accepted words. [2022-02-21 04:27:43,606 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:43,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:27:43,612 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:27:43,612 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 [2022-02-21 04:27:43,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 [2022-02-21 04:27:43,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:27:43,612 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:27:43,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:43,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:43,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:43,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:43,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:43,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:43,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 1107 letters. Loop has 1107 letters. [2022-02-21 04:27:43,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1107 letters. Loop has 1107 letters. [2022-02-21 04:27:43,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 1107 letters. Loop has 1107 letters. [2022-02-21 04:27:43,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 827 letters. Loop has 827 letters. [2022-02-21 04:27:43,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 827 letters. Loop has 827 letters. [2022-02-21 04:27:43,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 827 letters. Loop has 827 letters. [2022-02-21 04:27:43,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:27:43,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:27:43,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:27:43,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 46 letters. [2022-02-21 04:27:43,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 46 letters. [2022-02-21 04:27:43,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 46 letters. [2022-02-21 04:27:43,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:43,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:43,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:43,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 46 letters. [2022-02-21 04:27:43,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 46 letters. [2022-02-21 04:27:43,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 46 letters. [2022-02-21 04:27:43,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:43,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:43,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:43,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:43,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:43,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:43,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:43,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:43,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:43,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:43,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:43,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:43,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:43,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:43,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:43,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:43,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:43,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:43,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:43,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:43,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:43,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 46 letters. [2022-02-21 04:27:43,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 46 letters. [2022-02-21 04:27:43,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 46 letters. [2022-02-21 04:27:43,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:43,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:43,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:43,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:43,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:43,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:43,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:43,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:43,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:43,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 47 letters. [2022-02-21 04:27:43,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 47 letters. [2022-02-21 04:27:43,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 47 letters. [2022-02-21 04:27:43,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:43,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:43,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:43,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 47 letters. [2022-02-21 04:27:43,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 47 letters. [2022-02-21 04:27:43,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 47 letters. [2022-02-21 04:27:43,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 46 letters. [2022-02-21 04:27:43,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 46 letters. [2022-02-21 04:27:43,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 46 letters. [2022-02-21 04:27:43,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 45 letters. [2022-02-21 04:27:43,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 45 letters. [2022-02-21 04:27:43,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 45 letters. [2022-02-21 04:27:43,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 46 letters. [2022-02-21 04:27:43,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 46 letters. [2022-02-21 04:27:43,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 46 letters. [2022-02-21 04:27:43,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 45 letters. [2022-02-21 04:27:43,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 45 letters. [2022-02-21 04:27:43,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 45 letters. [2022-02-21 04:27:43,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 46 letters. [2022-02-21 04:27:43,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 46 letters. [2022-02-21 04:27:43,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 46 letters. [2022-02-21 04:27:43,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 37 letters. [2022-02-21 04:27:43,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 37 letters. [2022-02-21 04:27:43,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 37 letters. [2022-02-21 04:27:43,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 37 letters. [2022-02-21 04:27:43,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 37 letters. [2022-02-21 04:27:43,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 37 letters. [2022-02-21 04:27:43,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:43,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:43,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:43,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 42 letters. [2022-02-21 04:27:43,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 42 letters. [2022-02-21 04:27:43,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 42 letters. [2022-02-21 04:27:43,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 46 letters. [2022-02-21 04:27:43,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 46 letters. [2022-02-21 04:27:43,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 46 letters. [2022-02-21 04:27:43,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:43,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:43,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:43,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:43,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:43,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:43,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:43,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:43,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:43,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:43,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:43,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:43,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:43,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:43,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:43,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:43,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:43,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:43,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 42 letters. [2022-02-21 04:27:43,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 42 letters. [2022-02-21 04:27:43,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 42 letters. [2022-02-21 04:27:43,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:43,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:43,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:43,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:43,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:43,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:43,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 46 letters. [2022-02-21 04:27:43,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 46 letters. [2022-02-21 04:27:43,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 46 letters. [2022-02-21 04:27:43,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:43,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:43,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:43,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:43,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:43,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:43,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 45 letters. [2022-02-21 04:27:43,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 45 letters. [2022-02-21 04:27:43,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 45 letters. [2022-02-21 04:27:43,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 47 letters. [2022-02-21 04:27:43,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 47 letters. [2022-02-21 04:27:43,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 47 letters. [2022-02-21 04:27:43,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:43,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:43,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:43,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 47 letters. [2022-02-21 04:27:43,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 47 letters. [2022-02-21 04:27:43,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 47 letters. [2022-02-21 04:27:43,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 46 letters. [2022-02-21 04:27:43,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 46 letters. [2022-02-21 04:27:43,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 46 letters. [2022-02-21 04:27:43,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 45 letters. [2022-02-21 04:27:43,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 45 letters. [2022-02-21 04:27:43,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 45 letters. [2022-02-21 04:27:43,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 45 letters. [2022-02-21 04:27:43,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 45 letters. [2022-02-21 04:27:43,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 45 letters. [2022-02-21 04:27:43,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 46 letters. [2022-02-21 04:27:43,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 46 letters. [2022-02-21 04:27:43,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 46 letters. [2022-02-21 04:27:43,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 45 letters. [2022-02-21 04:27:43,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 45 letters. [2022-02-21 04:27:43,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 45 letters. [2022-02-21 04:27:43,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 46 letters. [2022-02-21 04:27:43,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 46 letters. [2022-02-21 04:27:43,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 46 letters. [2022-02-21 04:27:43,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 45 letters. [2022-02-21 04:27:43,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 45 letters. [2022-02-21 04:27:43,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 45 letters. [2022-02-21 04:27:43,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 46 letters. [2022-02-21 04:27:43,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 46 letters. [2022-02-21 04:27:43,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 46 letters. [2022-02-21 04:27:43,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 45 letters. [2022-02-21 04:27:43,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 45 letters. [2022-02-21 04:27:43,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 45 letters. [2022-02-21 04:27:43,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 43 letters. [2022-02-21 04:27:43,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 43 letters. [2022-02-21 04:27:43,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 43 letters. [2022-02-21 04:27:43,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:43,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:43,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:43,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 47 letters. [2022-02-21 04:27:43,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 47 letters. [2022-02-21 04:27:43,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 47 letters. [2022-02-21 04:27:43,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 43 letters. [2022-02-21 04:27:43,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 43 letters. [2022-02-21 04:27:43,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 43 letters. [2022-02-21 04:27:43,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 45 letters. [2022-02-21 04:27:43,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 45 letters. [2022-02-21 04:27:43,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 45 letters. [2022-02-21 04:27:43,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 47 letters. [2022-02-21 04:27:43,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 47 letters. [2022-02-21 04:27:43,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 47 letters. [2022-02-21 04:27:43,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 47 letters. [2022-02-21 04:27:43,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 47 letters. [2022-02-21 04:27:43,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 47 letters. [2022-02-21 04:27:43,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 47 letters. [2022-02-21 04:27:43,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 47 letters. [2022-02-21 04:27:43,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 47 letters. [2022-02-21 04:27:43,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:43,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:43,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:43,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 47 letters. [2022-02-21 04:27:43,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 47 letters. [2022-02-21 04:27:43,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 47 letters. [2022-02-21 04:27:43,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:43,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:43,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:43,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:43,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:43,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:43,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 47 letters. [2022-02-21 04:27:43,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 47 letters. [2022-02-21 04:27:43,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 47 letters. [2022-02-21 04:27:43,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 42 letters. [2022-02-21 04:27:43,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 42 letters. [2022-02-21 04:27:43,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 42 letters. [2022-02-21 04:27:43,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 45 letters. [2022-02-21 04:27:43,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 45 letters. [2022-02-21 04:27:43,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 45 letters. [2022-02-21 04:27:43,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:43,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:43,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:43,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 47 letters. [2022-02-21 04:27:43,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 47 letters. [2022-02-21 04:27:43,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 47 letters. [2022-02-21 04:27:43,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:43,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:43,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:43,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 47 letters. [2022-02-21 04:27:43,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 47 letters. [2022-02-21 04:27:43,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 47 letters. [2022-02-21 04:27:43,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 42 letters. [2022-02-21 04:27:43,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 42 letters. [2022-02-21 04:27:43,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 42 letters. [2022-02-21 04:27:43,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 47 letters. [2022-02-21 04:27:43,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 47 letters. [2022-02-21 04:27:43,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 47 letters. [2022-02-21 04:27:43,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 45 letters. [2022-02-21 04:27:43,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 45 letters. [2022-02-21 04:27:43,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 45 letters. [2022-02-21 04:27:43,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 47 letters. [2022-02-21 04:27:43,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 47 letters. [2022-02-21 04:27:43,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 47 letters. [2022-02-21 04:27:43,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 47 letters. [2022-02-21 04:27:43,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 47 letters. [2022-02-21 04:27:43,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 47 letters. [2022-02-21 04:27:43,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 47 letters. [2022-02-21 04:27:43,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 47 letters. [2022-02-21 04:27:43,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 47 letters. [2022-02-21 04:27:43,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 161 letters. Loop has 41 letters. [2022-02-21 04:27:43,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 161 letters. Loop has 41 letters. [2022-02-21 04:27:43,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 161 letters. Loop has 41 letters. [2022-02-21 04:27:43,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 45 letters. [2022-02-21 04:27:43,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 45 letters. [2022-02-21 04:27:43,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 45 letters. [2022-02-21 04:27:43,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 47 letters. [2022-02-21 04:27:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 47 letters. [2022-02-21 04:27:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 47 letters. [2022-02-21 04:27:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 37 letters. [2022-02-21 04:27:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 37 letters. [2022-02-21 04:27:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 37 letters. [2022-02-21 04:27:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 47 letters. [2022-02-21 04:27:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 47 letters. [2022-02-21 04:27:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 47 letters. [2022-02-21 04:27:43,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 47 letters. [2022-02-21 04:27:43,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 47 letters. [2022-02-21 04:27:43,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 47 letters. [2022-02-21 04:27:43,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:43,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:43,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:43,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 45 letters. [2022-02-21 04:27:43,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 45 letters. [2022-02-21 04:27:43,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 45 letters. [2022-02-21 04:27:43,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:43,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:43,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:43,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 47 letters. [2022-02-21 04:27:43,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 47 letters. [2022-02-21 04:27:43,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 47 letters. [2022-02-21 04:27:43,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 43 letters. [2022-02-21 04:27:43,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 43 letters. [2022-02-21 04:27:43,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 43 letters. [2022-02-21 04:27:43,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 47 letters. [2022-02-21 04:27:43,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 47 letters. [2022-02-21 04:27:43,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 47 letters. [2022-02-21 04:27:43,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 47 letters. [2022-02-21 04:27:43,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 47 letters. [2022-02-21 04:27:43,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 47 letters. [2022-02-21 04:27:43,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 129 letters. Loop has 41 letters. [2022-02-21 04:27:43,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 129 letters. Loop has 41 letters. [2022-02-21 04:27:43,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 129 letters. Loop has 41 letters. [2022-02-21 04:27:43,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 37 letters. [2022-02-21 04:27:43,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 37 letters. [2022-02-21 04:27:43,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 37 letters. [2022-02-21 04:27:43,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 128 letters. Loop has 41 letters. [2022-02-21 04:27:43,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 128 letters. Loop has 41 letters. [2022-02-21 04:27:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 128 letters. Loop has 41 letters. [2022-02-21 04:27:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 167 letters. Loop has 41 letters. [2022-02-21 04:27:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 167 letters. Loop has 41 letters. [2022-02-21 04:27:43,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 167 letters. Loop has 41 letters. [2022-02-21 04:27:43,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 37 letters. [2022-02-21 04:27:43,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 37 letters. [2022-02-21 04:27:43,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 37 letters. [2022-02-21 04:27:43,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 43 letters. [2022-02-21 04:27:43,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 43 letters. [2022-02-21 04:27:43,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 43 letters. [2022-02-21 04:27:43,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 166 letters. Loop has 41 letters. [2022-02-21 04:27:43,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 166 letters. Loop has 41 letters. [2022-02-21 04:27:43,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 166 letters. Loop has 41 letters. [2022-02-21 04:27:43,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 43 letters. [2022-02-21 04:27:43,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 43 letters. [2022-02-21 04:27:43,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 43 letters. [2022-02-21 04:27:43,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 165 letters. Loop has 41 letters. [2022-02-21 04:27:43,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 165 letters. Loop has 41 letters. [2022-02-21 04:27:43,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 165 letters. Loop has 41 letters. [2022-02-21 04:27:43,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 164 letters. Loop has 41 letters. [2022-02-21 04:27:43,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 164 letters. Loop has 41 letters. [2022-02-21 04:27:43,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 164 letters. Loop has 41 letters. [2022-02-21 04:27:43,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 132 letters. Loop has 41 letters. [2022-02-21 04:27:43,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 41 letters. [2022-02-21 04:27:43,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 132 letters. Loop has 41 letters. [2022-02-21 04:27:43,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:43,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:43,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:43,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 37 letters. [2022-02-21 04:27:43,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 37 letters. [2022-02-21 04:27:43,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 37 letters. [2022-02-21 04:27:43,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 43 letters. [2022-02-21 04:27:43,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 43 letters. [2022-02-21 04:27:43,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 43 letters. [2022-02-21 04:27:43,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:43,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:43,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:43,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 37 letters. [2022-02-21 04:27:43,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 37 letters. [2022-02-21 04:27:43,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 37 letters. [2022-02-21 04:27:43,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:43,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:43,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:43,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:43,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:43,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:43,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 42 letters. [2022-02-21 04:27:43,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 42 letters. [2022-02-21 04:27:43,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 42 letters. [2022-02-21 04:27:43,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:43,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:43,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:43,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 43 letters. [2022-02-21 04:27:43,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 43 letters. [2022-02-21 04:27:43,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 43 letters. [2022-02-21 04:27:43,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 42 letters. [2022-02-21 04:27:43,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 42 letters. [2022-02-21 04:27:43,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 42 letters. [2022-02-21 04:27:43,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:43,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:43,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:43,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:43,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:43,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:43,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 43 letters. [2022-02-21 04:27:43,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 43 letters. [2022-02-21 04:27:43,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 43 letters. [2022-02-21 04:27:43,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 159 letters. Loop has 41 letters. [2022-02-21 04:27:43,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 159 letters. Loop has 41 letters. [2022-02-21 04:27:43,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 159 letters. Loop has 41 letters. [2022-02-21 04:27:43,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 160 letters. Loop has 41 letters. [2022-02-21 04:27:43,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 160 letters. Loop has 41 letters. [2022-02-21 04:27:43,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 160 letters. Loop has 41 letters. [2022-02-21 04:27:43,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:43,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:43,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:43,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 37 letters. [2022-02-21 04:27:43,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 37 letters. [2022-02-21 04:27:43,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 37 letters. [2022-02-21 04:27:43,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 162 letters. Loop has 41 letters. [2022-02-21 04:27:43,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 162 letters. Loop has 41 letters. [2022-02-21 04:27:43,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 162 letters. Loop has 41 letters. [2022-02-21 04:27:43,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 163 letters. Loop has 41 letters. [2022-02-21 04:27:43,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 163 letters. Loop has 41 letters. [2022-02-21 04:27:43,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 163 letters. Loop has 41 letters. [2022-02-21 04:27:43,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:43,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:43,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:43,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:43,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:43,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:43,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 43 letters. [2022-02-21 04:27:43,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 43 letters. [2022-02-21 04:27:43,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 43 letters. [2022-02-21 04:27:43,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 43 letters. [2022-02-21 04:27:43,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 43 letters. [2022-02-21 04:27:43,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 43 letters. [2022-02-21 04:27:43,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 43 letters. [2022-02-21 04:27:43,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 43 letters. [2022-02-21 04:27:43,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 43 letters. [2022-02-21 04:27:43,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 37 letters. [2022-02-21 04:27:43,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 37 letters. [2022-02-21 04:27:43,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 37 letters. [2022-02-21 04:27:43,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 37 letters. [2022-02-21 04:27:43,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 37 letters. [2022-02-21 04:27:43,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 37 letters. [2022-02-21 04:27:43,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:43,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:43,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:43,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 43 letters. [2022-02-21 04:27:43,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 43 letters. [2022-02-21 04:27:43,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 43 letters. [2022-02-21 04:27:43,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 42 letters. [2022-02-21 04:27:43,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 42 letters. [2022-02-21 04:27:43,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 42 letters. [2022-02-21 04:27:43,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 42 letters. [2022-02-21 04:27:43,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 42 letters. [2022-02-21 04:27:43,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 42 letters. [2022-02-21 04:27:43,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 37 letters. [2022-02-21 04:27:43,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 37 letters. [2022-02-21 04:27:43,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 37 letters. [2022-02-21 04:27:43,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 37 letters. [2022-02-21 04:27:43,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 37 letters. [2022-02-21 04:27:43,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 37 letters. [2022-02-21 04:27:43,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 43 letters. [2022-02-21 04:27:43,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 43 letters. [2022-02-21 04:27:43,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 43 letters. [2022-02-21 04:27:43,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:43,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:43,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:43,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 158 letters. Loop has 37 letters. [2022-02-21 04:27:43,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 158 letters. Loop has 37 letters. [2022-02-21 04:27:43,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 158 letters. Loop has 37 letters. [2022-02-21 04:27:43,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 159 letters. Loop has 37 letters. [2022-02-21 04:27:43,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 159 letters. Loop has 37 letters. [2022-02-21 04:27:43,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 159 letters. Loop has 37 letters. [2022-02-21 04:27:43,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 37 letters. [2022-02-21 04:27:43,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 37 letters. [2022-02-21 04:27:43,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 37 letters. [2022-02-21 04:27:43,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 37 letters. [2022-02-21 04:27:43,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 37 letters. [2022-02-21 04:27:43,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 37 letters. [2022-02-21 04:27:43,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:43,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:43,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:43,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 161 letters. Loop has 37 letters. [2022-02-21 04:27:43,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 161 letters. Loop has 37 letters. [2022-02-21 04:27:43,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 161 letters. Loop has 37 letters. [2022-02-21 04:27:43,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 42 letters. [2022-02-21 04:27:43,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 42 letters. [2022-02-21 04:27:43,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 42 letters. [2022-02-21 04:27:43,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:43,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:43,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:43,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 162 letters. Loop has 37 letters. [2022-02-21 04:27:43,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 162 letters. Loop has 37 letters. [2022-02-21 04:27:43,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 162 letters. Loop has 37 letters. [2022-02-21 04:27:43,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 163 letters. Loop has 37 letters. [2022-02-21 04:27:43,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 163 letters. Loop has 37 letters. [2022-02-21 04:27:43,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 163 letters. Loop has 37 letters. [2022-02-21 04:27:43,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 43 letters. [2022-02-21 04:27:43,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 43 letters. [2022-02-21 04:27:43,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 43 letters. [2022-02-21 04:27:43,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 43 letters. [2022-02-21 04:27:43,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 43 letters. [2022-02-21 04:27:43,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 43 letters. [2022-02-21 04:27:43,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 155 letters. Loop has 37 letters. [2022-02-21 04:27:43,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 155 letters. Loop has 37 letters. [2022-02-21 04:27:43,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 155 letters. Loop has 37 letters. [2022-02-21 04:27:43,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 156 letters. Loop has 37 letters. [2022-02-21 04:27:43,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 156 letters. Loop has 37 letters. [2022-02-21 04:27:43,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 156 letters. Loop has 37 letters. [2022-02-21 04:27:43,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:43,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:43,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:43,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 42 letters. [2022-02-21 04:27:43,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 42 letters. [2022-02-21 04:27:43,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 42 letters. [2022-02-21 04:27:43,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:43,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:43,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:43,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 129 letters. Loop has 41 letters. [2022-02-21 04:27:43,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 129 letters. Loop has 41 letters. [2022-02-21 04:27:43,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 129 letters. Loop has 41 letters. [2022-02-21 04:27:43,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 43 letters. [2022-02-21 04:27:43,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 43 letters. [2022-02-21 04:27:43,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 43 letters. [2022-02-21 04:27:43,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 131 letters. Loop has 41 letters. [2022-02-21 04:27:43,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 131 letters. Loop has 41 letters. [2022-02-21 04:27:43,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 131 letters. Loop has 41 letters. [2022-02-21 04:27:43,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 132 letters. Loop has 42 letters. [2022-02-21 04:27:43,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 42 letters. [2022-02-21 04:27:43,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 132 letters. Loop has 42 letters. [2022-02-21 04:27:43,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 132 letters. Loop has 37 letters. [2022-02-21 04:27:43,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 37 letters. [2022-02-21 04:27:43,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 132 letters. Loop has 37 letters. [2022-02-21 04:27:43,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 132 letters. Loop has 41 letters. [2022-02-21 04:27:43,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 41 letters. [2022-02-21 04:27:43,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 132 letters. Loop has 41 letters. [2022-02-21 04:27:43,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 157 letters. Loop has 37 letters. [2022-02-21 04:27:43,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 157 letters. Loop has 37 letters. [2022-02-21 04:27:43,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 157 letters. Loop has 37 letters. [2022-02-21 04:27:43,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 37 letters. [2022-02-21 04:27:43,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 37 letters. [2022-02-21 04:27:43,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 37 letters. [2022-02-21 04:27:43,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 37 letters. [2022-02-21 04:27:43,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 37 letters. [2022-02-21 04:27:43,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 37 letters. [2022-02-21 04:27:43,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 37 letters. [2022-02-21 04:27:43,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 37 letters. [2022-02-21 04:27:43,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 37 letters. [2022-02-21 04:27:43,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 130 letters. Loop has 42 letters. [2022-02-21 04:27:43,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 130 letters. Loop has 42 letters. [2022-02-21 04:27:43,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 130 letters. Loop has 42 letters. [2022-02-21 04:27:43,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:43,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:43,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:43,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 130 letters. Loop has 41 letters. [2022-02-21 04:27:43,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 130 letters. Loop has 41 letters. [2022-02-21 04:27:43,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 130 letters. Loop has 41 letters. [2022-02-21 04:27:43,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:43,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:43,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:43,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 42 letters. [2022-02-21 04:27:43,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 42 letters. [2022-02-21 04:27:43,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 42 letters. [2022-02-21 04:27:43,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 42 letters. [2022-02-21 04:27:43,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 42 letters. [2022-02-21 04:27:43,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 42 letters. [2022-02-21 04:27:43,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 43 letters. [2022-02-21 04:27:43,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 43 letters. [2022-02-21 04:27:43,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 43 letters. [2022-02-21 04:27:43,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 42 letters. [2022-02-21 04:27:43,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 42 letters. [2022-02-21 04:27:43,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 42 letters. [2022-02-21 04:27:43,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:43,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:43,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:43,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 154 letters. Loop has 37 letters. [2022-02-21 04:27:43,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 154 letters. Loop has 37 letters. [2022-02-21 04:27:43,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 154 letters. Loop has 37 letters. [2022-02-21 04:27:43,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 130 letters. Loop has 41 letters. [2022-02-21 04:27:43,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 130 letters. Loop has 41 letters. [2022-02-21 04:27:43,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 130 letters. Loop has 41 letters. [2022-02-21 04:27:43,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 131 letters. Loop has 41 letters. [2022-02-21 04:27:43,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 131 letters. Loop has 41 letters. [2022-02-21 04:27:43,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 131 letters. Loop has 41 letters. [2022-02-21 04:27:43,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 131 letters. Loop has 43 letters. [2022-02-21 04:27:43,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 131 letters. Loop has 43 letters. [2022-02-21 04:27:43,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 131 letters. Loop has 43 letters. [2022-02-21 04:27:43,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:43,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:43,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:43,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:43,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:43,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:43,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:43,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:43,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:43,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 43 letters. [2022-02-21 04:27:43,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 43 letters. [2022-02-21 04:27:43,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 43 letters. [2022-02-21 04:27:43,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 41 letters. [2022-02-21 04:27:43,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 41 letters. [2022-02-21 04:27:43,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 41 letters. [2022-02-21 04:27:43,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:43,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:43,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:43,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 42 letters. [2022-02-21 04:27:43,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 42 letters. [2022-02-21 04:27:43,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 42 letters. [2022-02-21 04:27:43,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 43 letters. [2022-02-21 04:27:43,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 43 letters. [2022-02-21 04:27:43,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 43 letters. [2022-02-21 04:27:43,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:43,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:43,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:43,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 43 letters. [2022-02-21 04:27:43,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 43 letters. [2022-02-21 04:27:43,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 43 letters. [2022-02-21 04:27:43,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 43 letters. [2022-02-21 04:27:43,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 43 letters. [2022-02-21 04:27:43,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 43 letters. [2022-02-21 04:27:43,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 42 letters. [2022-02-21 04:27:43,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 42 letters. [2022-02-21 04:27:43,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 42 letters. [2022-02-21 04:27:43,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 43 letters. [2022-02-21 04:27:43,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 43 letters. [2022-02-21 04:27:43,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 43 letters. [2022-02-21 04:27:43,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 43 letters. [2022-02-21 04:27:43,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 43 letters. [2022-02-21 04:27:43,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 43 letters. [2022-02-21 04:27:43,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 43 letters. [2022-02-21 04:27:43,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 43 letters. [2022-02-21 04:27:43,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 43 letters. [2022-02-21 04:27:43,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 37 letters. [2022-02-21 04:27:43,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 37 letters. [2022-02-21 04:27:43,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 37 letters. [2022-02-21 04:27:43,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:43,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:43,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:43,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 37 letters. [2022-02-21 04:27:43,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 37 letters. [2022-02-21 04:27:43,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 37 letters. [2022-02-21 04:27:43,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 165 letters. Loop has 37 letters. [2022-02-21 04:27:43,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 165 letters. Loop has 37 letters. [2022-02-21 04:27:43,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 165 letters. Loop has 37 letters. [2022-02-21 04:27:43,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:43,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:43,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:43,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 166 letters. Loop has 37 letters. [2022-02-21 04:27:43,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 166 letters. Loop has 37 letters. [2022-02-21 04:27:43,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 166 letters. Loop has 37 letters. [2022-02-21 04:27:43,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 131 letters. Loop has 37 letters. [2022-02-21 04:27:43,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 131 letters. Loop has 37 letters. [2022-02-21 04:27:43,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 131 letters. Loop has 37 letters. [2022-02-21 04:27:43,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 164 letters. Loop has 37 letters. [2022-02-21 04:27:43,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 164 letters. Loop has 37 letters. [2022-02-21 04:27:43,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 164 letters. Loop has 37 letters. [2022-02-21 04:27:43,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 43 letters. [2022-02-21 04:27:43,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 43 letters. [2022-02-21 04:27:43,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 43 letters. [2022-02-21 04:27:43,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 43 letters. [2022-02-21 04:27:43,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 43 letters. [2022-02-21 04:27:43,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 43 letters. [2022-02-21 04:27:43,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:43,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:43,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:43,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:43,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:43,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:43,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 42 letters. [2022-02-21 04:27:43,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 42 letters. [2022-02-21 04:27:43,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 42 letters. [2022-02-21 04:27:43,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 42 letters. [2022-02-21 04:27:43,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 42 letters. [2022-02-21 04:27:43,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 42 letters. [2022-02-21 04:27:43,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:43,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:43,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:43,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 42 letters. [2022-02-21 04:27:43,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 42 letters. [2022-02-21 04:27:43,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 42 letters. [2022-02-21 04:27:43,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 42 letters. [2022-02-21 04:27:43,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 42 letters. [2022-02-21 04:27:43,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 42 letters. [2022-02-21 04:27:43,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 131 letters. Loop has 42 letters. [2022-02-21 04:27:43,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 131 letters. Loop has 42 letters. [2022-02-21 04:27:43,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 131 letters. Loop has 42 letters. [2022-02-21 04:27:43,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:43,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:43,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:43,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 43 letters. [2022-02-21 04:27:43,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 43 letters. [2022-02-21 04:27:43,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 43 letters. [2022-02-21 04:27:43,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 43 letters. [2022-02-21 04:27:43,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 43 letters. [2022-02-21 04:27:43,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 43 letters. [2022-02-21 04:27:43,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 43 letters. [2022-02-21 04:27:43,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 43 letters. [2022-02-21 04:27:43,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 43 letters. [2022-02-21 04:27:43,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 43 letters. [2022-02-21 04:27:43,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 43 letters. [2022-02-21 04:27:43,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 43 letters. [2022-02-21 04:27:43,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:43,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:43,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 42 letters. [2022-02-21 04:27:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 42 letters. [2022-02-21 04:27:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 42 letters. [2022-02-21 04:27:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:43,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:43,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:43,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 130 letters. Loop has 37 letters. [2022-02-21 04:27:43,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 130 letters. Loop has 37 letters. [2022-02-21 04:27:43,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 130 letters. Loop has 37 letters. [2022-02-21 04:27:43,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:43,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:43,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:43,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 43 letters. [2022-02-21 04:27:43,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 43 letters. [2022-02-21 04:27:43,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 43 letters. [2022-02-21 04:27:43,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 43 letters. [2022-02-21 04:27:43,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 43 letters. [2022-02-21 04:27:43,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 43 letters. [2022-02-21 04:27:43,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 132 letters. Loop has 43 letters. [2022-02-21 04:27:43,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 43 letters. [2022-02-21 04:27:43,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 132 letters. Loop has 43 letters. [2022-02-21 04:27:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 132 letters. Loop has 43 letters. [2022-02-21 04:27:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 43 letters. [2022-02-21 04:27:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 132 letters. Loop has 43 letters. [2022-02-21 04:27:43,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 42 letters. [2022-02-21 04:27:43,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 42 letters. [2022-02-21 04:27:43,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 42 letters. [2022-02-21 04:27:43,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:43,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:43,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:43,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 47 letters. [2022-02-21 04:27:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 47 letters. [2022-02-21 04:27:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 47 letters. [2022-02-21 04:27:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 47 letters. [2022-02-21 04:27:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 47 letters. [2022-02-21 04:27:43,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 47 letters. [2022-02-21 04:27:43,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 160 letters. Loop has 37 letters. [2022-02-21 04:27:43,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 160 letters. Loop has 37 letters. [2022-02-21 04:27:43,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 160 letters. Loop has 37 letters. [2022-02-21 04:27:43,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 43 letters. [2022-02-21 04:27:43,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 43 letters. [2022-02-21 04:27:43,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 43 letters. [2022-02-21 04:27:43,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:43,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:43,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:43,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 158 letters. Loop has 41 letters. [2022-02-21 04:27:43,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 158 letters. Loop has 41 letters. [2022-02-21 04:27:43,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 158 letters. Loop has 41 letters. [2022-02-21 04:27:43,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 157 letters. Loop has 41 letters. [2022-02-21 04:27:43,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 157 letters. Loop has 41 letters. [2022-02-21 04:27:43,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 157 letters. Loop has 41 letters. [2022-02-21 04:27:43,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 156 letters. Loop has 41 letters. [2022-02-21 04:27:43,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 156 letters. Loop has 41 letters. [2022-02-21 04:27:43,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 156 letters. Loop has 41 letters. [2022-02-21 04:27:43,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 155 letters. Loop has 41 letters. [2022-02-21 04:27:43,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 155 letters. Loop has 41 letters. [2022-02-21 04:27:43,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 155 letters. Loop has 41 letters. [2022-02-21 04:27:43,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 154 letters. Loop has 41 letters. [2022-02-21 04:27:43,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 154 letters. Loop has 41 letters. [2022-02-21 04:27:43,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 154 letters. Loop has 41 letters. [2022-02-21 04:27:43,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 41 letters. [2022-02-21 04:27:43,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 41 letters. [2022-02-21 04:27:43,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 41 letters. [2022-02-21 04:27:43,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 41 letters. [2022-02-21 04:27:43,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 41 letters. [2022-02-21 04:27:43,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 41 letters. [2022-02-21 04:27:43,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 41 letters. [2022-02-21 04:27:43,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 41 letters. [2022-02-21 04:27:43,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 41 letters. [2022-02-21 04:27:43,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 41 letters. [2022-02-21 04:27:43,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 41 letters. [2022-02-21 04:27:43,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 41 letters. [2022-02-21 04:27:43,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 37 letters. [2022-02-21 04:27:43,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 37 letters. [2022-02-21 04:27:43,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 37 letters. [2022-02-21 04:27:43,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 154 letters. Loop has 45 letters. [2022-02-21 04:27:43,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 154 letters. Loop has 45 letters. [2022-02-21 04:27:43,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 154 letters. Loop has 45 letters. [2022-02-21 04:27:43,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 37 letters. [2022-02-21 04:27:43,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 37 letters. [2022-02-21 04:27:43,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 37 letters. [2022-02-21 04:27:43,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 154 letters. Loop has 46 letters. [2022-02-21 04:27:43,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 154 letters. Loop has 46 letters. [2022-02-21 04:27:43,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 154 letters. Loop has 46 letters. [2022-02-21 04:27:43,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 45 letters. [2022-02-21 04:27:43,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 45 letters. [2022-02-21 04:27:43,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 45 letters. [2022-02-21 04:27:43,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:43,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:43,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:43,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:43,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:43,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:43,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 42 letters. [2022-02-21 04:27:43,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 42 letters. [2022-02-21 04:27:43,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 42 letters. [2022-02-21 04:27:43,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 155 letters. Loop has 47 letters. [2022-02-21 04:27:43,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 155 letters. Loop has 47 letters. [2022-02-21 04:27:43,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 155 letters. Loop has 47 letters. [2022-02-21 04:27:43,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:43,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:43,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:43,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 45 letters. [2022-02-21 04:27:43,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 45 letters. [2022-02-21 04:27:43,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 45 letters. [2022-02-21 04:27:43,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 154 letters. Loop has 47 letters. [2022-02-21 04:27:43,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 154 letters. Loop has 47 letters. [2022-02-21 04:27:43,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 154 letters. Loop has 47 letters. [2022-02-21 04:27:43,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 46 letters. [2022-02-21 04:27:43,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 46 letters. [2022-02-21 04:27:43,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 46 letters. [2022-02-21 04:27:43,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 45 letters. [2022-02-21 04:27:43,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 45 letters. [2022-02-21 04:27:43,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 45 letters. [2022-02-21 04:27:43,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 45 letters. [2022-02-21 04:27:43,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 45 letters. [2022-02-21 04:27:43,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 45 letters. [2022-02-21 04:27:43,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 43 letters. [2022-02-21 04:27:43,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 43 letters. [2022-02-21 04:27:43,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 43 letters. [2022-02-21 04:27:43,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 47 letters. [2022-02-21 04:27:43,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 47 letters. [2022-02-21 04:27:43,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 47 letters. [2022-02-21 04:27:43,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 43 letters. [2022-02-21 04:27:43,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 43 letters. [2022-02-21 04:27:43,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 43 letters. [2022-02-21 04:27:43,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 154 letters. Loop has 47 letters. [2022-02-21 04:27:43,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 154 letters. Loop has 47 letters. [2022-02-21 04:27:43,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 154 letters. Loop has 47 letters. [2022-02-21 04:27:43,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 46 letters. [2022-02-21 04:27:43,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 46 letters. [2022-02-21 04:27:43,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 46 letters. [2022-02-21 04:27:43,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 45 letters. [2022-02-21 04:27:43,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 45 letters. [2022-02-21 04:27:43,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 45 letters. [2022-02-21 04:27:43,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 46 letters. [2022-02-21 04:27:43,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 46 letters. [2022-02-21 04:27:43,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 46 letters. [2022-02-21 04:27:43,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:43,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:43,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:43,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 46 letters. [2022-02-21 04:27:43,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 46 letters. [2022-02-21 04:27:43,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 46 letters. [2022-02-21 04:27:43,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 43 letters. [2022-02-21 04:27:43,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 43 letters. [2022-02-21 04:27:43,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 43 letters. [2022-02-21 04:27:43,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:43,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:43,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:43,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 43 letters. [2022-02-21 04:27:43,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 43 letters. [2022-02-21 04:27:43,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 43 letters. [2022-02-21 04:27:43,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:43,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:43,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:43,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:43,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:43,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:43,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:43,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:43,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:43,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:43,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:43,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:43,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 47 letters. [2022-02-21 04:27:43,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 47 letters. [2022-02-21 04:27:43,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 47 letters. [2022-02-21 04:27:43,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 45 letters. [2022-02-21 04:27:43,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 45 letters. [2022-02-21 04:27:43,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 45 letters. [2022-02-21 04:27:43,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 47 letters. [2022-02-21 04:27:43,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 47 letters. [2022-02-21 04:27:43,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 47 letters. [2022-02-21 04:27:43,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 46 letters. [2022-02-21 04:27:43,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 46 letters. [2022-02-21 04:27:43,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 46 letters. [2022-02-21 04:27:43,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:43,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:43,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:43,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 47 letters. [2022-02-21 04:27:43,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 47 letters. [2022-02-21 04:27:43,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 47 letters. [2022-02-21 04:27:43,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 47 letters. [2022-02-21 04:27:43,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 47 letters. [2022-02-21 04:27:43,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 47 letters. [2022-02-21 04:27:43,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 46 letters. [2022-02-21 04:27:43,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 46 letters. [2022-02-21 04:27:43,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 46 letters. [2022-02-21 04:27:43,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 45 letters. [2022-02-21 04:27:43,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 45 letters. [2022-02-21 04:27:43,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 45 letters. [2022-02-21 04:27:43,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 46 letters. [2022-02-21 04:27:43,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 46 letters. [2022-02-21 04:27:43,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 46 letters. [2022-02-21 04:27:43,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 45 letters. [2022-02-21 04:27:43,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 45 letters. [2022-02-21 04:27:43,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 45 letters. [2022-02-21 04:27:43,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 827 states and 1492 transitions. cyclomatic complexity: 666 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:43,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:43,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:43,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,912 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:27:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-02-21 04:27:43,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 1284 transitions. Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:43,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 1284 transitions. Stem has 168 letters. Loop has 41 letters. [2022-02-21 04:27:43,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 1284 transitions. Stem has 127 letters. Loop has 82 letters. [2022-02-21 04:27:43,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:43,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1107 states and 1958 transitions. cyclomatic complexity: 852 [2022-02-21 04:27:43,956 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:43,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1107 states to 0 states and 0 transitions. [2022-02-21 04:27:43,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:27:43,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:27:43,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:27:43,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:43,957 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:43,957 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:43,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:27:43,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:27:43,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:27:43,958 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:43,958 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:27:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:27:43,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:44,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:27:44,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:27:44,044 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:44,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:27:44,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:27:44,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:27:44,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:27:44,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:44,044 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:44,044 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:44,044 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:44,045 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:27:44,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:27:44,045 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:44,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:27:44,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:27:44 BoogieIcfgContainer [2022-02-21 04:27:44,051 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:27:44,052 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:27:44,052 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:27:44,052 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:27:44,053 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:27:31" (3/4) ... [2022-02-21 04:27:44,054 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:27:44,055 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:27:44,060 INFO L158 Benchmark]: Toolchain (without parser) took 14568.24ms. Allocated memory was 94.4MB in the beginning and 268.4MB in the end (delta: 174.1MB). Free memory was 66.7MB in the beginning and 86.3MB in the end (delta: -19.6MB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. [2022-02-21 04:27:44,060 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:27:44,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.47ms. Allocated memory is still 94.4MB. Free memory was 66.5MB in the beginning and 37.2MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-02-21 04:27:44,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.06ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 37.2MB in the beginning and 86.0MB in the end (delta: -48.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-02-21 04:27:44,061 INFO L158 Benchmark]: Boogie Preprocessor took 101.83ms. Allocated memory is still 117.4MB. Free memory was 85.3MB in the beginning and 76.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:27:44,061 INFO L158 Benchmark]: RCFGBuilder took 1437.06ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 41.1MB in the end (delta: 35.9MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2022-02-21 04:27:44,061 INFO L158 Benchmark]: BuchiAutomizer took 12355.41ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 81.9MB in the beginning and 86.3MB in the end (delta: -4.4MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. [2022-02-21 04:27:44,061 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 268.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:27:44,062 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.17ms. Allocated memory is still 77.6MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.47ms. Allocated memory is still 94.4MB. Free memory was 66.5MB in the beginning and 37.2MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.06ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 37.2MB in the beginning and 86.0MB in the end (delta: -48.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.83ms. Allocated memory is still 117.4MB. Free memory was 85.3MB in the beginning and 76.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1437.06ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 41.1MB in the end (delta: 35.9MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 12355.41ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 81.9MB in the beginning and 86.3MB in the end (delta: -4.4MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 268.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 + -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 12.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 6.0s. Construction of modules took 0.0s. Büchi inclusion checks took 5.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 827 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1471 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1471 mSDsluCounter, 9257 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5397 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 3860 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital266 mio100 ax100 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq231 hnf85 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:27:44,105 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