./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d5a83ebadca07865f87524ca234843199e1b35abf1f6d3ef3a25954ede1db9e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:28:33,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:28:33,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:28:33,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:28:33,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:28:33,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:28:33,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:28:33,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:28:33,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:28:33,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:28:33,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:28:33,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:28:33,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:28:33,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:28:33,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:28:33,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:28:33,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:28:33,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:28:33,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:28:33,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:28:33,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:28:33,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:28:33,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:28:33,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:28:33,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:28:33,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:28:33,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:28:33,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:28:33,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:28:33,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:28:33,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:28:33,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:28:33,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:28:33,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:28:33,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:28:33,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:28:33,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:28:33,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:28:33,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:28:33,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:28:33,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:28:33,952 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:28:33,965 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:28:33,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:28:33,966 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:28:33,966 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:28:33,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:28:33,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:28:33,967 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:28:33,967 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:28:33,967 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:28:33,968 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:28:33,968 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:28:33,968 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:28:33,968 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:28:33,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:28:33,968 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:28:33,968 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:28:33,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:28:33,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:28:33,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:28:33,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:28:33,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:28:33,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:28:33,969 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:28:33,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:28:33,970 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:28:33,970 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:28:33,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:28:33,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:28:33,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:28:33,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:28:33,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:28:33,971 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:28:33,972 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 -> 2d5a83ebadca07865f87524ca234843199e1b35abf1f6d3ef3a25954ede1db9e [2022-02-21 04:28:34,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:28:34,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:28:34,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:28:34,186 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:28:34,187 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:28:34,188 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2022-02-21 04:28:34,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/005eff25d/ebacdfc6b2c34a95ae25b46ef15f2416/FLAG2966d3609 [2022-02-21 04:28:34,614 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:28:34,615 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2022-02-21 04:28:34,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/005eff25d/ebacdfc6b2c34a95ae25b46ef15f2416/FLAG2966d3609 [2022-02-21 04:28:34,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/005eff25d/ebacdfc6b2c34a95ae25b46ef15f2416 [2022-02-21 04:28:34,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:28:34,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:28:34,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:34,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:28:34,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:28:34,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:34" (1/1) ... [2022-02-21 04:28:34,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c641a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:34, skipping insertion in model container [2022-02-21 04:28:34,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:34" (1/1) ... [2022-02-21 04:28:34,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:28:34,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:28:34,863 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_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c[12792,12805] [2022-02-21 04:28:34,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:34,870 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:28:34,936 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_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c[12792,12805] [2022-02-21 04:28:34,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:34,948 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:28:34,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:34 WrapperNode [2022-02-21 04:28:34,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:34,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:34,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:28:34,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:28:34,956 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:28:34" (1/1) ... [2022-02-21 04:28:34,964 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:28:34" (1/1) ... [2022-02-21 04:28:34,998 INFO L137 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 373 [2022-02-21 04:28:34,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:34,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:28:35,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:28:35,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:28:35,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:34" (1/1) ... [2022-02-21 04:28:35,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:34" (1/1) ... [2022-02-21 04:28:35,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:34" (1/1) ... [2022-02-21 04:28:35,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:34" (1/1) ... [2022-02-21 04:28:35,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:34" (1/1) ... [2022-02-21 04:28:35,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:34" (1/1) ... [2022-02-21 04:28:35,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:34" (1/1) ... [2022-02-21 04:28:35,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:28:35,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:28:35,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:28:35,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:28:35,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:34" (1/1) ... [2022-02-21 04:28:35,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:35,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:35,058 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:28:35,061 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:28:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:28:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:28:35,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:28:35,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:28:35,154 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:28:35,155 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:28:35,552 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:28:35,558 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:28:35,558 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:28:35,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:35 BoogieIcfgContainer [2022-02-21 04:28:35,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:28:35,561 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:28:35,561 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:28:35,563 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:28:35,564 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:35,564 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:28:34" (1/3) ... [2022-02-21 04:28:35,564 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55e13990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:35, skipping insertion in model container [2022-02-21 04:28:35,565 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:35,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:34" (2/3) ... [2022-02-21 04:28:35,565 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55e13990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:35, skipping insertion in model container [2022-02-21 04:28:35,565 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:35,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:35" (3/3) ... [2022-02-21 04:28:35,566 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2022-02-21 04:28:35,595 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:28:35,596 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:28:35,596 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:28:35,596 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:28:35,596 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:28:35,596 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:28:35,596 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:28:35,596 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:28:35,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 121 states, 120 states have (on average 1.7) internal successors, (204), 120 states have internal predecessors, (204), 0 states have call successors, (0), 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:28:35,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2022-02-21 04:28:35,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:35,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:35,668 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:35,668 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:35,668 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:28:35,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 121 states, 120 states have (on average 1.7) internal successors, (204), 120 states have internal predecessors, (204), 0 states have call successors, (0), 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:28:35,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2022-02-21 04:28:35,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:35,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:35,690 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:35,690 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:35,695 INFO L791 eck$LassoCheckResult]: Stem: 104#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; 31#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 118#L248true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 70#L248-1true init_#res#1 := init_~tmp~0#1; 116#L377true main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 34#L22true assume !(0 == assume_abort_if_not_~cond#1); 87#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 51#L446-2true [2022-02-21 04:28:35,700 INFO L793 eck$LassoCheckResult]: Loop: 51#L446-2true assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 64#L76true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 10#L80true assume !(node1_~m1~0#1 != ~nomsg~0); 102#L80-1true ~mode1~0 := 0; 108#L76-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 99#L113true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 26#L116true assume !(node2_~m2~0#1 != ~nomsg~0); 88#L116-1true ~mode2~0 := 0; 38#L113-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 103#L147true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 89#L150true assume !(node3_~m3~0#1 != ~nomsg~0); 8#L150-1true ~mode3~0 := 0; 78#L147-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 85#L181true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 75#L184true assume !(node4_~m4~0#1 != ~nomsg~0); 109#L184-1true ~mode4~0 := 0; 39#L181-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 120#L215true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 32#L218true assume !(node5_~m5~0#1 != ~nomsg~0); 33#L218-1true ~mode5~0 := 0; 107#L215-2true assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 15#L385true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 105#L385-1true check_#res#1 := check_~tmp~1#1; 113#L397true main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 35#L476true assume !(0 == assert_~arg#1 % 256); 23#L471true assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 51#L446-2true [2022-02-21 04:28:35,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1984313218, now seen corresponding path program 1 times [2022-02-21 04:28:35,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:35,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084186647] [2022-02-21 04:28:35,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:35,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:35,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {125#true} is VALID [2022-02-21 04:28:35,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {125#true} is VALID [2022-02-21 04:28:35,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {127#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:28:35,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {127#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {128#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:28:35,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {128#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {129#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:28:35,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {126#false} is VALID [2022-02-21 04:28:35,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {126#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {126#false} is VALID [2022-02-21 04:28:35,915 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:28:35,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:35,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084186647] [2022-02-21 04:28:35,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084186647] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:35,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:35,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:35,918 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491586782] [2022-02-21 04:28:35,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:35,921 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:35,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:35,924 INFO L85 PathProgramCache]: Analyzing trace with hash 738213390, now seen corresponding path program 1 times [2022-02-21 04:28:35,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:35,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431307810] [2022-02-21 04:28:35,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:35,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:36,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {130#true} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:36,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {130#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:36,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {130#true} assume !(node1_~m1~0#1 != ~nomsg~0); {130#true} is VALID [2022-02-21 04:28:36,145 INFO L290 TraceCheckUtils]: 3: Hoare triple {130#true} ~mode1~0 := 0; {130#true} is VALID [2022-02-21 04:28:36,145 INFO L290 TraceCheckUtils]: 4: Hoare triple {130#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:36,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {130#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:36,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {130#true} assume !(node2_~m2~0#1 != ~nomsg~0); {130#true} is VALID [2022-02-21 04:28:36,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {130#true} ~mode2~0 := 0; {130#true} is VALID [2022-02-21 04:28:36,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {130#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:36,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:36,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#true} assume !(node3_~m3~0#1 != ~nomsg~0); {130#true} is VALID [2022-02-21 04:28:36,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {130#true} ~mode3~0 := 0; {130#true} is VALID [2022-02-21 04:28:36,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {130#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:36,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {130#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:36,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {130#true} assume !(node4_~m4~0#1 != ~nomsg~0); {130#true} is VALID [2022-02-21 04:28:36,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {130#true} ~mode4~0 := 0; {130#true} is VALID [2022-02-21 04:28:36,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {130#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:36,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {130#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:36,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {130#true} assume !(node5_~m5~0#1 != ~nomsg~0); {130#true} is VALID [2022-02-21 04:28:36,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {130#true} ~mode5~0 := 0; {130#true} is VALID [2022-02-21 04:28:36,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {130#true} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {130#true} is VALID [2022-02-21 04:28:36,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {130#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {132#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:36,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {132#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {133#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:36,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {133#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {134#(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:28:36,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {134#(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); {131#false} is VALID [2022-02-21 04:28:36,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {131#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {131#false} is VALID [2022-02-21 04:28:36,154 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:28:36,154 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:36,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431307810] [2022-02-21 04:28:36,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431307810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:36,154 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:36,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:36,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558406816] [2022-02-21 04:28:36,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:36,156 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:36,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:36,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:36,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:36,177 INFO L87 Difference]: Start difference. First operand has 121 states, 120 states have (on average 1.7) internal successors, (204), 120 states have internal predecessors, (204), 0 states have call successors, (0), 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 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:28:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:36,557 INFO L93 Difference]: Finished difference Result 124 states and 203 transitions. [2022-02-21 04:28:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:36,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:28:36,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:36,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 203 transitions. [2022-02-21 04:28:36,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:28:36,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 116 states and 164 transitions. [2022-02-21 04:28:36,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2022-02-21 04:28:36,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2022-02-21 04:28:36,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 164 transitions. [2022-02-21 04:28:36,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:36,594 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 164 transitions. [2022-02-21 04:28:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 164 transitions. [2022-02-21 04:28:36,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-02-21 04:28:36,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:36,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states and 164 transitions. Second operand has 116 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 115 states have internal predecessors, (164), 0 states have call successors, (0), 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:28:36,633 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states and 164 transitions. Second operand has 116 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 115 states have internal predecessors, (164), 0 states have call successors, (0), 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:28:36,635 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 116 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 115 states have internal predecessors, (164), 0 states have call successors, (0), 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:28:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:36,639 INFO L93 Difference]: Finished difference Result 116 states and 164 transitions. [2022-02-21 04:28:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2022-02-21 04:28:36,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:36,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:36,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 115 states have internal predecessors, (164), 0 states have call successors, (0), 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 116 states and 164 transitions. [2022-02-21 04:28:36,642 INFO L87 Difference]: Start difference. First operand has 116 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 115 states have internal predecessors, (164), 0 states have call successors, (0), 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 116 states and 164 transitions. [2022-02-21 04:28:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:36,650 INFO L93 Difference]: Finished difference Result 116 states and 164 transitions. [2022-02-21 04:28:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2022-02-21 04:28:36,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:36,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:36,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:36,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 115 states have internal predecessors, (164), 0 states have call successors, (0), 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:28:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2022-02-21 04:28:36,657 INFO L704 BuchiCegarLoop]: Abstraction has 116 states and 164 transitions. [2022-02-21 04:28:36,657 INFO L587 BuchiCegarLoop]: Abstraction has 116 states and 164 transitions. [2022-02-21 04:28:36,658 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:28:36,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 164 transitions. [2022-02-21 04:28:36,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:28:36,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:36,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:36,666 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] [2022-02-21 04:28:36,667 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:36,672 INFO L791 eck$LassoCheckResult]: Stem: 376#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; 305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 306#L248 assume 0 == ~r1~0; 267#L249 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 268#L250 assume ~id1~0 >= 0; 359#L251 assume 0 == ~st1~0; 323#L252 assume ~send1~0 == ~id1~0; 324#L253 assume 0 == ~mode1~0 % 256; 326#L254 assume ~id2~0 >= 0; 288#L255 assume 0 == ~st2~0; 289#L256 assume ~send2~0 == ~id2~0; 325#L257 assume 0 == ~mode2~0 % 256; 301#L258 assume ~id3~0 >= 0; 302#L259 assume 0 == ~st3~0; 352#L260 assume ~send3~0 == ~id3~0; 353#L261 assume 0 == ~mode3~0 % 256; 331#L262 assume ~id4~0 >= 0; 332#L263 assume 0 == ~st4~0; 340#L264 assume ~send4~0 == ~id4~0; 341#L265 assume 0 == ~mode4~0 % 256; 280#L266 assume ~id5~0 >= 0; 281#L267 assume 0 == ~st5~0; 291#L268 assume ~send5~0 == ~id5~0; 292#L269 assume 0 == ~mode5~0 % 256; 274#L270 assume ~id1~0 != ~id2~0; 275#L271 assume ~id1~0 != ~id3~0; 303#L272 assume ~id1~0 != ~id4~0; 314#L273 assume ~id1~0 != ~id5~0; 338#L274 assume ~id2~0 != ~id3~0; 366#L275 assume ~id2~0 != ~id4~0; 263#L276 assume ~id2~0 != ~id5~0; 264#L277 assume ~id3~0 != ~id4~0; 377#L278 assume ~id3~0 != ~id5~0; 327#L279 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 328#L248-1 init_#res#1 := init_~tmp~0#1; 358#L377 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 312#L22 assume !(0 == assume_abort_if_not_~cond#1); 313#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 294#L446-2 [2022-02-21 04:28:36,672 INFO L793 eck$LassoCheckResult]: Loop: 294#L446-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 336#L76 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 276#L80 assume !(node1_~m1~0#1 != ~nomsg~0); 278#L80-1 ~mode1~0 := 0; 372#L76-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 373#L113 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 298#L116 assume !(node2_~m2~0#1 != ~nomsg~0); 270#L116-1 ~mode2~0 := 0; 296#L113-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 317#L147 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 368#L150 assume !(node3_~m3~0#1 != ~nomsg~0); 272#L150-1 ~mode3~0 := 0; 273#L147-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 364#L181 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 361#L184 assume !(node4_~m4~0#1 != ~nomsg~0); 348#L184-1 ~mode4~0 := 0; 318#L181-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 319#L215 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 307#L218 assume !(node5_~m5~0#1 != ~nomsg~0); 309#L218-1 ~mode5~0 := 0; 310#L215-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 284#L385 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 285#L385-1 check_#res#1 := check_~tmp~1#1; 375#L397 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 311#L476 assume !(0 == assert_~arg#1 % 256); 293#L471 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 294#L446-2 [2022-02-21 04:28:36,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 1 times [2022-02-21 04:28:36,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:36,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401849845] [2022-02-21 04:28:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:36,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:36,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:36,770 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash 738213390, now seen corresponding path program 2 times [2022-02-21 04:28:36,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:36,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933890880] [2022-02-21 04:28:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:36,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:36,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#true} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:36,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:36,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume !(node1_~m1~0#1 != ~nomsg~0); {616#true} is VALID [2022-02-21 04:28:36,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {616#true} ~mode1~0 := 0; {616#true} is VALID [2022-02-21 04:28:36,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {616#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:36,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {616#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:36,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {616#true} assume !(node2_~m2~0#1 != ~nomsg~0); {616#true} is VALID [2022-02-21 04:28:36,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#true} ~mode2~0 := 0; {616#true} is VALID [2022-02-21 04:28:36,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {616#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:36,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {616#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:36,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {616#true} assume !(node3_~m3~0#1 != ~nomsg~0); {616#true} is VALID [2022-02-21 04:28:36,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {616#true} ~mode3~0 := 0; {616#true} is VALID [2022-02-21 04:28:36,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {616#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:36,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {616#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:36,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {616#true} assume !(node4_~m4~0#1 != ~nomsg~0); {616#true} is VALID [2022-02-21 04:28:36,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#true} ~mode4~0 := 0; {616#true} is VALID [2022-02-21 04:28:36,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {616#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:36,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {616#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:36,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {616#true} assume !(node5_~m5~0#1 != ~nomsg~0); {616#true} is VALID [2022-02-21 04:28:36,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {616#true} ~mode5~0 := 0; {616#true} is VALID [2022-02-21 04:28:36,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {616#true} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {616#true} is VALID [2022-02-21 04:28:36,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {616#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {618#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:36,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {618#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {619#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:36,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {619#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {620#(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:28:36,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {620#(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); {617#false} is VALID [2022-02-21 04:28:36,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {617#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {617#false} is VALID [2022-02-21 04:28:36,898 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:28:36,898 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:36,898 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933890880] [2022-02-21 04:28:36,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933890880] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:36,899 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:36,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:36,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342169211] [2022-02-21 04:28:36,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:36,900 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:36,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:36,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:36,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:36,902 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. cyclomatic complexity: 49 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:37,222 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2022-02-21 04:28:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:37,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:37,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:37,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 166 transitions. [2022-02-21 04:28:37,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:28:37,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 116 states and 162 transitions. [2022-02-21 04:28:37,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2022-02-21 04:28:37,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2022-02-21 04:28:37,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 162 transitions. [2022-02-21 04:28:37,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:37,250 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 162 transitions. [2022-02-21 04:28:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 162 transitions. [2022-02-21 04:28:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-02-21 04:28:37,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:37,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states and 162 transitions. Second operand has 116 states, 116 states have (on average 1.396551724137931) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 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:28:37,254 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states and 162 transitions. Second operand has 116 states, 116 states have (on average 1.396551724137931) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 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:28:37,255 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 116 states, 116 states have (on average 1.396551724137931) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 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:28:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:37,257 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2022-02-21 04:28:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-02-21 04:28:37,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:37,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:37,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 116 states have (on average 1.396551724137931) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 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 116 states and 162 transitions. [2022-02-21 04:28:37,259 INFO L87 Difference]: Start difference. First operand has 116 states, 116 states have (on average 1.396551724137931) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 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 116 states and 162 transitions. [2022-02-21 04:28:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:37,262 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2022-02-21 04:28:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-02-21 04:28:37,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:37,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:37,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:37,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:37,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.396551724137931) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 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:28:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2022-02-21 04:28:37,266 INFO L704 BuchiCegarLoop]: Abstraction has 116 states and 162 transitions. [2022-02-21 04:28:37,266 INFO L587 BuchiCegarLoop]: Abstraction has 116 states and 162 transitions. [2022-02-21 04:28:37,266 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:28:37,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 162 transitions. [2022-02-21 04:28:37,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:28:37,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:37,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:37,282 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] [2022-02-21 04:28:37,282 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] [2022-02-21 04:28:37,282 INFO L791 eck$LassoCheckResult]: Stem: 856#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; 786#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 787#L248 assume 0 == ~r1~0; 748#L249 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 749#L250 assume ~id1~0 >= 0; 840#L251 assume 0 == ~st1~0; 804#L252 assume ~send1~0 == ~id1~0; 805#L253 assume 0 == ~mode1~0 % 256; 807#L254 assume ~id2~0 >= 0; 769#L255 assume 0 == ~st2~0; 770#L256 assume ~send2~0 == ~id2~0; 806#L257 assume 0 == ~mode2~0 % 256; 782#L258 assume ~id3~0 >= 0; 783#L259 assume 0 == ~st3~0; 833#L260 assume ~send3~0 == ~id3~0; 834#L261 assume 0 == ~mode3~0 % 256; 812#L262 assume ~id4~0 >= 0; 813#L263 assume 0 == ~st4~0; 821#L264 assume ~send4~0 == ~id4~0; 822#L265 assume 0 == ~mode4~0 % 256; 761#L266 assume ~id5~0 >= 0; 762#L267 assume 0 == ~st5~0; 772#L268 assume ~send5~0 == ~id5~0; 773#L269 assume 0 == ~mode5~0 % 256; 755#L270 assume ~id1~0 != ~id2~0; 756#L271 assume ~id1~0 != ~id3~0; 784#L272 assume ~id1~0 != ~id4~0; 795#L273 assume ~id1~0 != ~id5~0; 819#L274 assume ~id2~0 != ~id3~0; 847#L275 assume ~id2~0 != ~id4~0; 744#L276 assume ~id2~0 != ~id5~0; 745#L277 assume ~id3~0 != ~id4~0; 858#L278 assume ~id3~0 != ~id5~0; 808#L279 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 809#L248-1 init_#res#1 := init_~tmp~0#1; 839#L377 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 792#L22 assume !(0 == assume_abort_if_not_~cond#1); 793#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 777#L446-2 [2022-02-21 04:28:37,283 INFO L793 eck$LassoCheckResult]: Loop: 777#L446-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 817#L76 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 757#L80 assume !(node1_~m1~0#1 != ~nomsg~0); 759#L80-1 ~mode1~0 := 0; 853#L76-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 854#L113 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 779#L116 assume !(node2_~m2~0#1 != ~nomsg~0); 751#L116-1 ~mode2~0 := 0; 775#L113-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 798#L147 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 849#L150 assume !(node3_~m3~0#1 != ~nomsg~0); 753#L150-1 ~mode3~0 := 0; 754#L147-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 845#L181 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 842#L184 assume !(node4_~m4~0#1 != ~nomsg~0); 829#L184-1 ~mode4~0 := 0; 799#L181-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 800#L215 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 788#L218 assume !(node5_~m5~0#1 != ~nomsg~0); 790#L218-1 ~mode5~0 := 0; 791#L215-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 765#L385 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 766#L386 assume ~r1~0 < 5;check_~tmp~1#1 := 1; 768#L385-1 check_#res#1 := check_~tmp~1#1; 857#L397 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 794#L476 assume !(0 == assert_~arg#1 % 256); 776#L471 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 777#L446-2 [2022-02-21 04:28:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 2 times [2022-02-21 04:28:37,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:37,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702376504] [2022-02-21 04:28:37,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:37,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:37,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:37,357 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:37,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:37,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1026451556, now seen corresponding path program 1 times [2022-02-21 04:28:37,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:37,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332466565] [2022-02-21 04:28:37,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:37,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:37,383 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:37,404 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:37,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1906603762, now seen corresponding path program 1 times [2022-02-21 04:28:37,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:37,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274835786] [2022-02-21 04:28:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:37,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:37,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {1099#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {1099#true} is VALID [2022-02-21 04:28:37,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1099#true} is VALID [2022-02-21 04:28:37,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume 0 == ~r1~0; {1099#true} is VALID [2022-02-21 04:28:37,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {1099#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1099#true} is VALID [2022-02-21 04:28:37,470 INFO L290 TraceCheckUtils]: 4: Hoare triple {1099#true} assume ~id1~0 >= 0; {1099#true} is VALID [2022-02-21 04:28:37,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#true} assume 0 == ~st1~0; {1099#true} is VALID [2022-02-21 04:28:37,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} assume ~send1~0 == ~id1~0; {1099#true} is VALID [2022-02-21 04:28:37,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#true} assume 0 == ~mode1~0 % 256; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:37,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {1101#(= (+ (* (- 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);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:37,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {1100#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1100#false} is VALID [2022-02-21 04:28:37,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {1100#false} ~mode1~0 := 0; {1100#false} is VALID [2022-02-21 04:28:37,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {1100#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:37,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {1100#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:37,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {1100#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1100#false} is VALID [2022-02-21 04:28:37,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {1100#false} ~mode2~0 := 0; {1100#false} is VALID [2022-02-21 04:28:37,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {1100#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:37,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {1100#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:37,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {1100#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1100#false} is VALID [2022-02-21 04:28:37,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {1100#false} ~mode3~0 := 0; {1100#false} is VALID [2022-02-21 04:28:37,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {1100#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:37,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {1100#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:37,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {1100#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1100#false} is VALID [2022-02-21 04:28:37,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {1100#false} ~mode4~0 := 0; {1100#false} is VALID [2022-02-21 04:28:37,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {1100#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:37,503 INFO L290 TraceCheckUtils]: 55: Hoare triple {1100#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:37,504 INFO L290 TraceCheckUtils]: 56: Hoare triple {1100#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1100#false} is VALID [2022-02-21 04:28:37,504 INFO L290 TraceCheckUtils]: 57: Hoare triple {1100#false} ~mode5~0 := 0; {1100#false} is VALID [2022-02-21 04:28:37,511 INFO L290 TraceCheckUtils]: 58: Hoare triple {1100#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1100#false} is VALID [2022-02-21 04:28:37,511 INFO L290 TraceCheckUtils]: 59: Hoare triple {1100#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1100#false} is VALID [2022-02-21 04:28:37,511 INFO L290 TraceCheckUtils]: 60: Hoare triple {1100#false} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {1100#false} is VALID [2022-02-21 04:28:37,512 INFO L290 TraceCheckUtils]: 61: Hoare triple {1100#false} check_#res#1 := check_~tmp~1#1; {1100#false} is VALID [2022-02-21 04:28:37,512 INFO L290 TraceCheckUtils]: 62: Hoare triple {1100#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {1100#false} is VALID [2022-02-21 04:28:37,512 INFO L290 TraceCheckUtils]: 63: Hoare triple {1100#false} assume !(0 == assert_~arg#1 % 256); {1100#false} is VALID [2022-02-21 04:28:37,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {1100#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {1100#false} is VALID [2022-02-21 04:28:37,513 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:28:37,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:37,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274835786] [2022-02-21 04:28:37,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274835786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:37,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:37,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:28:37,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530130534] [2022-02-21 04:28:37,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:38,237 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:38,238 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:38,238 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:38,238 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:38,238 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:28:38,238 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:38,238 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:38,238 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:38,238 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2022-02-21 04:28:38,239 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:38,239 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:38,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,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:28:38,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,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:28:38,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:28:38,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,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:28:38,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,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:28:38,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,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:28:38,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:38,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,006 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:39,007 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:28:39,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:39,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:39,009 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:28:39,010 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:28:39,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:28:39,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:39,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:28:39,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:39,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:39,048 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:28:39,048 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:28:39,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:28:39,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:39,159 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:28:39,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:39,163 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:39,163 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:39,163 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:39,163 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:39,163 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:28:39,163 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:39,163 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:39,163 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:39,163 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2022-02-21 04:28:39,163 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:39,163 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:39,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,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:28:39,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:28:39,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:28:39,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:39,922 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:39,925 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:28:39,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:39,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:39,927 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:28:39,928 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:28:39,929 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:28:39,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:39,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:39,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:39,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:39,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:39,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:39,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:39,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:39,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:39,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:39,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:39,977 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:28:39,978 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:28:39,979 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:28:39,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:39,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:39,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:39,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:39,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:39,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:39,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,029 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:28:40,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,031 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:28:40,032 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:28:40,033 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:28:40,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,070 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:28:40,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,072 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:28:40,072 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:28:40,074 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:28:40,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,106 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:28:40,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,108 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:28:40,109 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:28:40,110 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:28:40,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,149 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:28:40,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,151 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:28:40,152 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:28:40,154 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:28:40,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,195 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:28:40,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,196 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:40,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:28:40,199 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:28:40,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:40,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,243 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:40,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:28:40,245 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:28:40,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,252 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:28:40,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,254 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:28:40,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:40,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,284 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:40,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:28:40,286 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:28:40,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 04:28:40,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,320 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:40,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:28:40,329 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:28:40,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:40,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,368 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:40,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:28:40,371 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:28:40,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 04:28:40,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,409 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:40,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:28:40,411 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:28:40,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:40,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,460 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:40,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:28:40,462 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:28:40,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:40,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,504 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:40,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:28:40,507 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:28:40,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:40,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,533 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:40,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:28:40,535 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:28:40,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:40,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:40,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,571 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:40,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:28:40,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:40,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:40,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:40,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:40,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:40,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:40,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:40,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:40,580 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:28:40,598 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:28:40,598 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:28:40,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:40,600 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:40,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:28:40,605 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:28:40,605 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:28:40,605 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:28:40,606 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 19 Supporting invariants [] [2022-02-21 04:28:40,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 04:28:40,650 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:28:40,655 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~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);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0;" "assume !(node1_~m1~0#1 != ~nomsg~0);" "~mode1~0 := 0;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0#1 != ~nomsg~0);" "~mode2~0 := 0;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0#1 != ~nomsg~0);" "~mode3~0 := 0;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0#1 != ~nomsg~0);" "~mode4~0 := 0;" "assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0;" "assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node5_~m5~0#1 != ~nomsg~0);" "~mode5~0 := 0;" "assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1;" "assume ~r1~0 < 5;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1;" [2022-02-21 04:28:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:40,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:40,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:28:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:40,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:40,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {1102#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {1102#unseeded} is VALID [2022-02-21 04:28:40,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {1102#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1102#unseeded} is VALID [2022-02-21 04:28:40,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {1102#unseeded} assume 0 == ~r1~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {1102#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1102#unseeded} is VALID [2022-02-21 04:28:40,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {1102#unseeded} assume ~id1~0 >= 0; {1102#unseeded} is VALID [2022-02-21 04:28:40,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {1102#unseeded} assume 0 == ~st1~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {1102#unseeded} assume ~send1~0 == ~id1~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {1102#unseeded} assume 0 == ~mode1~0 % 256; {1102#unseeded} is VALID [2022-02-21 04:28:40,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {1102#unseeded} assume ~id2~0 >= 0; {1102#unseeded} is VALID [2022-02-21 04:28:40,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {1102#unseeded} assume 0 == ~st2~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {1102#unseeded} assume ~send2~0 == ~id2~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {1102#unseeded} assume 0 == ~mode2~0 % 256; {1102#unseeded} is VALID [2022-02-21 04:28:40,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {1102#unseeded} assume ~id3~0 >= 0; {1102#unseeded} is VALID [2022-02-21 04:28:40,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {1102#unseeded} assume 0 == ~st3~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {1102#unseeded} assume ~send3~0 == ~id3~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {1102#unseeded} assume 0 == ~mode3~0 % 256; {1102#unseeded} is VALID [2022-02-21 04:28:40,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {1102#unseeded} assume ~id4~0 >= 0; {1102#unseeded} is VALID [2022-02-21 04:28:40,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {1102#unseeded} assume 0 == ~st4~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {1102#unseeded} assume ~send4~0 == ~id4~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {1102#unseeded} assume 0 == ~mode4~0 % 256; {1102#unseeded} is VALID [2022-02-21 04:28:40,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {1102#unseeded} assume ~id5~0 >= 0; {1102#unseeded} is VALID [2022-02-21 04:28:40,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {1102#unseeded} assume 0 == ~st5~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {1102#unseeded} assume ~send5~0 == ~id5~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {1102#unseeded} assume 0 == ~mode5~0 % 256; {1102#unseeded} is VALID [2022-02-21 04:28:40,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {1102#unseeded} assume ~id1~0 != ~id2~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {1102#unseeded} assume ~id1~0 != ~id3~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {1102#unseeded} assume ~id1~0 != ~id4~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {1102#unseeded} assume ~id1~0 != ~id5~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {1102#unseeded} assume ~id2~0 != ~id3~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {1102#unseeded} assume ~id2~0 != ~id4~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {1102#unseeded} assume ~id2~0 != ~id5~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {1102#unseeded} assume ~id3~0 != ~id4~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {1102#unseeded} assume ~id3~0 != ~id5~0; {1102#unseeded} is VALID [2022-02-21 04:28:40,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {1102#unseeded} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1102#unseeded} is VALID [2022-02-21 04:28:40,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {1102#unseeded} init_#res#1 := init_~tmp~0#1; {1102#unseeded} is VALID [2022-02-21 04:28:40,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {1102#unseeded} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1102#unseeded} is VALID [2022-02-21 04:28:40,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {1102#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {1102#unseeded} is VALID [2022-02-21 04:28:40,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {1102#unseeded} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1102#unseeded} is VALID [2022-02-21 04:28:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:40,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:28:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:40,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:41,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#(>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node1_~m1~0#1 != ~nomsg~0); {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode1~0 := 0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node2_~m2~0#1 != ~nomsg~0); {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode2~0 := 0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node3_~m3~0#1 != ~nomsg~0); {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode3~0 := 0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node4_~m4~0#1 != ~nomsg~0); {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode4~0 := 0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node5_~m5~0#1 != ~nomsg~0); {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode5~0 := 0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} check_#res#1 := check_~tmp~1#1; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 == assert_~arg#1 % 256); {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:41,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {1115#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:28:41,078 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:28:41,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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:28:41,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:41,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:41,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,101 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:28:41,101 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 162 transitions. cyclomatic complexity: 47 Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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:28:41,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:41,343 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 162 transitions. cyclomatic complexity: 47. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 194 states and 287 transitions. Complement of second has 4 states. [2022-02-21 04:28:41,343 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:28:41,343 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:41,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 162 transitions. cyclomatic complexity: 47 [2022-02-21 04:28:41,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:41,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:41,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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:28:41,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:41,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:41,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:41,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 287 transitions. [2022-02-21 04:28:41,349 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:41,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:41,350 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 116 states and 162 transitions. cyclomatic complexity: 47 [2022-02-21 04:28:41,383 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 78 examples of accepted words. [2022-02-21 04:28:41,383 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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:28:41,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:41,386 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:28:41,387 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2022-02-21 04:28:41,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2022-02-21 04:28:41,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:41,387 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:28:41,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:41,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:41,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:41,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:41,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:41,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 194 letters. Loop has 194 letters. [2022-02-21 04:28:41,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 194 letters. Loop has 194 letters. [2022-02-21 04:28:41,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 194 letters. Loop has 194 letters. [2022-02-21 04:28:41,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 116 letters. Loop has 116 letters. [2022-02-21 04:28:41,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 116 letters. Loop has 116 letters. [2022-02-21 04:28:41,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 116 letters. Loop has 116 letters. [2022-02-21 04:28:41,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:41,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:41,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:28:41,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:28:41,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 28 letters. [2022-02-21 04:28:41,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 28 letters. [2022-02-21 04:28:41,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:28:41,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:28:41,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 27 letters. [2022-02-21 04:28:41,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:28:41,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 27 letters. [2022-02-21 04:28:41,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:28:41,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:28:41,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:41,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:41,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:41,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:28:41,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:28:41,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:28:41,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 44 letters. Loop has 27 letters. [2022-02-21 04:28:41,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 27 letters. [2022-02-21 04:28:41,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 44 letters. Loop has 27 letters. [2022-02-21 04:28:41,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:28:41,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:28:41,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:28:41,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:28:41,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 43 letters. Loop has 30 letters. [2022-02-21 04:28:41,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 30 letters. [2022-02-21 04:28:41,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 30 letters. [2022-02-21 04:28:41,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:28:41,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:28:41,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 28 letters. [2022-02-21 04:28:41,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 28 letters. [2022-02-21 04:28:41,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:28:41,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:28:41,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:28:41,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:28:41,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:28:41,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:28:41,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:28:41,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:28:41,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:28:41,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:28:41,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 47 letters. Loop has 27 letters. [2022-02-21 04:28:41,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:28:41,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 27 letters. [2022-02-21 04:28:41,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:28:41,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:28:41,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:28:41,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:28:41,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 28 letters. [2022-02-21 04:28:41,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 28 letters. [2022-02-21 04:28:41,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:28:41,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:28:41,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:28:41,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:28:41,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 30 letters. [2022-02-21 04:28:41,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 30 letters. [2022-02-21 04:28:41,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 30 letters. [2022-02-21 04:28:41,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 43 letters. Loop has 30 letters. [2022-02-21 04:28:41,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 30 letters. [2022-02-21 04:28:41,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 30 letters. [2022-02-21 04:28:41,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 44 letters. Loop has 28 letters. [2022-02-21 04:28:41,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 28 letters. [2022-02-21 04:28:41,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 44 letters. Loop has 28 letters. [2022-02-21 04:28:41,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 28 letters. [2022-02-21 04:28:41,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 28 letters. [2022-02-21 04:28:41,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:28:41,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:28:41,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 39 letters. Loop has 27 letters. [2022-02-21 04:28:41,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 27 letters. [2022-02-21 04:28:41,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 39 letters. Loop has 27 letters. [2022-02-21 04:28:41,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:28:41,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:28:41,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:28:41,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:28:41,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:28:41,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:28:41,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:28:41,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:28:41,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 28 letters. [2022-02-21 04:28:41,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 28 letters. [2022-02-21 04:28:41,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 28 letters. [2022-02-21 04:28:41,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 28 letters. [2022-02-21 04:28:41,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:28:41,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:28:41,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:28:41,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:28:41,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:28:41,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:28:41,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:28:41,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:28:41,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:28:41,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:28:41,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:28:41,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:28:41,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:28:41,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:28:41,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:28:41,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:28:41,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 40 letters. Loop has 28 letters. [2022-02-21 04:28:41,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 28 letters. [2022-02-21 04:28:41,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 40 letters. Loop has 28 letters. [2022-02-21 04:28:41,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 52 letters. Loop has 28 letters. [2022-02-21 04:28:41,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 28 letters. [2022-02-21 04:28:41,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 29 letters. [2022-02-21 04:28:41,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 29 letters. [2022-02-21 04:28:41,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 29 letters. [2022-02-21 04:28:41,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:41,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:41,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:41,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 28 letters. [2022-02-21 04:28:41,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 28 letters. [2022-02-21 04:28:41,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:28:41,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:28:41,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 28 letters. [2022-02-21 04:28:41,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 28 letters. [2022-02-21 04:28:41,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 48 letters. Loop has 28 letters. [2022-02-21 04:28:41,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 28 letters. [2022-02-21 04:28:41,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:28:41,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:28:41,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:28:41,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:28:41,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:28:41,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:41,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:41,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:41,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 48 letters. Loop has 27 letters. [2022-02-21 04:28:41,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 27 letters. [2022-02-21 04:28:41,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 28 letters. [2022-02-21 04:28:41,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 28 letters. [2022-02-21 04:28:41,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 28 letters. [2022-02-21 04:28:41,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 28 letters. [2022-02-21 04:28:41,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 28 letters. [2022-02-21 04:28:41,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 28 letters. [2022-02-21 04:28:41,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 30 letters. [2022-02-21 04:28:41,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:28:41,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 30 letters. [2022-02-21 04:28:41,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 27 letters. [2022-02-21 04:28:41,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 27 letters. [2022-02-21 04:28:41,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 27 letters. [2022-02-21 04:28:41,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 43 letters. Loop has 27 letters. [2022-02-21 04:28:41,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 27 letters. [2022-02-21 04:28:41,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 27 letters. [2022-02-21 04:28:41,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 28 letters. [2022-02-21 04:28:41,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 28 letters. [2022-02-21 04:28:41,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:28:41,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:28:41,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 56 letters. Loop has 28 letters. [2022-02-21 04:28:41,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 28 letters. [2022-02-21 04:28:41,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:28:41,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:28:41,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:28:41,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:28:41,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 28 letters. [2022-02-21 04:28:41,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 28 letters. [2022-02-21 04:28:41,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 27 letters. [2022-02-21 04:28:41,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:28:41,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 27 letters. [2022-02-21 04:28:41,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:28:41,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:28:41,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 27 letters. [2022-02-21 04:28:41,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 27 letters. [2022-02-21 04:28:41,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 27 letters. [2022-02-21 04:28:41,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 27 letters. [2022-02-21 04:28:41,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 40 letters. Loop has 27 letters. [2022-02-21 04:28:41,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 27 letters. [2022-02-21 04:28:41,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 40 letters. Loop has 27 letters. [2022-02-21 04:28:41,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 28 letters. [2022-02-21 04:28:41,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 28 letters. [2022-02-21 04:28:41,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 28 letters. [2022-02-21 04:28:41,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 27 letters. [2022-02-21 04:28:41,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 27 letters. [2022-02-21 04:28:41,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 27 letters. [2022-02-21 04:28:41,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 28 letters. [2022-02-21 04:28:41,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 28 letters. [2022-02-21 04:28:41,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:28:41,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:28:41,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:28:41,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:28:41,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:28:41,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:28:41,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:28:41,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:28:41,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 61 letters. Loop has 28 letters. [2022-02-21 04:28:41,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 28 letters. [2022-02-21 04:28:41,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 28 letters. [2022-02-21 04:28:41,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:41,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:28:41,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:41,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,500 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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:28:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-21 04:28:41,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 162 transitions. Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:41,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 162 transitions. Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:28:41,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 162 transitions. Stem has 38 letters. Loop has 54 letters. [2022-02-21 04:28:41,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:41,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2022-02-21 04:28:41,511 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:41,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 0 states and 0 transitions. [2022-02-21 04:28:41,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:41,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:41,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:41,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:41,512 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:41,512 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:41,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:41,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:28:41,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:28:41,515 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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:28:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:41,515 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:28:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:28:41,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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:28:41,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:41,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:28:41,554 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:41,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:28:41,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:41,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:41,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:41,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:41,555 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:41,555 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:41,555 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:41,555 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:28:41,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:28:41,556 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:41,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:41,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:28:41 BoogieIcfgContainer [2022-02-21 04:28:41,562 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:28:41,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:28:41,563 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:28:41,563 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:28:41,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:35" (3/4) ... [2022-02-21 04:28:41,565 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:28:41,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:28:41,567 INFO L158 Benchmark]: Toolchain (without parser) took 6923.74ms. Allocated memory was 79.7MB in the beginning and 132.1MB in the end (delta: 52.4MB). Free memory was 45.9MB in the beginning and 95.5MB in the end (delta: -49.6MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2022-02-21 04:28:41,567 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 55.4MB in the beginning and 55.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:41,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.47ms. Allocated memory is still 79.7MB. Free memory was 45.8MB in the beginning and 48.6MB in the end (delta: -2.8MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2022-02-21 04:28:41,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.23ms. Allocated memory is still 79.7MB. Free memory was 48.6MB in the beginning and 45.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:28:41,573 INFO L158 Benchmark]: Boogie Preprocessor took 24.74ms. Allocated memory is still 79.7MB. Free memory was 45.2MB in the beginning and 42.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:28:41,573 INFO L158 Benchmark]: RCFGBuilder took 535.38ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 42.7MB in the beginning and 55.3MB in the end (delta: -12.5MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2022-02-21 04:28:41,579 INFO L158 Benchmark]: BuchiAutomizer took 6001.71ms. Allocated memory was 96.5MB in the beginning and 132.1MB in the end (delta: 35.7MB). Free memory was 55.3MB in the beginning and 95.5MB in the end (delta: -40.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:41,579 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 132.1MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:41,580 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 55.4MB in the beginning and 55.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.47ms. Allocated memory is still 79.7MB. Free memory was 45.8MB in the beginning and 48.6MB in the end (delta: -2.8MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.23ms. Allocated memory is still 79.7MB. Free memory was 48.6MB in the beginning and 45.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.74ms. Allocated memory is still 79.7MB. Free memory was 45.2MB in the beginning and 42.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 535.38ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 42.7MB in the beginning and 55.3MB in the end (delta: -12.5MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 6001.71ms. Allocated memory was 96.5MB in the beginning and 132.1MB in the end (delta: 35.7MB). Free memory was 55.3MB in the beginning and 95.5MB in the end (delta: -40.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 132.1MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 + -2 * i2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 116 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 1685 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1164 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 521 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax100 hnf100 lsp37 ukn100 mio100 lsp100 div104 bol100 ite100 ukn100 eq218 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:28:41,608 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