./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.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.3.ufo.BOUNDED-6.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 3f728e04159b75fd4f86d9e171d07387390897d2fdfdd24db8ac526a2f9d83e1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:26:16,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:26:16,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:26:16,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:26:16,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:26:16,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:26:16,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:26:16,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:26:16,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:26:16,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:26:16,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:26:16,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:26:16,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:26:16,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:26:16,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:26:16,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:26:16,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:26:16,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:26:16,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:26:16,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:26:16,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:26:16,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:26:16,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:26:16,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:26:16,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:26:16,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:26:16,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:26:16,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:26:16,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:26:16,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:26:16,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:26:16,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:26:16,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:26:16,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:26:16,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:26:16,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:26:16,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:26:16,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:26:16,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:26:16,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:26:16,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:26:16,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:26:16,451 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:26:16,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:26:16,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:26:16,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:26:16,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:26:16,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:26:16,453 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:26:16,453 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:26:16,453 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:26:16,453 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:26:16,454 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:26:16,454 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:26:16,454 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:26:16,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:26:16,455 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:26:16,455 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:26:16,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:26:16,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:26:16,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:26:16,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:26:16,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:26:16,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:26:16,456 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:26:16,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:26:16,457 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:26:16,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:26:16,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:26:16,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:26:16,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:26:16,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:26:16,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:26:16,458 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:26:16,458 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 -> 3f728e04159b75fd4f86d9e171d07387390897d2fdfdd24db8ac526a2f9d83e1 [2022-02-21 04:26:16,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:26:16,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:26:16,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:26:16,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:26:16,709 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:26:16,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.c [2022-02-21 04:26:16,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa3e1ec1/18f7720f77bd4365bbf4e495a888904e/FLAG7d351ab55 [2022-02-21 04:26:17,096 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:26:17,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.BOUNDED-6.pals.c [2022-02-21 04:26:17,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa3e1ec1/18f7720f77bd4365bbf4e495a888904e/FLAG7d351ab55 [2022-02-21 04:26:17,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa3e1ec1/18f7720f77bd4365bbf4e495a888904e [2022-02-21 04:26:17,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:26:17,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:26:17,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:26:17,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:26:17,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:26:17,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:26:17" (1/1) ... [2022-02-21 04:26:17,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6639e606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17, skipping insertion in model container [2022-02-21 04:26:17,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:26:17" (1/1) ... [2022-02-21 04:26:17,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:26:17,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:26:17,787 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.3.ufo.BOUNDED-6.pals.c[12762,12775] [2022-02-21 04:26:17,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:26:17,794 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:26:17,843 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.3.ufo.BOUNDED-6.pals.c[12762,12775] [2022-02-21 04:26:17,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:26:17,854 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:26:17,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17 WrapperNode [2022-02-21 04:26:17,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:26:17,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:26:17,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:26:17,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:26:17,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17" (1/1) ... [2022-02-21 04:26:17,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17" (1/1) ... [2022-02-21 04:26:17,920 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2022-02-21 04:26:17,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:26:17,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:26:17,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:26:17,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:26:17,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17" (1/1) ... [2022-02-21 04:26:17,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17" (1/1) ... [2022-02-21 04:26:17,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17" (1/1) ... [2022-02-21 04:26:17,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17" (1/1) ... [2022-02-21 04:26:17,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17" (1/1) ... [2022-02-21 04:26:17,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17" (1/1) ... [2022-02-21 04:26:17,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17" (1/1) ... [2022-02-21 04:26:17,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:26:17,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:26:17,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:26:17,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:26:17,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17" (1/1) ... [2022-02-21 04:26:17,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:17,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:17,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:18,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:26:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:26:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:26:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:26:18,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:26:18,113 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:26:18,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:26:18,542 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:26:18,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:26:18,547 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:26:18,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:26:18 BoogieIcfgContainer [2022-02-21 04:26:18,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:26:18,550 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:26:18,550 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:26:18,552 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:26:18,552 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:26:18,552 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:26:17" (1/3) ... [2022-02-21 04:26:18,553 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32b8f342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:26:18, skipping insertion in model container [2022-02-21 04:26:18,553 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:26:18,554 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:17" (2/3) ... [2022-02-21 04:26:18,554 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32b8f342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:26:18, skipping insertion in model container [2022-02-21 04:26:18,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:26:18,554 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:26:18" (3/3) ... [2022-02-21 04:26:18,555 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c [2022-02-21 04:26:18,585 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:26:18,585 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:26:18,586 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:26:18,586 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:26:18,586 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:26:18,586 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:26:18,586 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:26:18,586 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:26:18,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:18,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-02-21 04:26:18,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:18,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:18,662 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] [2022-02-21 04:26:18,662 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:26:18,662 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:26:18,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:18,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-02-21 04:26:18,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:18,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:18,683 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] [2022-02-21 04:26:18,683 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:26:18,688 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~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; 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 95#L228true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 51#L231-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 34#L241true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 30#L244-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 61#L254true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 64#L257-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 27#L267true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 15#L270-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 102#L280true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 81#L283-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 119#L293true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 79#L296-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 129#L306true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 116#L306-1true init_#res#1 := init_~tmp___5~0#1; 111#L415true main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 53#L509true assume !(0 == main_~i2~0#1); 90#L509-2true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 35#L523-2true [2022-02-21 04:26:18,691 INFO L793 eck$LassoCheckResult]: Loop: 35#L523-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 70#L75true assume !(0 != ~mode1~0 % 256); 66#L100true assume !(~r1~0 < 2); 84#L100-1true ~mode1~0 := 1; 117#L75-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 101#L118true assume !(0 != ~mode2~0 % 256); 105#L143true assume !(~r2~0 < 2); 96#L143-1true ~mode2~0 := 1; 67#L118-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 14#L161true assume !(0 != ~mode3~0 % 256); 74#L186true assume !(~r3~0 < 2); 29#L186-1true ~mode3~0 := 1; 6#L161-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 21#L423true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 71#L423-1true check_#res#1 := check_~tmp~1#1; 28#L471true main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; 87#L553true assume !(0 == assert_~arg#1 % 256); 72#L548true assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 35#L523-2true [2022-02-21 04:26:18,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:18,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 1 times [2022-02-21 04:26:18,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:18,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897071760] [2022-02-21 04:26:18,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:18,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:18,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~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; {134#true} is VALID [2022-02-21 04:26:18,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {134#true} is VALID [2022-02-21 04:26:18,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {134#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {134#true} is VALID [2022-02-21 04:26:18,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {134#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {134#true} is VALID [2022-02-21 04:26:18,919 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {134#true} is VALID [2022-02-21 04:26:18,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {134#true} is VALID [2022-02-21 04:26:18,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {134#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {134#true} is VALID [2022-02-21 04:26:18,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {134#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {134#true} is VALID [2022-02-21 04:26:18,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {134#true} is VALID [2022-02-21 04:26:18,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {134#true} is VALID [2022-02-21 04:26:18,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {134#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {134#true} is VALID [2022-02-21 04:26:18,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {134#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {134#true} is VALID [2022-02-21 04:26:18,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {134#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {134#true} is VALID [2022-02-21 04:26:18,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {134#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {134#true} is VALID [2022-02-21 04:26:18,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {134#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {136#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-21 04:26:18,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {136#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {137#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:26:18,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {137#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {138#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-21 04:26:18,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {138#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {135#false} is VALID [2022-02-21 04:26:18,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {135#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {135#false} is VALID [2022-02-21 04:26:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:26:18,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:18,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897071760] [2022-02-21 04:26:18,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897071760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:18,932 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:18,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:26:18,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902191015] [2022-02-21 04:26:18,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:18,937 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:26:18,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:18,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1518597457, now seen corresponding path program 1 times [2022-02-21 04:26:18,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:18,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164683919] [2022-02-21 04:26:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:19,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {139#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {139#true} is VALID [2022-02-21 04:26:19,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} assume !(0 != ~mode1~0 % 256); {139#true} is VALID [2022-02-21 04:26:19,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#true} assume !(~r1~0 < 2); {139#true} is VALID [2022-02-21 04:26:19,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {139#true} ~mode1~0 := 1; {139#true} is VALID [2022-02-21 04:26:19,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {139#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {139#true} is VALID [2022-02-21 04:26:19,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#true} assume !(0 != ~mode2~0 % 256); {139#true} is VALID [2022-02-21 04:26:19,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {139#true} assume !(~r2~0 < 2); {139#true} is VALID [2022-02-21 04:26:19,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {139#true} ~mode2~0 := 1; {139#true} is VALID [2022-02-21 04:26:19,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {139#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {139#true} is VALID [2022-02-21 04:26:19,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {139#true} assume !(0 != ~mode3~0 % 256); {139#true} is VALID [2022-02-21 04:26:19,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {139#true} assume !(~r3~0 < 2); {139#true} is VALID [2022-02-21 04:26:19,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {139#true} ~mode3~0 := 1; {139#true} is VALID [2022-02-21 04:26:19,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {139#true} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {139#true} is VALID [2022-02-21 04:26:19,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {139#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {141#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:26:19,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {141#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {142#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:26:19,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {143#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:26:19,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {143#(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); {140#false} is VALID [2022-02-21 04:26:19,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {140#false} assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; {140#false} is VALID [2022-02-21 04:26:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:26:19,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:19,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164683919] [2022-02-21 04:26:19,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164683919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:19,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:19,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:26:19,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977297904] [2022-02-21 04:26:19,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:19,096 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:26:19,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:26:19,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:26:19,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:26:19,133 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.751937984496124) internal successors, (226), 129 states have internal predecessors, (226), 0 states have call successors, (0), 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 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:19,566 INFO L93 Difference]: Finished difference Result 134 states and 226 transitions. [2022-02-21 04:26:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:26:19,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:19,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:19,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 226 transitions. [2022-02-21 04:26:19,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-02-21 04:26:19,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 125 states and 210 transitions. [2022-02-21 04:26:19,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-02-21 04:26:19,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-02-21 04:26:19,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 210 transitions. [2022-02-21 04:26:19,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:19,599 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2022-02-21 04:26:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 210 transitions. [2022-02-21 04:26:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-02-21 04:26:19,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:26:19,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states and 210 transitions. Second operand has 125 states, 125 states have (on average 1.68) internal successors, (210), 124 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:19,640 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states and 210 transitions. Second operand has 125 states, 125 states have (on average 1.68) internal successors, (210), 124 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:19,641 INFO L87 Difference]: Start difference. First operand 125 states and 210 transitions. Second operand has 125 states, 125 states have (on average 1.68) internal successors, (210), 124 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:19,645 INFO L93 Difference]: Finished difference Result 125 states and 210 transitions. [2022-02-21 04:26:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 210 transitions. [2022-02-21 04:26:19,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:19,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:19,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 125 states have (on average 1.68) internal successors, (210), 124 states have internal predecessors, (210), 0 states have call successors, (0), 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 125 states and 210 transitions. [2022-02-21 04:26:19,647 INFO L87 Difference]: Start difference. First operand has 125 states, 125 states have (on average 1.68) internal successors, (210), 124 states have internal predecessors, (210), 0 states have call successors, (0), 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 125 states and 210 transitions. [2022-02-21 04:26:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:19,650 INFO L93 Difference]: Finished difference Result 125 states and 210 transitions. [2022-02-21 04:26:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 210 transitions. [2022-02-21 04:26:19,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:19,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:19,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:26:19,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:26:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.68) internal successors, (210), 124 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 210 transitions. [2022-02-21 04:26:19,655 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2022-02-21 04:26:19,655 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 210 transitions. [2022-02-21 04:26:19,655 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:26:19,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 210 transitions. [2022-02-21 04:26:19,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-02-21 04:26:19,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:19,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:19,657 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] [2022-02-21 04:26:19,658 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] [2022-02-21 04:26:19,658 INFO L791 eck$LassoCheckResult]: Stem: 405#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~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; 353#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 354#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 360#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 337#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 295#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 335#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 345#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 331#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 299#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 309#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 381#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 386#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 347#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 385#L306 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 284#L306-1 init_#res#1 := init_~tmp___5~0#1; 403#L415 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 362#L509 assume !(0 == main_~i2~0#1); 363#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 338#L523-2 [2022-02-21 04:26:19,658 INFO L793 eck$LassoCheckResult]: Loop: 338#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 339#L75 assume !(0 != ~mode1~0 % 256); 375#L100 assume !(~r1~0 < 2); 355#L100-1 ~mode1~0 := 1; 328#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 395#L118 assume !(0 != ~mode2~0 % 256); 396#L143 assume !(~r2~0 < 2); 350#L143-1 ~mode2~0 := 1; 377#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 306#L161 assume !(0 != ~mode3~0 % 256); 308#L186 assume !(~r3~0 < 2); 334#L186-1 ~mode3~0 := 1; 287#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 288#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 319#L424 assume ~st1~0 + ~nl1~0 <= 1; 401#L425 assume ~st2~0 + ~nl2~0 <= 1; 402#L426 assume ~st3~0 + ~nl3~0 <= 1; 394#L427 assume ~r1~0 >= 2; 311#L431 assume ~r1~0 < 2; 351#L436 assume ~r1~0 >= 2; 322#L441 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 323#L423-1 check_#res#1 := check_~tmp~1#1; 332#L471 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; 333#L553 assume !(0 == assert_~arg#1 % 256); 379#L548 assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 338#L523-2 [2022-02-21 04:26:19,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 2 times [2022-02-21 04:26:19,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:19,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189474754] [2022-02-21 04:26:19,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:19,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {660#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~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; {660#true} is VALID [2022-02-21 04:26:19,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {660#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {660#true} is VALID [2022-02-21 04:26:19,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {660#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {660#true} is VALID [2022-02-21 04:26:19,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {660#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {660#true} is VALID [2022-02-21 04:26:19,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {660#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {660#true} is VALID [2022-02-21 04:26:19,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {660#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {660#true} is VALID [2022-02-21 04:26:19,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {660#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {660#true} is VALID [2022-02-21 04:26:19,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {660#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {660#true} is VALID [2022-02-21 04:26:19,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {660#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {660#true} is VALID [2022-02-21 04:26:19,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {660#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {660#true} is VALID [2022-02-21 04:26:19,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {660#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {660#true} is VALID [2022-02-21 04:26:19,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {660#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {660#true} is VALID [2022-02-21 04:26:19,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {660#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {660#true} is VALID [2022-02-21 04:26:19,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {660#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {660#true} is VALID [2022-02-21 04:26:19,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {660#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {662#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-21 04:26:19,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {662#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {663#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:26:19,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {663#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {664#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-21 04:26:19,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {661#false} is VALID [2022-02-21 04:26:19,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {661#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {661#false} is VALID [2022-02-21 04:26:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:26:19,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:19,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189474754] [2022-02-21 04:26:19,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189474754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:19,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:19,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:26:19,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120349547] [2022-02-21 04:26:19,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:19,709 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:26:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 1 times [2022-02-21 04:26:19,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:19,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452939279] [2022-02-21 04:26:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:19,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {665#true} is VALID [2022-02-21 04:26:19,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {665#true} assume !(0 != ~mode1~0 % 256); {665#true} is VALID [2022-02-21 04:26:19,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {665#true} assume !(~r1~0 < 2); {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {667#(not (<= ~r1~0 1))} ~mode1~0 := 1; {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {667#(not (<= ~r1~0 1))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#(not (<= ~r1~0 1))} assume !(0 != ~mode2~0 % 256); {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {667#(not (<= ~r1~0 1))} assume !(~r2~0 < 2); {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {667#(not (<= ~r1~0 1))} ~mode2~0 := 1; {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {667#(not (<= ~r1~0 1))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {667#(not (<= ~r1~0 1))} assume !(0 != ~mode3~0 % 256); {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {667#(not (<= ~r1~0 1))} assume !(~r3~0 < 2); {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {667#(not (<= ~r1~0 1))} ~mode3~0 := 1; {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {667#(not (<= ~r1~0 1))} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {667#(not (<= ~r1~0 1))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {667#(not (<= ~r1~0 1))} assume ~st1~0 + ~nl1~0 <= 1; {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {667#(not (<= ~r1~0 1))} assume ~st2~0 + ~nl2~0 <= 1; {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {667#(not (<= ~r1~0 1))} assume ~st3~0 + ~nl3~0 <= 1; {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {667#(not (<= ~r1~0 1))} assume ~r1~0 >= 2; {667#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:19,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {667#(not (<= ~r1~0 1))} assume ~r1~0 < 2; {666#false} is VALID [2022-02-21 04:26:19,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {666#false} assume ~r1~0 >= 2; {666#false} is VALID [2022-02-21 04:26:19,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {666#false} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {666#false} is VALID [2022-02-21 04:26:19,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {666#false} check_#res#1 := check_~tmp~1#1; {666#false} is VALID [2022-02-21 04:26:19,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {666#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {666#false} is VALID [2022-02-21 04:26:19,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {666#false} assume !(0 == assert_~arg#1 % 256); {666#false} is VALID [2022-02-21 04:26:19,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {666#false} assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; {666#false} is VALID [2022-02-21 04:26:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:26:19,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:19,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452939279] [2022-02-21 04:26:19,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452939279] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:19,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:19,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:26:19,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765567737] [2022-02-21 04:26:19,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:19,743 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:26:19,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:26:19,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:26:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:26:19,744 INFO L87 Difference]: Start difference. First operand 125 states and 210 transitions. cyclomatic complexity: 86 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:20,141 INFO L93 Difference]: Finished difference Result 196 states and 320 transitions. [2022-02-21 04:26:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:26:20,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:20,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:20,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 320 transitions. [2022-02-21 04:26:20,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-02-21 04:26:20,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 193 states and 291 transitions. [2022-02-21 04:26:20,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 193 [2022-02-21 04:26:20,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2022-02-21 04:26:20,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 291 transitions. [2022-02-21 04:26:20,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:20,181 INFO L681 BuchiCegarLoop]: Abstraction has 193 states and 291 transitions. [2022-02-21 04:26:20,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 291 transitions. [2022-02-21 04:26:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 125. [2022-02-21 04:26:20,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:26:20,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states and 291 transitions. Second operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:20,193 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states and 291 transitions. Second operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:20,193 INFO L87 Difference]: Start difference. First operand 193 states and 291 transitions. Second operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:20,198 INFO L93 Difference]: Finished difference Result 193 states and 291 transitions. [2022-02-21 04:26:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 291 transitions. [2022-02-21 04:26:20,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:20,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:20,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 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 193 states and 291 transitions. [2022-02-21 04:26:20,203 INFO L87 Difference]: Start difference. First operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 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 193 states and 291 transitions. [2022-02-21 04:26:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:20,207 INFO L93 Difference]: Finished difference Result 193 states and 291 transitions. [2022-02-21 04:26:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 291 transitions. [2022-02-21 04:26:20,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:20,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:20,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:26:20,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:26:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.464) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2022-02-21 04:26:20,211 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2022-02-21 04:26:20,211 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 183 transitions. [2022-02-21 04:26:20,211 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:26:20,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 183 transitions. [2022-02-21 04:26:20,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-02-21 04:26:20,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:20,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:20,218 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] [2022-02-21 04:26:20,218 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] [2022-02-21 04:26:20,219 INFO L791 eck$LassoCheckResult]: Stem: 991#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~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; 939#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 940#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 946#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 923#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 880#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 920#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 931#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 916#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 884#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 894#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 967#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 972#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 933#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 971#L306 assume ~id1~0 != ~id2~0; 975#L307 assume ~id1~0 != ~id3~0; 889#L308 assume ~id2~0 != ~id3~0; 890#L309 assume ~id1~0 >= 0; 974#L310 assume ~id2~0 >= 0; 953#L311 assume ~id3~0 >= 0; 954#L312 assume 0 == ~r1~0; 914#L313 assume 0 == ~r2~0; 915#L314 assume 0 == ~r3~0; 942#L315 assume 0 != init_~r122~0#1 % 256; 943#L316 assume 0 != init_~r132~0#1 % 256; 870#L317 assume 0 != init_~r212~0#1 % 256; 871#L318 assume 0 != init_~r232~0#1 % 256; 992#L319 assume 0 != init_~r312~0#1 % 256; 979#L320 assume 0 != init_~r322~0#1 % 256; 969#L321 assume ~max1~0 == ~id1~0; 970#L322 assume ~max2~0 == ~id2~0; 868#L323 assume ~max3~0 == ~id3~0; 869#L324 assume 0 == ~st1~0; 895#L325 assume 0 == ~st2~0; 922#L326 assume 0 == ~st3~0; 905#L327 assume 0 == ~nl1~0; 906#L328 assume 0 == ~nl2~0; 934#L329 assume 0 == ~nl3~0; 935#L330 assume 0 == ~mode1~0 % 256; 887#L331 assume 0 == ~mode2~0 % 256; 888#L332 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 921#L306-1 init_#res#1 := init_~tmp___5~0#1; 989#L415 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 948#L509 assume !(0 == main_~i2~0#1); 949#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 924#L523-2 [2022-02-21 04:26:20,219 INFO L793 eck$LassoCheckResult]: Loop: 924#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 925#L75 assume !(0 != ~mode1~0 % 256); 961#L100 assume !(~r1~0 < 2); 941#L100-1 ~mode1~0 := 1; 913#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 981#L118 assume !(0 != ~mode2~0 % 256); 982#L143 assume !(~r2~0 < 2); 936#L143-1 ~mode2~0 := 1; 963#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 891#L161 assume !(0 != ~mode3~0 % 256); 893#L186 assume !(~r3~0 < 2); 919#L186-1 ~mode3~0 := 1; 872#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 873#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 904#L424 assume ~st1~0 + ~nl1~0 <= 1; 987#L425 assume ~st2~0 + ~nl2~0 <= 1; 988#L426 assume ~st3~0 + ~nl3~0 <= 1; 980#L427 assume ~r1~0 >= 2; 897#L431 assume ~r1~0 < 2; 937#L436 assume ~r1~0 >= 2; 907#L441 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 908#L423-1 check_#res#1 := check_~tmp~1#1; 917#L471 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; 918#L553 assume !(0 == assert_~arg#1 % 256); 965#L548 assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 924#L523-2 [2022-02-21 04:26:20,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:20,222 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 1 times [2022-02-21 04:26:20,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:20,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799107958] [2022-02-21 04:26:20,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:20,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:26:20,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:26:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:26:20,370 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:26:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:20,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1802356988, now seen corresponding path program 2 times [2022-02-21 04:26:20,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:20,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703471458] [2022-02-21 04:26:20,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:20,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:20,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {1384#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {1384#true} is VALID [2022-02-21 04:26:20,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {1384#true} assume !(0 != ~mode1~0 % 256); {1384#true} is VALID [2022-02-21 04:26:20,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {1384#true} assume !(~r1~0 < 2); {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {1386#(not (<= ~r1~0 1))} ~mode1~0 := 1; {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {1386#(not (<= ~r1~0 1))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {1386#(not (<= ~r1~0 1))} assume !(0 != ~mode2~0 % 256); {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {1386#(not (<= ~r1~0 1))} assume !(~r2~0 < 2); {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {1386#(not (<= ~r1~0 1))} ~mode2~0 := 1; {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {1386#(not (<= ~r1~0 1))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {1386#(not (<= ~r1~0 1))} assume !(0 != ~mode3~0 % 256); {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {1386#(not (<= ~r1~0 1))} assume !(~r3~0 < 2); {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {1386#(not (<= ~r1~0 1))} ~mode3~0 := 1; {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {1386#(not (<= ~r1~0 1))} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {1386#(not (<= ~r1~0 1))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {1386#(not (<= ~r1~0 1))} assume ~st1~0 + ~nl1~0 <= 1; {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {1386#(not (<= ~r1~0 1))} assume ~st2~0 + ~nl2~0 <= 1; {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {1386#(not (<= ~r1~0 1))} assume ~st3~0 + ~nl3~0 <= 1; {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#(not (<= ~r1~0 1))} assume ~r1~0 >= 2; {1386#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:26:20,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {1386#(not (<= ~r1~0 1))} assume ~r1~0 < 2; {1385#false} is VALID [2022-02-21 04:26:20,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {1385#false} assume ~r1~0 >= 2; {1385#false} is VALID [2022-02-21 04:26:20,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {1385#false} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {1385#false} is VALID [2022-02-21 04:26:20,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {1385#false} check_#res#1 := check_~tmp~1#1; {1385#false} is VALID [2022-02-21 04:26:20,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {1385#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {1385#false} is VALID [2022-02-21 04:26:20,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {1385#false} assume !(0 == assert_~arg#1 % 256); {1385#false} is VALID [2022-02-21 04:26:20,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {1385#false} assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; {1385#false} is VALID [2022-02-21 04:26:20,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:26:20,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:20,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703471458] [2022-02-21 04:26:20,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703471458] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:20,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:20,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:26:20,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481727765] [2022-02-21 04:26:20,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:20,413 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:26:20,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:26:20,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:26:20,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:26:20,414 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. cyclomatic complexity: 59 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:20,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:20,575 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2022-02-21 04:26:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:26:20,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:20,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:20,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 260 transitions. [2022-02-21 04:26:20,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2022-02-21 04:26:20,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 177 states and 260 transitions. [2022-02-21 04:26:20,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2022-02-21 04:26:20,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2022-02-21 04:26:20,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 260 transitions. [2022-02-21 04:26:20,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:20,614 INFO L681 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2022-02-21 04:26:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 260 transitions. [2022-02-21 04:26:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-02-21 04:26:20,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:26:20,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states and 260 transitions. Second operand has 177 states, 177 states have (on average 1.4689265536723164) internal successors, (260), 176 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:20,618 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states and 260 transitions. Second operand has 177 states, 177 states have (on average 1.4689265536723164) internal successors, (260), 176 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:20,618 INFO L87 Difference]: Start difference. First operand 177 states and 260 transitions. Second operand has 177 states, 177 states have (on average 1.4689265536723164) internal successors, (260), 176 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:20,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:20,621 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2022-02-21 04:26:20,621 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 260 transitions. [2022-02-21 04:26:20,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:20,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:20,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 177 states have (on average 1.4689265536723164) internal successors, (260), 176 states have internal predecessors, (260), 0 states have call successors, (0), 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 177 states and 260 transitions. [2022-02-21 04:26:20,622 INFO L87 Difference]: Start difference. First operand has 177 states, 177 states have (on average 1.4689265536723164) internal successors, (260), 176 states have internal predecessors, (260), 0 states have call successors, (0), 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 177 states and 260 transitions. [2022-02-21 04:26:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:20,626 INFO L93 Difference]: Finished difference Result 177 states and 260 transitions. [2022-02-21 04:26:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 260 transitions. [2022-02-21 04:26:20,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:20,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:20,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:26:20,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:26:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 177 states have (on average 1.4689265536723164) internal successors, (260), 176 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 260 transitions. [2022-02-21 04:26:20,629 INFO L704 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2022-02-21 04:26:20,630 INFO L587 BuchiCegarLoop]: Abstraction has 177 states and 260 transitions. [2022-02-21 04:26:20,630 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:26:20,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 260 transitions. [2022-02-21 04:26:20,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2022-02-21 04:26:20,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:20,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:20,631 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] [2022-02-21 04:26:20,631 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] [2022-02-21 04:26:20,632 INFO L791 eck$LassoCheckResult]: Stem: 1703#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~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; 1636#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 1637#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1643#L231-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 1619#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1576#L244-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 1616#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 1627#L257-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 1611#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 1580#L270-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 1590#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 1667#L283-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1675#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 1629#L296-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1672#L306 assume ~id1~0 != ~id2~0; 1677#L307 assume ~id1~0 != ~id3~0; 1585#L308 assume ~id2~0 != ~id3~0; 1586#L309 assume ~id1~0 >= 0; 1676#L310 assume ~id2~0 >= 0; 1650#L311 assume ~id3~0 >= 0; 1651#L312 assume 0 == ~r1~0; 1609#L313 assume 0 == ~r2~0; 1610#L314 assume 0 == ~r3~0; 1639#L315 assume 0 != init_~r122~0#1 % 256; 1640#L316 assume 0 != init_~r132~0#1 % 256; 1566#L317 assume 0 != init_~r212~0#1 % 256; 1567#L318 assume 0 != init_~r232~0#1 % 256; 1705#L319 assume 0 != init_~r312~0#1 % 256; 1683#L320 assume 0 != init_~r322~0#1 % 256; 1669#L321 assume ~max1~0 == ~id1~0; 1670#L322 assume ~max2~0 == ~id2~0; 1564#L323 assume ~max3~0 == ~id3~0; 1565#L324 assume 0 == ~st1~0; 1593#L325 assume 0 == ~st2~0; 1618#L326 assume 0 == ~st3~0; 1601#L327 assume 0 == ~nl1~0; 1602#L328 assume 0 == ~nl2~0; 1630#L329 assume 0 == ~nl3~0; 1631#L330 assume 0 == ~mode1~0 % 256; 1583#L331 assume 0 == ~mode2~0 % 256; 1584#L332 assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; 1617#L306-1 init_#res#1 := init_~tmp___5~0#1; 1697#L415 main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; 1645#L509 assume !(0 == main_~i2~0#1); 1646#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1682#L523-2 [2022-02-21 04:26:20,632 INFO L793 eck$LassoCheckResult]: Loop: 1682#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; 1707#L75 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); 1664#L77 assume !(0 != ~ep21~0 % 256); 1582#L77-1 assume !(0 != ~ep31~0 % 256); 1658#L84 assume !(2 == ~r1~0); 1702#L91 ~mode1~0 := 0; 1735#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; 1733#L118 assume !(0 != ~mode2~0 % 256); 1731#L143 assume !(~r2~0 < 2); 1729#L143-1 ~mode2~0 := 1; 1724#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; 1721#L161 assume !(0 != ~mode3~0 % 256); 1719#L186 assume !(~r3~0 < 2); 1716#L186-1 ~mode3~0 := 1; 1568#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1569#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1600#L424 assume ~st1~0 + ~nl1~0 <= 1; 1698#L425 assume ~st2~0 + ~nl2~0 <= 1; 1700#L426 assume ~st3~0 + ~nl3~0 <= 1; 1701#L427 assume !(~r1~0 >= 2); 1591#L430 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1592#L431 assume ~r1~0 < 2; 1712#L436 assume !(~r1~0 >= 2); 1691#L440 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1692#L441 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 1711#L423-1 check_#res#1 := check_~tmp~1#1; 1710#L471 main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; 1709#L553 assume !(0 == assert_~arg#1 % 256); 1708#L548 assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; 1682#L523-2 [2022-02-21 04:26:20,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:20,633 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 2 times [2022-02-21 04:26:20,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:20,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449359609] [2022-02-21 04:26:20,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:20,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:26:20,656 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:26:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:26:20,689 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:26:20,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:20,690 INFO L85 PathProgramCache]: Analyzing trace with hash 253975039, now seen corresponding path program 1 times [2022-02-21 04:26:20,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:20,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792740666] [2022-02-21 04:26:20,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:20,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:26:20,701 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:26:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:26:20,710 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:26:20,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:20,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1206422721, now seen corresponding path program 1 times [2022-02-21 04:26:20,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:20,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410961450] [2022-02-21 04:26:20,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:20,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:20,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {2102#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~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; {2102#true} is VALID [2022-02-21 04:26:20,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2102#true} is VALID [2022-02-21 04:26:20,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {2102#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2102#true} is VALID [2022-02-21 04:26:20,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {2102#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2102#true} is VALID [2022-02-21 04:26:20,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {2102#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2102#true} is VALID [2022-02-21 04:26:20,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2102#true} is VALID [2022-02-21 04:26:20,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {2102#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2102#true} is VALID [2022-02-21 04:26:20,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {2102#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2102#true} is VALID [2022-02-21 04:26:20,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {2102#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2102#true} is VALID [2022-02-21 04:26:20,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {2102#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2102#true} is VALID [2022-02-21 04:26:20,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {2102#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2102#true} is VALID [2022-02-21 04:26:20,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {2102#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2102#true} is VALID [2022-02-21 04:26:20,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {2102#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2102#true} is VALID [2022-02-21 04:26:20,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {2102#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2102#true} is VALID [2022-02-21 04:26:20,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {2102#true} assume ~id1~0 != ~id2~0; {2102#true} is VALID [2022-02-21 04:26:20,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {2102#true} assume ~id1~0 != ~id3~0; {2102#true} is VALID [2022-02-21 04:26:20,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {2102#true} assume ~id2~0 != ~id3~0; {2102#true} is VALID [2022-02-21 04:26:20,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {2102#true} assume ~id1~0 >= 0; {2102#true} is VALID [2022-02-21 04:26:20,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {2102#true} assume ~id2~0 >= 0; {2102#true} is VALID [2022-02-21 04:26:20,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {2102#true} assume ~id3~0 >= 0; {2102#true} is VALID [2022-02-21 04:26:20,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {2102#true} assume 0 == ~r1~0; {2102#true} is VALID [2022-02-21 04:26:20,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {2102#true} assume 0 == ~r2~0; {2102#true} is VALID [2022-02-21 04:26:20,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {2102#true} assume 0 == ~r3~0; {2102#true} is VALID [2022-02-21 04:26:20,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {2102#true} assume 0 != init_~r122~0#1 % 256; {2102#true} is VALID [2022-02-21 04:26:20,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {2102#true} assume 0 != init_~r132~0#1 % 256; {2102#true} is VALID [2022-02-21 04:26:20,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {2102#true} assume 0 != init_~r212~0#1 % 256; {2102#true} is VALID [2022-02-21 04:26:20,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {2102#true} assume 0 != init_~r232~0#1 % 256; {2102#true} is VALID [2022-02-21 04:26:20,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {2102#true} assume 0 != init_~r312~0#1 % 256; {2102#true} is VALID [2022-02-21 04:26:20,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {2102#true} assume 0 != init_~r322~0#1 % 256; {2102#true} is VALID [2022-02-21 04:26:20,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {2102#true} assume ~max1~0 == ~id1~0; {2102#true} is VALID [2022-02-21 04:26:20,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {2102#true} assume ~max2~0 == ~id2~0; {2102#true} is VALID [2022-02-21 04:26:20,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {2102#true} assume ~max3~0 == ~id3~0; {2102#true} is VALID [2022-02-21 04:26:20,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {2102#true} assume 0 == ~st1~0; {2102#true} is VALID [2022-02-21 04:26:20,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {2102#true} assume 0 == ~st2~0; {2102#true} is VALID [2022-02-21 04:26:20,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {2102#true} assume 0 == ~st3~0; {2102#true} is VALID [2022-02-21 04:26:20,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {2102#true} assume 0 == ~nl1~0; {2102#true} is VALID [2022-02-21 04:26:20,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {2102#true} assume 0 == ~nl2~0; {2102#true} is VALID [2022-02-21 04:26:20,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {2102#true} assume 0 == ~nl3~0; {2102#true} is VALID [2022-02-21 04:26:20,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {2102#true} assume 0 == ~mode1~0 % 256; {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:26:20,754 INFO L290 TraceCheckUtils]: 39: Hoare triple {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:26:20,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:26:20,755 INFO L290 TraceCheckUtils]: 41: Hoare triple {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:26:20,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:26:20,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:26:20,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:26:20,756 INFO L290 TraceCheckUtils]: 45: Hoare triple {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:26:20,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {2104#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {2103#false} is VALID [2022-02-21 04:26:20,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {2103#false} assume !(0 != ~ep21~0 % 256); {2103#false} is VALID [2022-02-21 04:26:20,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {2103#false} assume !(0 != ~ep31~0 % 256); {2103#false} is VALID [2022-02-21 04:26:20,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {2103#false} assume !(2 == ~r1~0); {2103#false} is VALID [2022-02-21 04:26:20,758 INFO L290 TraceCheckUtils]: 50: Hoare triple {2103#false} ~mode1~0 := 0; {2103#false} is VALID [2022-02-21 04:26:20,758 INFO L290 TraceCheckUtils]: 51: Hoare triple {2103#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {2103#false} is VALID [2022-02-21 04:26:20,758 INFO L290 TraceCheckUtils]: 52: Hoare triple {2103#false} assume !(0 != ~mode2~0 % 256); {2103#false} is VALID [2022-02-21 04:26:20,758 INFO L290 TraceCheckUtils]: 53: Hoare triple {2103#false} assume !(~r2~0 < 2); {2103#false} is VALID [2022-02-21 04:26:20,758 INFO L290 TraceCheckUtils]: 54: Hoare triple {2103#false} ~mode2~0 := 1; {2103#false} is VALID [2022-02-21 04:26:20,758 INFO L290 TraceCheckUtils]: 55: Hoare triple {2103#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {2103#false} is VALID [2022-02-21 04:26:20,758 INFO L290 TraceCheckUtils]: 56: Hoare triple {2103#false} assume !(0 != ~mode3~0 % 256); {2103#false} is VALID [2022-02-21 04:26:20,758 INFO L290 TraceCheckUtils]: 57: Hoare triple {2103#false} assume !(~r3~0 < 2); {2103#false} is VALID [2022-02-21 04:26:20,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {2103#false} ~mode3~0 := 1; {2103#false} is VALID [2022-02-21 04:26:20,759 INFO L290 TraceCheckUtils]: 59: Hoare triple {2103#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2103#false} is VALID [2022-02-21 04:26:20,759 INFO L290 TraceCheckUtils]: 60: Hoare triple {2103#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2103#false} is VALID [2022-02-21 04:26:20,759 INFO L290 TraceCheckUtils]: 61: Hoare triple {2103#false} assume ~st1~0 + ~nl1~0 <= 1; {2103#false} is VALID [2022-02-21 04:26:20,759 INFO L290 TraceCheckUtils]: 62: Hoare triple {2103#false} assume ~st2~0 + ~nl2~0 <= 1; {2103#false} is VALID [2022-02-21 04:26:20,759 INFO L290 TraceCheckUtils]: 63: Hoare triple {2103#false} assume ~st3~0 + ~nl3~0 <= 1; {2103#false} is VALID [2022-02-21 04:26:20,759 INFO L290 TraceCheckUtils]: 64: Hoare triple {2103#false} assume !(~r1~0 >= 2); {2103#false} is VALID [2022-02-21 04:26:20,760 INFO L290 TraceCheckUtils]: 65: Hoare triple {2103#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2103#false} is VALID [2022-02-21 04:26:20,760 INFO L290 TraceCheckUtils]: 66: Hoare triple {2103#false} assume ~r1~0 < 2; {2103#false} is VALID [2022-02-21 04:26:20,760 INFO L290 TraceCheckUtils]: 67: Hoare triple {2103#false} assume !(~r1~0 >= 2); {2103#false} is VALID [2022-02-21 04:26:20,760 INFO L290 TraceCheckUtils]: 68: Hoare triple {2103#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2103#false} is VALID [2022-02-21 04:26:20,760 INFO L290 TraceCheckUtils]: 69: Hoare triple {2103#false} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {2103#false} is VALID [2022-02-21 04:26:20,760 INFO L290 TraceCheckUtils]: 70: Hoare triple {2103#false} check_#res#1 := check_~tmp~1#1; {2103#false} is VALID [2022-02-21 04:26:20,760 INFO L290 TraceCheckUtils]: 71: Hoare triple {2103#false} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {2103#false} is VALID [2022-02-21 04:26:20,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {2103#false} assume !(0 == assert_~arg#1 % 256); {2103#false} is VALID [2022-02-21 04:26:20,760 INFO L290 TraceCheckUtils]: 73: Hoare triple {2103#false} assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; {2103#false} is VALID [2022-02-21 04:26:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:26:20,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:20,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410961450] [2022-02-21 04:26:20,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410961450] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:20,761 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:20,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:26:20,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127507652] [2022-02-21 04:26:20,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:21,352 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:26:21,352 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:26:21,352 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:26:21,352 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:26:21,352 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:26:21,352 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:21,352 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:26:21,353 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:26:21,353 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-02-21 04:26:21,353 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:26:21,353 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:26:21,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:21,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,007 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:26:22,007 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:26:22,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:22,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:22,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:22,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:26:22,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:26:22,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:26:22,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:22,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:22,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:22,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:22,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:26:22,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:26:22,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:26:22,216 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:26:22,221 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:26:22,221 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:26:22,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:26:22,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:26:22,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:26:22,222 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:26:22,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:22,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:26:22,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:26:22,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-02-21 04:26:22,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:26:22,222 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:26:22,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:22,846 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:26:22,849 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:26:22,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:22,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:22,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:22,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:26:22,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:22,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:22,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:22,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:22,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:22,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:22,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:22,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:22,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:22,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 04:26:22,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:22,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:22,944 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:22,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:26:22,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:22,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:22,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:22,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:22,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:22,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:22,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:22,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:22,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:22,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:22,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:22,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:22,992 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:23,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:26:23,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:23,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:23,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:23,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:23,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:23,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:23,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:23,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:23,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:23,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:23,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:23,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:23,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:23,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:26:23,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:23,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:23,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:23,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:23,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:23,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:23,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:23,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:23,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:23,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:23,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:23,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:23,080 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:23,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:26:23,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:23,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:23,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:23,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:23,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:23,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:23,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:23,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:23,104 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:26:23,108 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:26:23,108 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:26:23,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:23,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:23,110 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:26:23,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:26:23,126 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:26:23,126 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:26:23,127 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2022-02-21 04:26:23,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:26:23,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:23,151 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:26:23,156 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);" "assume !(0 != ~ep21~0 % 256);" "assume !(0 != ~ep31~0 % 256);" "assume !(2 == ~r1~0);" "~mode1~0 := 0;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_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 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume !(~r1~0 >= 2);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0;" "assume ~r1~0 < 2;" "assume !(~r1~0 >= 2);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0;" "assume ~r1~0 < 2;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1;" [2022-02-21 04:26:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:23,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:23,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:26:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:23,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:26:23,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {2105#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(37, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~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; {2105#unseeded} is VALID [2022-02-21 04:26:23,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {2105#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1, main_#t~post39#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~r2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~nl2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~m2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~max2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~r3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~nl3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~m3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~max3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {2105#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2105#unseeded} is VALID [2022-02-21 04:26:23,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {2105#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2105#unseeded} is VALID [2022-02-21 04:26:23,374 INFO L290 TraceCheckUtils]: 4: Hoare triple {2105#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2105#unseeded} is VALID [2022-02-21 04:26:23,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {2105#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2105#unseeded} is VALID [2022-02-21 04:26:23,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {2105#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2105#unseeded} is VALID [2022-02-21 04:26:23,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {2105#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2105#unseeded} is VALID [2022-02-21 04:26:23,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {2105#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2105#unseeded} is VALID [2022-02-21 04:26:23,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {2105#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2105#unseeded} is VALID [2022-02-21 04:26:23,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {2105#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2105#unseeded} is VALID [2022-02-21 04:26:23,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {2105#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2105#unseeded} is VALID [2022-02-21 04:26:23,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {2105#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2105#unseeded} is VALID [2022-02-21 04:26:23,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {2105#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2105#unseeded} is VALID [2022-02-21 04:26:23,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {2105#unseeded} assume ~id1~0 != ~id2~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {2105#unseeded} assume ~id1~0 != ~id3~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {2105#unseeded} assume ~id2~0 != ~id3~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {2105#unseeded} assume ~id1~0 >= 0; {2105#unseeded} is VALID [2022-02-21 04:26:23,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {2105#unseeded} assume ~id2~0 >= 0; {2105#unseeded} is VALID [2022-02-21 04:26:23,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {2105#unseeded} assume ~id3~0 >= 0; {2105#unseeded} is VALID [2022-02-21 04:26:23,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {2105#unseeded} assume 0 == ~r1~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {2105#unseeded} assume 0 == ~r2~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {2105#unseeded} assume 0 == ~r3~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {2105#unseeded} assume 0 != init_~r122~0#1 % 256; {2105#unseeded} is VALID [2022-02-21 04:26:23,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {2105#unseeded} assume 0 != init_~r132~0#1 % 256; {2105#unseeded} is VALID [2022-02-21 04:26:23,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {2105#unseeded} assume 0 != init_~r212~0#1 % 256; {2105#unseeded} is VALID [2022-02-21 04:26:23,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {2105#unseeded} assume 0 != init_~r232~0#1 % 256; {2105#unseeded} is VALID [2022-02-21 04:26:23,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {2105#unseeded} assume 0 != init_~r312~0#1 % 256; {2105#unseeded} is VALID [2022-02-21 04:26:23,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {2105#unseeded} assume 0 != init_~r322~0#1 % 256; {2105#unseeded} is VALID [2022-02-21 04:26:23,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {2105#unseeded} assume ~max1~0 == ~id1~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {2105#unseeded} assume ~max2~0 == ~id2~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {2105#unseeded} assume ~max3~0 == ~id3~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {2105#unseeded} assume 0 == ~st1~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {2105#unseeded} assume 0 == ~st2~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {2105#unseeded} assume 0 == ~st3~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {2105#unseeded} assume 0 == ~nl1~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {2105#unseeded} assume 0 == ~nl2~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {2105#unseeded} assume 0 == ~nl3~0; {2105#unseeded} is VALID [2022-02-21 04:26:23,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {2105#unseeded} assume 0 == ~mode1~0 % 256; {2105#unseeded} is VALID [2022-02-21 04:26:23,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {2105#unseeded} assume 0 == ~mode2~0 % 256; {2105#unseeded} is VALID [2022-02-21 04:26:23,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {2105#unseeded} assume 0 == ~mode3~0 % 256;init_~tmp___5~0#1 := 1; {2105#unseeded} is VALID [2022-02-21 04:26:23,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {2105#unseeded} init_#res#1 := init_~tmp___5~0#1; {2105#unseeded} is VALID [2022-02-21 04:26:23,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {2105#unseeded} main_#t~ret37#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret37#1;havoc main_#t~ret37#1; {2105#unseeded} is VALID [2022-02-21 04:26:23,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {2105#unseeded} assume !(0 == main_~i2~0#1); {2105#unseeded} is VALID [2022-02-21 04:26:23,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {2105#unseeded} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2105#unseeded} is VALID [2022-02-21 04:26:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:23,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:26:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:23,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:26:23,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {2108#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~ep21~0 % 256); {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,648 INFO L290 TraceCheckUtils]: 3: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~ep31~0 % 256); {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,648 INFO L290 TraceCheckUtils]: 4: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(2 == ~r1~0); {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode1~0 := 0; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~mode2~0 % 256); {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r2~0 < 2); {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode2~0 := 1; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~mode3~0 % 256); {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r3~0 < 2); {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode3~0 := 1; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st1~0 + ~nl1~0 <= 1; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st2~0 + ~nl2~0 <= 1; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st3~0 + ~nl3~0 <= 1; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r1~0 >= 2); {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~r1~0 < 2; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r1~0 >= 2); {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} check_#res#1 := check_~tmp~1#1; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} main_#t~ret38#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret38#1;havoc main_#t~ret38#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; {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 == assert_~arg#1 % 256); {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:26:23,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {2255#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_assert } true;main_#t~post39#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post39#1;havoc main_#t~post39#1; {2118#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11))))} is VALID [2022-02-21 04:26:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:26:23,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:23,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:23,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:26:23,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:23,692 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:26:23,693 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 177 states and 260 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:23,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:23,957 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 177 states and 260 transitions. cyclomatic complexity: 84. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 296 states and 445 transitions. Complement of second has 4 states. [2022-02-21 04:26:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:26:23,957 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:26:23,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states and 260 transitions. cyclomatic complexity: 84 [2022-02-21 04:26:23,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:23,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:23,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:23,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:26:23,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:23,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:23,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 445 transitions. [2022-02-21 04:26:23,963 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:26:23,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:26:23,965 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 177 states and 260 transitions. cyclomatic complexity: 84 [2022-02-21 04:26:23,999 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 120 examples of accepted words. [2022-02-21 04:26:23,999 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:24,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:26:24,002 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:26:24,002 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 296 states and 445 transitions. cyclomatic complexity: 150 [2022-02-21 04:26:24,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 445 transitions. cyclomatic complexity: 150 [2022-02-21 04:26:24,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:26:24,002 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:26:24,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:26:24,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:26:24,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:26:24,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:24,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:24,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:24,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 296 letters. Loop has 296 letters. [2022-02-21 04:26:24,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 296 letters. Loop has 296 letters. [2022-02-21 04:26:24,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 296 letters. Loop has 296 letters. [2022-02-21 04:26:24,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 177 letters. Loop has 177 letters. [2022-02-21 04:26:24,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 177 letters. Loop has 177 letters. [2022-02-21 04:26:24,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 177 letters. Loop has 177 letters. [2022-02-21 04:26:24,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:26:24,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:26:24,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:26:24,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:26:24,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:26:24,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:26:24,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:26:24,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:26:24,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:26:24,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:26:24,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:26:24,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:26:24,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:26:24,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:26:24,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:26:24,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:26:24,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:26:24,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:26:24,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:26:24,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:26:24,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:26:24,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:26:24,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:26:24,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:26:24,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 48 letters. Loop has 30 letters. [2022-02-21 04:26:24,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 30 letters. [2022-02-21 04:26:24,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 48 letters. Loop has 30 letters. [2022-02-21 04:26:24,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:26:24,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:26:24,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:26:24,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:26:24,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:26:24,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:26:24,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:26:24,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:26:24,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:26:24,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:26:24,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:26:24,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:26:24,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:26:24,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:26:24,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:26:24,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:26:24,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:26:24,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:26:24,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:26:24,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:26:24,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:26:24,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:26:24,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:26:24,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:26:24,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:26:24,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:26:24,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:26:24,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:26:24,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:26:24,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:26:24,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:26:24,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:26:24,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:26:24,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:26:24,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:26:24,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:26:24,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:26:24,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:26:24,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:26:24,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 66 letters. Loop has 27 letters. [2022-02-21 04:26:24,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 27 letters. [2022-02-21 04:26:24,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 66 letters. Loop has 27 letters. [2022-02-21 04:26:24,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:26:24,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:26:24,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:26:24,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:26:24,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:26:24,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:26:24,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:26:24,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:26:24,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:26:24,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:26:24,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:26:24,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:26:24,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 49 letters. Loop has 27 letters. [2022-02-21 04:26:24,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 27 letters. [2022-02-21 04:26:24,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 49 letters. Loop has 27 letters. [2022-02-21 04:26:24,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 69 letters. Loop has 27 letters. [2022-02-21 04:26:24,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 27 letters. [2022-02-21 04:26:24,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 69 letters. Loop has 27 letters. [2022-02-21 04:26:24,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 70 letters. Loop has 27 letters. [2022-02-21 04:26:24,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 27 letters. [2022-02-21 04:26:24,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 70 letters. Loop has 27 letters. [2022-02-21 04:26:24,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:26:24,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:26:24,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:26:24,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:26:24,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:26:24,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:26:24,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 72 letters. Loop has 27 letters. [2022-02-21 04:26:24,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 27 letters. [2022-02-21 04:26:24,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 72 letters. Loop has 27 letters. [2022-02-21 04:26:24,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 73 letters. Loop has 27 letters. [2022-02-21 04:26:24,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 27 letters. [2022-02-21 04:26:24,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 73 letters. Loop has 27 letters. [2022-02-21 04:26:24,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:26:24,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:26:24,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:26:24,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:26:24,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:26:24,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:26:24,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:26:24,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:26:24,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:26:24,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:26:24,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:26:24,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:26:24,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:26:24,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:26:24,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:26:24,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:26:24,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:26:24,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:26:24,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:26:24,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:26:24,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:26:24,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 68 letters. Loop has 27 letters. [2022-02-21 04:26:24,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 27 letters. [2022-02-21 04:26:24,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 68 letters. Loop has 27 letters. [2022-02-21 04:26:24,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:26:24,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:26:24,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:26:24,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:26:24,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:26:24,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:26:24,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:26:24,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:26:24,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:26:24,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:26:24,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:26:24,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:26:24,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:26:24,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:26:24,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:26:24,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:26:24,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:26:24,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:26:24,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:26:24,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:26:24,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:26:24,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:26:24,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:26:24,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:26:24,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:26:24,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:26:24,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:26:24,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:26:24,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:26:24,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:26:24,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 49 letters. Loop has 30 letters. [2022-02-21 04:26:24,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 30 letters. [2022-02-21 04:26:24,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 49 letters. Loop has 30 letters. [2022-02-21 04:26:24,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:26:24,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:26:24,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:26:24,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 74 letters. Loop has 27 letters. [2022-02-21 04:26:24,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 27 letters. [2022-02-21 04:26:24,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 74 letters. Loop has 27 letters. [2022-02-21 04:26:24,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 48 letters. Loop has 27 letters. [2022-02-21 04:26:24,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 27 letters. [2022-02-21 04:26:24,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 48 letters. Loop has 27 letters. [2022-02-21 04:26:24,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:26:24,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:26:24,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:26:24,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:26:24,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:26:24,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:26:24,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:26:24,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:26:24,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:26:24,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:26:24,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:26:24,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:26:24,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 71 letters. Loop has 27 letters. [2022-02-21 04:26:24,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 27 letters. [2022-02-21 04:26:24,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 71 letters. Loop has 27 letters. [2022-02-21 04:26:24,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:26:24,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:26:24,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:26:24,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:26:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:26:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:26:24,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:26:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:26:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:26:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:26:24,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:26:24,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:26:24,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:26:24,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:26:24,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:26:24,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:26:24,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:26:24,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:26:24,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:26:24,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:26:24,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:26:24,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:26:24,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:26:24,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:26:24,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:26:24,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:26:24,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:26:24,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:26:24,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:26:24,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:26:24,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 27 letters. [2022-02-21 04:26:24,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 27 letters. [2022-02-21 04:26:24,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 50 letters. Loop has 27 letters. [2022-02-21 04:26:24,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:26:24,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:26:24,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:26:24,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:26:24,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:26:24,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:26:24,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 68 letters. Loop has 29 letters. [2022-02-21 04:26:24,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 29 letters. [2022-02-21 04:26:24,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 68 letters. Loop has 29 letters. [2022-02-21 04:26:24,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 69 letters. Loop has 29 letters. [2022-02-21 04:26:24,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 29 letters. [2022-02-21 04:26:24,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 69 letters. Loop has 29 letters. [2022-02-21 04:26:24,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:26:24,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:26:24,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:26:24,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:26:24,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:26:24,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:26:24,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:26:24,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:26:24,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:26:24,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:26:24,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:26:24,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:26:24,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:26:24,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:26:24,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:26:24,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:26:24,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:26:24,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:26:24,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:26:24,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:26:24,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:26:24,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:26:24,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:26:24,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:26:24,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:26:24,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:26:24,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:26:24,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:26:24,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:26:24,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:26:24,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:26:24,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:26:24,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:26:24,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:26:24,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:26:24,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:26:24,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:26:24,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:26:24,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:26:24,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:26:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:26:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:26:24,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 71 letters. Loop has 29 letters. [2022-02-21 04:26:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 29 letters. [2022-02-21 04:26:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 71 letters. Loop has 29 letters. [2022-02-21 04:26:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 70 letters. Loop has 29 letters. [2022-02-21 04:26:24,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 29 letters. [2022-02-21 04:26:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 70 letters. Loop has 29 letters. [2022-02-21 04:26:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 67 letters. Loop has 29 letters. [2022-02-21 04:26:24,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 29 letters. [2022-02-21 04:26:24,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 67 letters. Loop has 29 letters. [2022-02-21 04:26:24,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:26:24,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:26:24,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:26:24,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:26:24,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:26:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:26:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:26:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:26:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:26:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:26:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:26:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:26:24,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:26:24,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:26:24,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:26:24,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:26:24,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:26:24,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:26:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:26:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:26:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:26:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:26:24,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:26:24,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:26:24,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:26:24,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:26:24,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:26:24,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:26:24,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:26:24,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:26:24,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:26:24,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:26:24,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:26:24,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:26:24,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:26:24,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:26:24,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:26:24,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:26:24,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:26:24,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:26:24,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:26:24,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:26:24,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:26:24,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:26:24,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:26:24,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:26:24,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:26:24,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:26:24,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:26:24,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:26:24,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:26:24,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:26:24,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:26:24,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:26:24,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:26:24,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:26:24,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:26:24,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:26:24,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:26:24,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:26:24,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:26:24,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:26:24,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:26:24,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:26:24,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:26:24,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:26:24,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:26:24,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:26:24,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:26:24,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:26:24,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:26:24,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:26:24,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:26:24,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:26:24,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:26:24,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:26:24,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:26:24,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:26:24,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:26:24,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:26:24,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:26:24,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:26:24,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:26:24,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:26:24,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 177 states and 260 transitions. cyclomatic complexity: 84 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:24,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:24,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 296 states and 445 transitions. cyclomatic complexity: 150 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:24,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,140 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:26:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2022-02-21 04:26:24,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:26:24,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 74 letters. Loop has 29 letters. [2022-02-21 04:26:24,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 183 transitions. Stem has 45 letters. Loop has 58 letters. [2022-02-21 04:26:24,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:24,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 445 transitions. cyclomatic complexity: 150 [2022-02-21 04:26:24,150 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:26:24,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 0 states and 0 transitions. [2022-02-21 04:26:24,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:26:24,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:26:24,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:26:24,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:24,150 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:24,150 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:24,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:26:24,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:26:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:26:24,151 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:24,151 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:26:24,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:26:24,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:24,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:24,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:26:24,196 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:26:24,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:26:24,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:26:24,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:26:24,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:26:24,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:24,197 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:24,197 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:24,197 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:24,197 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:26:24,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:26:24,198 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:26:24,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:26:24,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:26:24 BoogieIcfgContainer [2022-02-21 04:26:24,203 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:26:24,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:26:24,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:26:24,204 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:26:24,204 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:26:18" (3/4) ... [2022-02-21 04:26:24,206 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:26:24,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:26:24,207 INFO L158 Benchmark]: Toolchain (without parser) took 6718.67ms. Allocated memory was 81.8MB in the beginning and 155.2MB in the end (delta: 73.4MB). Free memory was 46.2MB in the beginning and 110.2MB in the end (delta: -64.0MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-02-21 04:26:24,207 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:26:24,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.24ms. Allocated memory is still 81.8MB. Free memory was 46.0MB in the beginning and 50.6MB in the end (delta: -4.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:26:24,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.54ms. Allocated memory is still 81.8MB. Free memory was 50.4MB in the beginning and 46.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:26:24,208 INFO L158 Benchmark]: Boogie Preprocessor took 43.16ms. Allocated memory is still 81.8MB. Free memory was 46.8MB in the beginning and 44.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:26:24,208 INFO L158 Benchmark]: RCFGBuilder took 580.88ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 44.5MB in the beginning and 58.5MB in the end (delta: -14.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-02-21 04:26:24,208 INFO L158 Benchmark]: BuchiAutomizer took 5653.14ms. Allocated memory was 98.6MB in the beginning and 155.2MB in the end (delta: 56.6MB). Free memory was 58.5MB in the beginning and 110.2MB in the end (delta: -51.7MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-02-21 04:26:24,209 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 155.2MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:26:24,210 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.24ms. Allocated memory is still 81.8MB. Free memory was 46.0MB in the beginning and 50.6MB in the end (delta: -4.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.54ms. Allocated memory is still 81.8MB. Free memory was 50.4MB in the beginning and 46.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.16ms. Allocated memory is still 81.8MB. Free memory was 46.8MB in the beginning and 44.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 580.88ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 44.5MB in the beginning and 58.5MB in the end (delta: -14.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 5653.14ms. Allocated memory was 98.6MB in the beginning and 155.2MB in the end (delta: 56.6MB). Free memory was 58.5MB in the beginning and 110.2MB in the end (delta: -51.7MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 155.2MB. Free memory is still 110.2MB. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.0s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 68 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 177 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 2294 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1505 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 789 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital160 mio100 ax100 hnf100 lsp23 ukn100 mio100 lsp100 div171 bol100 ite100 ukn100 eq152 hnf97 smp76 dnf105 smp94 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:26:24,252 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