./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.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.6.ufo.BOUNDED-12.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 a44e961521da9b8f4535724e185f402d94bec27d495ab6df10e2b3c1ffa4513a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:28:54,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:28:54,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:28:54,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:28:54,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:28:54,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:28:54,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:28:54,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:28:54,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:28:54,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:28:54,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:28:54,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:28:54,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:28:54,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:28:54,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:28:54,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:28:54,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:28:54,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:28:54,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:28:54,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:28:54,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:28:54,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:28:54,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:28:54,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:28:54,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:28:54,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:28:54,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:28:54,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:28:54,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:28:54,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:28:54,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:28:54,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:28:54,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:28:54,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:28:54,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:28:54,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:28:54,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:28:54,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:28:54,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:28:54,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:28:54,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:28:54,812 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:54,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:28:54,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:28:54,840 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:28:54,840 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:28:54,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:28:54,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:28:54,841 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:28:54,842 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:28:54,842 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:28:54,842 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:28:54,842 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:28:54,843 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:28:54,843 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:28:54,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:28:54,843 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:28:54,843 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:28:54,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:28:54,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:28:54,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:28:54,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:28:54,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:28:54,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:28:54,844 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:28:54,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:28:54,845 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:28:54,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:28:54,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:28:54,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:28:54,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:28:54,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:28:54,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:28:54,847 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:28:54,847 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 -> a44e961521da9b8f4535724e185f402d94bec27d495ab6df10e2b3c1ffa4513a [2022-02-21 04:28:55,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:28:55,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:28:55,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:28:55,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:28:55,081 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:28:55,082 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.6.ufo.BOUNDED-12.pals.c [2022-02-21 04:28:55,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a271ff986/33791a3274294144be4209a20c5cd22a/FLAG41854fb22 [2022-02-21 04:28:55,556 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:28:55,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2022-02-21 04:28:55,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a271ff986/33791a3274294144be4209a20c5cd22a/FLAG41854fb22 [2022-02-21 04:28:55,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a271ff986/33791a3274294144be4209a20c5cd22a [2022-02-21 04:28:55,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:28:55,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:28:55,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:55,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:28:55,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:28:55,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:55" (1/1) ... [2022-02-21 04:28:55,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50f5c7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:55, skipping insertion in model container [2022-02-21 04:28:55,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:55" (1/1) ... [2022-02-21 04:28:55,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:28:55,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:28:55,812 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.6.ufo.BOUNDED-12.pals.c[16936,16949] [2022-02-21 04:28:55,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:55,818 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:28:55,859 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.6.ufo.BOUNDED-12.pals.c[16936,16949] [2022-02-21 04:28:55,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:55,872 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:28:55,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:55 WrapperNode [2022-02-21 04:28:55,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:55,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:55,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:28:55,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:28:55,878 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:55" (1/1) ... [2022-02-21 04:28:55,901 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:55" (1/1) ... [2022-02-21 04:28:55,952 INFO L137 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 440 [2022-02-21 04:28:55,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:55,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:28:55,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:28:55,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:28:55,960 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:55" (1/1) ... [2022-02-21 04:28:55,960 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:55" (1/1) ... [2022-02-21 04:28:55,963 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:55" (1/1) ... [2022-02-21 04:28:55,963 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:55" (1/1) ... [2022-02-21 04:28:55,969 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:55" (1/1) ... [2022-02-21 04:28:55,975 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:55" (1/1) ... [2022-02-21 04:28:55,976 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:55" (1/1) ... [2022-02-21 04:28:55,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:28:55,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:28:55,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:28:55,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:28:55,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:55" (1/1) ... [2022-02-21 04:28:55,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:56,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:56,014 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:56,025 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:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:28:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:28:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:28:56,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:28:56,164 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:28:56,166 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:28:56,652 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:28:56,658 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:28:56,661 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:28:56,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:56 BoogieIcfgContainer [2022-02-21 04:28:56,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:28:56,664 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:28:56,664 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:28:56,667 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:28:56,667 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:56,668 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:28:55" (1/3) ... [2022-02-21 04:28:56,668 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@720b1512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:56, skipping insertion in model container [2022-02-21 04:28:56,668 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:56,669 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:55" (2/3) ... [2022-02-21 04:28:56,669 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@720b1512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:56, skipping insertion in model container [2022-02-21 04:28:56,669 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:56,669 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:56" (3/3) ... [2022-02-21 04:28:56,670 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2022-02-21 04:28:56,715 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:28:56,716 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:28:56,716 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:28:56,716 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:28:56,716 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:28:56,716 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:28:56,716 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:28:56,716 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:28:56,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 144 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 143 states have internal predecessors, (245), 0 states have call successors, (0), 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:56,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-02-21 04:28:56,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:56,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:56,803 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:56,804 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:56,804 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:28:56,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 144 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 143 states have internal predecessors, (245), 0 states have call successors, (0), 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:56,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2022-02-21 04:28:56,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:56,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:56,831 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:56,831 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:56,836 INFO L791 eck$LassoCheckResult]: Stem: 123#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(48, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 39#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 27#L288true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 65#L288-1true init_#res#1 := init_~tmp~0#1; 43#L453true main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 41#L22true assume 0 == assume_abort_if_not_~cond#1;assume false; 97#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 86#L529-2true [2022-02-21 04:28:56,842 INFO L793 eck$LassoCheckResult]: Loop: 86#L529-2true assume !!(main_~i2~0#1 < 12);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; 120#L84true 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 94#L88true assume !(node1_~m1~0#1 != ~nomsg~0); 116#L88-1true ~mode1~0 := 0; 26#L84-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; 124#L119true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 50#L122true assume !(node2_~m2~0#1 != ~nomsg~0); 42#L122-1true ~mode2~0 := 0; 45#L119-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; 10#L153true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 134#L156true assume !(node3_~m3~0#1 != ~nomsg~0); 100#L156-1true ~mode3~0 := 0; 128#L153-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; 126#L187true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 61#L190true assume !(node4_~m4~0#1 != ~nomsg~0); 98#L190-1true ~mode4~0 := 0; 85#L187-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; 89#L221true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 78#L224true assume !(node5_~m5~0#1 != ~nomsg~0); 125#L224-1true ~mode5~0 := 0; 59#L221-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 20#L255true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 33#L258true assume !(node6_~m6~0#1 != ~nomsg~0); 13#L258-1true ~mode6~0 := 0; 133#L255-2true assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 5#L461true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 49#L461-1true check_#res#1 := check_~tmp~1#1; 131#L473true main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 84#L562true assume !(0 == assert_~arg#1 % 256); 142#L557true assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 86#L529-2true [2022-02-21 04:28:56,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times [2022-02-21 04:28:56,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:56,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982177492] [2022-02-21 04:28:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:56,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:57,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#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(48, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {148#true} is VALID [2022-02-21 04:28:57,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {148#true} is VALID [2022-02-21 04:28:57,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {148#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {148#true} is VALID [2022-02-21 04:28:57,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {148#true} init_#res#1 := init_~tmp~0#1; {148#true} is VALID [2022-02-21 04:28:57,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {148#true} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {148#true} is VALID [2022-02-21 04:28:57,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {149#false} is VALID [2022-02-21 04:28:57,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {149#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {149#false} is VALID [2022-02-21 04:28:57,010 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:57,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:57,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982177492] [2022-02-21 04:28:57,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982177492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:57,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:57,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:28:57,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486687598] [2022-02-21 04:28:57,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:57,016 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:57,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 1 times [2022-02-21 04:28:57,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:57,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355447759] [2022-02-21 04:28:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:57,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#true} assume !!(main_~i2~0#1 < 12);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; {150#true} is VALID [2022-02-21 04:28:57,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:57,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume !(node1_~m1~0#1 != ~nomsg~0); {150#true} is VALID [2022-02-21 04:28:57,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#true} ~mode1~0 := 0; {150#true} is VALID [2022-02-21 04:28:57,188 INFO L290 TraceCheckUtils]: 4: Hoare triple {150#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; {150#true} is VALID [2022-02-21 04:28:57,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:57,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {150#true} assume !(node2_~m2~0#1 != ~nomsg~0); {150#true} is VALID [2022-02-21 04:28:57,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {150#true} ~mode2~0 := 0; {150#true} is VALID [2022-02-21 04:28:57,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {150#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; {150#true} is VALID [2022-02-21 04:28:57,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:57,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#true} assume !(node3_~m3~0#1 != ~nomsg~0); {150#true} is VALID [2022-02-21 04:28:57,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {150#true} ~mode3~0 := 0; {150#true} is VALID [2022-02-21 04:28:57,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {150#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; {150#true} is VALID [2022-02-21 04:28:57,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {150#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:57,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {150#true} assume !(node4_~m4~0#1 != ~nomsg~0); {150#true} is VALID [2022-02-21 04:28:57,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {150#true} ~mode4~0 := 0; {150#true} is VALID [2022-02-21 04:28:57,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {150#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; {150#true} is VALID [2022-02-21 04:28:57,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {150#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:57,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {150#true} assume !(node5_~m5~0#1 != ~nomsg~0); {150#true} is VALID [2022-02-21 04:28:57,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {150#true} ~mode5~0 := 0; {150#true} is VALID [2022-02-21 04:28:57,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {150#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:57,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {150#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {150#true} is VALID [2022-02-21 04:28:57,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {150#true} assume !(node6_~m6~0#1 != ~nomsg~0); {150#true} is VALID [2022-02-21 04:28:57,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {150#true} ~mode6~0 := 0; {150#true} is VALID [2022-02-21 04:28:57,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {150#true} assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {150#true} is VALID [2022-02-21 04:28:57,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {150#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {152#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:57,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {152#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {153#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:57,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {153#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {154#(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:57,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {154#(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); {151#false} is VALID [2022-02-21 04:28:57,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {151#false} assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {151#false} is VALID [2022-02-21 04:28:57,203 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:57,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:57,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355447759] [2022-02-21 04:28:57,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355447759] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:57,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:57,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:57,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629873846] [2022-02-21 04:28:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:57,206 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:57,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:57,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 04:28:57,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 04:28:57,233 INFO L87 Difference]: Start difference. First operand has 144 states, 143 states have (on average 1.7132867132867133) internal successors, (245), 143 states have internal predecessors, (245), 0 states have call successors, (0), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:57,341 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2022-02-21 04:28:57,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:28:57,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:57,350 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:57,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 242 transitions. [2022-02-21 04:28:57,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-02-21 04:28:57,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 139 states and 237 transitions. [2022-02-21 04:28:57,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-02-21 04:28:57,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-02-21 04:28:57,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 237 transitions. [2022-02-21 04:28:57,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:57,371 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2022-02-21 04:28:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 237 transitions. [2022-02-21 04:28:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-21 04:28:57,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:57,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 237 transitions. Second operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 0 states have call successors, (0), 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:57,397 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 237 transitions. Second operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 0 states have call successors, (0), 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:57,398 INFO L87 Difference]: Start difference. First operand 139 states and 237 transitions. Second operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 0 states have call successors, (0), 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:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:57,402 INFO L93 Difference]: Finished difference Result 139 states and 237 transitions. [2022-02-21 04:28:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 237 transitions. [2022-02-21 04:28:57,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:57,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:57,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 0 states have call successors, (0), 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 139 states and 237 transitions. [2022-02-21 04:28:57,405 INFO L87 Difference]: Start difference. First operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 0 states have call successors, (0), 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 139 states and 237 transitions. [2022-02-21 04:28:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:57,409 INFO L93 Difference]: Finished difference Result 139 states and 237 transitions. [2022-02-21 04:28:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 237 transitions. [2022-02-21 04:28:57,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:57,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:57,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:57,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.7050359712230216) internal successors, (237), 138 states have internal predecessors, (237), 0 states have call successors, (0), 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:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 237 transitions. [2022-02-21 04:28:57,415 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2022-02-21 04:28:57,415 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2022-02-21 04:28:57,415 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:28:57,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 237 transitions. [2022-02-21 04:28:57,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-02-21 04:28:57,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:57,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:57,417 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:57,417 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:57,418 INFO L791 eck$LassoCheckResult]: Stem: 435#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(48, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 365#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 349#L288 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 306#L288-1 init_#res#1 := init_~tmp~0#1; 370#L453 main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 366#L22 assume !(0 == assume_abort_if_not_~cond#1); 367#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 420#L529-2 [2022-02-21 04:28:57,418 INFO L793 eck$LassoCheckResult]: Loop: 420#L529-2 assume !!(main_~i2~0#1 < 12);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; 421#L84 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 425#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 362#L88-1 ~mode1~0 := 0; 347#L84-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; 348#L119 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 376#L122 assume !(node2_~m2~0#1 != ~nomsg~0); 340#L122-1 ~mode2~0 := 0; 330#L119-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; 314#L153 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 315#L156 assume !(node3_~m3~0#1 != ~nomsg~0); 312#L156-1 ~mode3~0 := 0; 429#L153-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; 436#L187 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 387#L190 assume !(node4_~m4~0#1 != ~nomsg~0); 388#L190-1 ~mode4~0 := 0; 418#L187-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; 419#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 410#L224 assume !(node5_~m5~0#1 != ~nomsg~0); 319#L224-1 ~mode5~0 := 0; 382#L221-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 331#L255 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 332#L258 assume !(node6_~m6~0#1 != ~nomsg~0); 322#L258-1 ~mode6~0 := 0; 323#L255-2 assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 301#L461 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 302#L461-1 check_#res#1 := check_~tmp~1#1; 375#L473 main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 416#L562 assume !(0 == assert_~arg#1 % 256); 417#L557 assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 420#L529-2 [2022-02-21 04:28:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times [2022-02-21 04:28:57,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:57,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292276946] [2022-02-21 04:28:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:57,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {719#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(48, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {719#true} is VALID [2022-02-21 04:28:57,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {719#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {719#true} is VALID [2022-02-21 04:28:57,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {719#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {721#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:28:57,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {721#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {722#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:28:57,460 INFO L290 TraceCheckUtils]: 4: Hoare triple {722#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {723#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:28:57,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {723#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {720#false} is VALID [2022-02-21 04:28:57,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {720#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {720#false} is VALID [2022-02-21 04:28:57,461 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:57,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:57,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292276946] [2022-02-21 04:28:57,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292276946] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:57,462 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:57,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:57,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768340148] [2022-02-21 04:28:57,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:57,463 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:57,463 INFO L85 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 2 times [2022-02-21 04:28:57,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:57,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674768582] [2022-02-21 04:28:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:57,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:57,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {724#true} assume !!(main_~i2~0#1 < 12);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; {724#true} is VALID [2022-02-21 04:28:57,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:57,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} assume !(node1_~m1~0#1 != ~nomsg~0); {724#true} is VALID [2022-02-21 04:28:57,555 INFO L290 TraceCheckUtils]: 3: Hoare triple {724#true} ~mode1~0 := 0; {724#true} is VALID [2022-02-21 04:28:57,555 INFO L290 TraceCheckUtils]: 4: Hoare triple {724#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; {724#true} is VALID [2022-02-21 04:28:57,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:57,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {724#true} assume !(node2_~m2~0#1 != ~nomsg~0); {724#true} is VALID [2022-02-21 04:28:57,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {724#true} ~mode2~0 := 0; {724#true} is VALID [2022-02-21 04:28:57,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#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; {724#true} is VALID [2022-02-21 04:28:57,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:57,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {724#true} assume !(node3_~m3~0#1 != ~nomsg~0); {724#true} is VALID [2022-02-21 04:28:57,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {724#true} ~mode3~0 := 0; {724#true} is VALID [2022-02-21 04:28:57,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#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; {724#true} is VALID [2022-02-21 04:28:57,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:57,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#true} assume !(node4_~m4~0#1 != ~nomsg~0); {724#true} is VALID [2022-02-21 04:28:57,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {724#true} ~mode4~0 := 0; {724#true} is VALID [2022-02-21 04:28:57,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#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; {724#true} is VALID [2022-02-21 04:28:57,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:57,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {724#true} assume !(node5_~m5~0#1 != ~nomsg~0); {724#true} is VALID [2022-02-21 04:28:57,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {724#true} ~mode5~0 := 0; {724#true} is VALID [2022-02-21 04:28:57,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:57,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {724#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {724#true} is VALID [2022-02-21 04:28:57,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {724#true} assume !(node6_~m6~0#1 != ~nomsg~0); {724#true} is VALID [2022-02-21 04:28:57,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {724#true} ~mode6~0 := 0; {724#true} is VALID [2022-02-21 04:28:57,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {724#true} assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {724#true} is VALID [2022-02-21 04:28:57,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {724#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {726#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:57,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {726#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {727#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:57,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {727#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {728#(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:57,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {728#(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); {725#false} is VALID [2022-02-21 04:28:57,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {725#false} assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {725#false} is VALID [2022-02-21 04:28:57,562 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:57,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:57,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674768582] [2022-02-21 04:28:57,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674768582] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:57,562 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:57,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:57,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893653210] [2022-02-21 04:28:57,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:57,563 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:57,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:57,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:57,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:57,564 INFO L87 Difference]: Start difference. First operand 139 states and 237 transitions. cyclomatic complexity: 99 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:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:57,957 INFO L93 Difference]: Finished difference Result 142 states and 239 transitions. [2022-02-21 04:28:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:57,957 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:57,981 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:57,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 239 transitions. [2022-02-21 04:28:57,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-02-21 04:28:58,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 196 transitions. [2022-02-21 04:28:58,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-02-21 04:28:58,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-02-21 04:28:58,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 196 transitions. [2022-02-21 04:28:58,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:58,004 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2022-02-21 04:28:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 196 transitions. [2022-02-21 04:28:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-21 04:28:58,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:58,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 196 transitions. Second operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 0 states have call successors, (0), 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:58,009 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 196 transitions. Second operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 0 states have call successors, (0), 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:58,009 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. Second operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 0 states have call successors, (0), 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:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:58,012 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2022-02-21 04:28:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2022-02-21 04:28:58,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:58,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:58,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 0 states have call successors, (0), 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 139 states and 196 transitions. [2022-02-21 04:28:58,013 INFO L87 Difference]: Start difference. First operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 0 states have call successors, (0), 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 139 states and 196 transitions. [2022-02-21 04:28:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:58,015 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2022-02-21 04:28:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2022-02-21 04:28:58,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:58,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:58,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:58,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.410071942446043) internal successors, (196), 138 states have internal predecessors, (196), 0 states have call successors, (0), 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:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 196 transitions. [2022-02-21 04:28:58,019 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2022-02-21 04:28:58,019 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2022-02-21 04:28:58,019 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:28:58,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 196 transitions. [2022-02-21 04:28:58,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-02-21 04:28:58,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:58,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:58,021 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:58,021 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:58,021 INFO L791 eck$LassoCheckResult]: Stem: 1011#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(48, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 940#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 925#L288 assume 0 == ~r1~0; 926#L289 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 935#L290 assume ~id1~0 >= 0; 984#L291 assume 0 == ~st1~0; 985#L292 assume ~send1~0 == ~id1~0; 1000#L293 assume 0 == ~mode1~0 % 256; 1010#L294 assume ~id2~0 >= 0; 884#L295 assume 0 == ~st2~0; 885#L296 assume ~send2~0 == ~id2~0; 934#L297 assume 0 == ~mode2~0 % 256; 931#L298 assume ~id3~0 >= 0; 932#L299 assume 0 == ~st3~0; 938#L300 assume ~send3~0 == ~id3~0; 973#L301 assume 0 == ~mode3~0 % 256; 998#L302 assume ~id4~0 >= 0; 999#L303 assume 0 == ~st4~0; 1004#L304 assume ~send4~0 == ~id4~0; 966#L305 assume 0 == ~mode4~0 % 256; 967#L306 assume ~id5~0 >= 0; 983#L307 assume 0 == ~st5~0; 895#L308 assume ~send5~0 == ~id5~0; 896#L309 assume 0 == ~mode5~0 % 256; 980#L310 assume ~id6~0 >= 0; 952#L311 assume 0 == ~st6~0; 953#L312 assume ~send6~0 == ~id6~0; 917#L313 assume 0 == ~mode6~0 % 256; 918#L314 assume ~id1~0 != ~id2~0; 946#L315 assume ~id1~0 != ~id3~0; 947#L316 assume ~id1~0 != ~id4~0; 882#L317 assume ~id1~0 != ~id5~0; 883#L318 assume ~id1~0 != ~id6~0; 1013#L319 assume ~id2~0 != ~id3~0; 991#L320 assume ~id2~0 != ~id4~0; 968#L321 assume ~id2~0 != ~id5~0; 969#L322 assume ~id2~0 != ~id6~0; 880#L323 assume ~id3~0 != ~id4~0; 881#L324 assume ~id3~0 != ~id5~0; 900#L325 assume ~id3~0 != ~id6~0; 927#L326 assume ~id4~0 != ~id5~0; 912#L327 assume ~id4~0 != ~id6~0; 913#L328 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 970#L288-1 init_#res#1 := init_~tmp~0#1; 943#L453 main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 941#L22 assume !(0 == assume_abort_if_not_~cond#1); 942#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 996#L529-2 [2022-02-21 04:28:58,022 INFO L793 eck$LassoCheckResult]: Loop: 996#L529-2 assume !!(main_~i2~0#1 < 12);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; 997#L84 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1001#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 937#L88-1 ~mode1~0 := 0; 922#L84-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; 923#L119 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 951#L122 assume !(node2_~m2~0#1 != ~nomsg~0); 915#L122-1 ~mode2~0 := 0; 905#L119-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; 889#L153 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 890#L156 assume !(node3_~m3~0#1 != ~nomsg~0); 887#L156-1 ~mode3~0 := 0; 1005#L153-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; 1012#L187 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 962#L190 assume !(node4_~m4~0#1 != ~nomsg~0); 963#L190-1 ~mode4~0 := 0; 994#L187-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; 995#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 986#L224 assume !(node5_~m5~0#1 != ~nomsg~0); 894#L224-1 ~mode5~0 := 0; 960#L221-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 906#L255 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 907#L258 assume !(node6_~m6~0#1 != ~nomsg~0); 897#L258-1 ~mode6~0 := 0; 898#L255-2 assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 877#L461 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 878#L461-1 check_#res#1 := check_~tmp~1#1; 950#L473 main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 992#L562 assume !(0 == assert_~arg#1 % 256); 993#L557 assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 996#L529-2 [2022-02-21 04:28:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times [2022-02-21 04:28:58,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:58,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437597414] [2022-02-21 04:28:58,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:58,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:58,043 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:58,085 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:58,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 3 times [2022-02-21 04:28:58,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:58,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830754992] [2022-02-21 04:28:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:58,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:58,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {1297#true} assume !!(main_~i2~0#1 < 12);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; {1297#true} is VALID [2022-02-21 04:28:58,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:58,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume !(node1_~m1~0#1 != ~nomsg~0); {1297#true} is VALID [2022-02-21 04:28:58,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {1297#true} ~mode1~0 := 0; {1297#true} is VALID [2022-02-21 04:28:58,146 INFO L290 TraceCheckUtils]: 4: Hoare triple {1297#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; {1297#true} is VALID [2022-02-21 04:28:58,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:58,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#true} assume !(node2_~m2~0#1 != ~nomsg~0); {1297#true} is VALID [2022-02-21 04:28:58,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#true} ~mode2~0 := 0; {1297#true} is VALID [2022-02-21 04:28:58,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {1297#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; {1297#true} is VALID [2022-02-21 04:28:58,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {1297#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:58,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {1297#true} assume !(node3_~m3~0#1 != ~nomsg~0); {1297#true} is VALID [2022-02-21 04:28:58,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {1297#true} ~mode3~0 := 0; {1297#true} is VALID [2022-02-21 04:28:58,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {1297#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; {1297#true} is VALID [2022-02-21 04:28:58,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {1297#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:58,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {1297#true} assume !(node4_~m4~0#1 != ~nomsg~0); {1297#true} is VALID [2022-02-21 04:28:58,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {1297#true} ~mode4~0 := 0; {1297#true} is VALID [2022-02-21 04:28:58,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {1297#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; {1297#true} is VALID [2022-02-21 04:28:58,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {1297#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:58,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {1297#true} assume !(node5_~m5~0#1 != ~nomsg~0); {1297#true} is VALID [2022-02-21 04:28:58,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {1297#true} ~mode5~0 := 0; {1297#true} is VALID [2022-02-21 04:28:58,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {1297#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:58,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {1297#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1297#true} is VALID [2022-02-21 04:28:58,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {1297#true} assume !(node6_~m6~0#1 != ~nomsg~0); {1297#true} is VALID [2022-02-21 04:28:58,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {1297#true} ~mode6~0 := 0; {1297#true} is VALID [2022-02-21 04:28:58,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {1297#true} assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1297#true} is VALID [2022-02-21 04:28:58,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {1297#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {1299#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:58,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {1299#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {1300#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:58,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {1300#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {1301#(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:58,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {1301#(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); {1298#false} is VALID [2022-02-21 04:28:58,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {1298#false} assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {1298#false} is VALID [2022-02-21 04:28:58,152 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:58,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:58,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830754992] [2022-02-21 04:28:58,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830754992] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:58,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:58,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:58,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946739940] [2022-02-21 04:28:58,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:58,153 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:58,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:58,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:58,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:58,154 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. cyclomatic complexity: 58 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:58,473 INFO L93 Difference]: Finished difference Result 142 states and 198 transitions. [2022-02-21 04:28:58,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:58,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:58,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:58,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 198 transitions. [2022-02-21 04:28:58,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-02-21 04:28:58,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 194 transitions. [2022-02-21 04:28:58,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-02-21 04:28:58,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-02-21 04:28:58,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 194 transitions. [2022-02-21 04:28:58,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:58,508 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2022-02-21 04:28:58,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 194 transitions. [2022-02-21 04:28:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-02-21 04:28:58,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:58,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 194 transitions. Second operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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:58,512 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 194 transitions. Second operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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:58,512 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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:58,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:58,515 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2022-02-21 04:28:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2022-02-21 04:28:58,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:58,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:58,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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 139 states and 194 transitions. [2022-02-21 04:28:58,516 INFO L87 Difference]: Start difference. First operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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 139 states and 194 transitions. [2022-02-21 04:28:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:58,519 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2022-02-21 04:28:58,519 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2022-02-21 04:28:58,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:58,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:58,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:58,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.39568345323741) internal successors, (194), 138 states have internal predecessors, (194), 0 states have call successors, (0), 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:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2022-02-21 04:28:58,522 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2022-02-21 04:28:58,522 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2022-02-21 04:28:58,522 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:28:58,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 194 transitions. [2022-02-21 04:28:58,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-02-21 04:28:58,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:58,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:58,525 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:58,525 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:58,525 INFO L791 eck$LassoCheckResult]: Stem: 1584#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(48, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 1512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 1496#L288 assume 0 == ~r1~0; 1497#L289 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 1507#L290 assume ~id1~0 >= 0; 1557#L291 assume 0 == ~st1~0; 1558#L292 assume ~send1~0 == ~id1~0; 1573#L293 assume 0 == ~mode1~0 % 256; 1583#L294 assume ~id2~0 >= 0; 1456#L295 assume 0 == ~st2~0; 1457#L296 assume ~send2~0 == ~id2~0; 1506#L297 assume 0 == ~mode2~0 % 256; 1503#L298 assume ~id3~0 >= 0; 1504#L299 assume 0 == ~st3~0; 1510#L300 assume ~send3~0 == ~id3~0; 1546#L301 assume 0 == ~mode3~0 % 256; 1569#L302 assume ~id4~0 >= 0; 1570#L303 assume 0 == ~st4~0; 1577#L304 assume ~send4~0 == ~id4~0; 1538#L305 assume 0 == ~mode4~0 % 256; 1539#L306 assume ~id5~0 >= 0; 1556#L307 assume 0 == ~st5~0; 1464#L308 assume ~send5~0 == ~id5~0; 1465#L309 assume 0 == ~mode5~0 % 256; 1550#L310 assume ~id6~0 >= 0; 1524#L311 assume 0 == ~st6~0; 1525#L312 assume ~send6~0 == ~id6~0; 1489#L313 assume 0 == ~mode6~0 % 256; 1490#L314 assume ~id1~0 != ~id2~0; 1518#L315 assume ~id1~0 != ~id3~0; 1519#L316 assume ~id1~0 != ~id4~0; 1454#L317 assume ~id1~0 != ~id5~0; 1455#L318 assume ~id1~0 != ~id6~0; 1586#L319 assume ~id2~0 != ~id3~0; 1564#L320 assume ~id2~0 != ~id4~0; 1541#L321 assume ~id2~0 != ~id5~0; 1542#L322 assume ~id2~0 != ~id6~0; 1452#L323 assume ~id3~0 != ~id4~0; 1453#L324 assume ~id3~0 != ~id5~0; 1472#L325 assume ~id3~0 != ~id6~0; 1499#L326 assume ~id4~0 != ~id5~0; 1484#L327 assume ~id4~0 != ~id6~0; 1485#L328 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 1543#L288-1 init_#res#1 := init_~tmp~0#1; 1515#L453 main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; 1513#L22 assume !(0 == assume_abort_if_not_~cond#1); 1514#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1571#L529-2 [2022-02-21 04:28:58,525 INFO L793 eck$LassoCheckResult]: Loop: 1571#L529-2 assume !!(main_~i2~0#1 < 12);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; 1572#L84 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1574#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 1509#L88-1 ~mode1~0 := 0; 1494#L84-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; 1495#L119 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1526#L122 assume !(node2_~m2~0#1 != ~nomsg~0); 1487#L122-1 ~mode2~0 := 0; 1477#L119-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; 1461#L153 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1462#L156 assume !(node3_~m3~0#1 != ~nomsg~0); 1459#L156-1 ~mode3~0 := 0; 1578#L153-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; 1585#L187 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1535#L190 assume !(node4_~m4~0#1 != ~nomsg~0); 1536#L190-1 ~mode4~0 := 0; 1567#L187-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; 1568#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1559#L224 assume !(node5_~m5~0#1 != ~nomsg~0); 1468#L224-1 ~mode5~0 := 0; 1533#L221-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 1478#L255 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1479#L258 assume !(node6_~m6~0#1 != ~nomsg~0); 1469#L258-1 ~mode6~0 := 0; 1470#L255-2 assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1450#L461 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 1451#L462 assume ~r1~0 < 6;check_~tmp~1#1 := 1; 1522#L461-1 check_#res#1 := check_~tmp~1#1; 1523#L473 main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; 1565#L562 assume !(0 == assert_~arg#1 % 256); 1566#L557 assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; 1571#L529-2 [2022-02-21 04:28:58,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times [2022-02-21 04:28:58,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:58,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032037360] [2022-02-21 04:28:58,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:58,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:58,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:58,574 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:58,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash 911844111, now seen corresponding path program 1 times [2022-02-21 04:28:58,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:58,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427803512] [2022-02-21 04:28:58,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:58,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:58,585 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:58,599 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:58,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1786874990, now seen corresponding path program 1 times [2022-02-21 04:28:58,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:58,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691749394] [2022-02-21 04:28:58,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:58,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:58,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {1872#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(48, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {1872#true} is VALID [2022-02-21 04:28:58,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {1872#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1872#true} is VALID [2022-02-21 04:28:58,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {1872#true} assume 0 == ~r1~0; {1872#true} is VALID [2022-02-21 04:28:58,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {1872#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1872#true} is VALID [2022-02-21 04:28:58,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {1872#true} assume ~id1~0 >= 0; {1872#true} is VALID [2022-02-21 04:28:58,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {1872#true} assume 0 == ~st1~0; {1872#true} is VALID [2022-02-21 04:28:58,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {1872#true} assume ~send1~0 == ~id1~0; {1872#true} is VALID [2022-02-21 04:28:58,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {1872#true} assume 0 == ~mode1~0 % 256; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,664 INFO L290 TraceCheckUtils]: 38: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,665 INFO L290 TraceCheckUtils]: 40: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,666 INFO L290 TraceCheckUtils]: 41: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,666 INFO L290 TraceCheckUtils]: 43: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,667 INFO L290 TraceCheckUtils]: 45: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,668 INFO L290 TraceCheckUtils]: 46: Hoare triple {1874#(= (+ (* (- 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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,668 INFO L290 TraceCheckUtils]: 47: Hoare triple {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 12);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; {1874#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:58,669 INFO L290 TraceCheckUtils]: 48: Hoare triple {1874#(= (+ (* (- 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:58,669 INFO L290 TraceCheckUtils]: 49: Hoare triple {1873#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1873#false} is VALID [2022-02-21 04:28:58,669 INFO L290 TraceCheckUtils]: 50: Hoare triple {1873#false} ~mode1~0 := 0; {1873#false} is VALID [2022-02-21 04:28:58,669 INFO L290 TraceCheckUtils]: 51: Hoare triple {1873#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; {1873#false} is VALID [2022-02-21 04:28:58,669 INFO L290 TraceCheckUtils]: 52: Hoare triple {1873#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:58,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {1873#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1873#false} is VALID [2022-02-21 04:28:58,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {1873#false} ~mode2~0 := 0; {1873#false} is VALID [2022-02-21 04:28:58,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {1873#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; {1873#false} is VALID [2022-02-21 04:28:58,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {1873#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:58,670 INFO L290 TraceCheckUtils]: 57: Hoare triple {1873#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1873#false} is VALID [2022-02-21 04:28:58,670 INFO L290 TraceCheckUtils]: 58: Hoare triple {1873#false} ~mode3~0 := 0; {1873#false} is VALID [2022-02-21 04:28:58,670 INFO L290 TraceCheckUtils]: 59: Hoare triple {1873#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; {1873#false} is VALID [2022-02-21 04:28:58,671 INFO L290 TraceCheckUtils]: 60: Hoare triple {1873#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:58,671 INFO L290 TraceCheckUtils]: 61: Hoare triple {1873#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1873#false} is VALID [2022-02-21 04:28:58,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {1873#false} ~mode4~0 := 0; {1873#false} is VALID [2022-02-21 04:28:58,676 INFO L290 TraceCheckUtils]: 63: Hoare triple {1873#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; {1873#false} is VALID [2022-02-21 04:28:58,676 INFO L290 TraceCheckUtils]: 64: Hoare triple {1873#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:58,676 INFO L290 TraceCheckUtils]: 65: Hoare triple {1873#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1873#false} is VALID [2022-02-21 04:28:58,676 INFO L290 TraceCheckUtils]: 66: Hoare triple {1873#false} ~mode5~0 := 0; {1873#false} is VALID [2022-02-21 04:28:58,676 INFO L290 TraceCheckUtils]: 67: Hoare triple {1873#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:58,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {1873#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1873#false} is VALID [2022-02-21 04:28:58,677 INFO L290 TraceCheckUtils]: 69: Hoare triple {1873#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1873#false} is VALID [2022-02-21 04:28:58,677 INFO L290 TraceCheckUtils]: 70: Hoare triple {1873#false} ~mode6~0 := 0; {1873#false} is VALID [2022-02-21 04:28:58,677 INFO L290 TraceCheckUtils]: 71: Hoare triple {1873#false} assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1873#false} is VALID [2022-02-21 04:28:58,677 INFO L290 TraceCheckUtils]: 72: Hoare triple {1873#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1873#false} is VALID [2022-02-21 04:28:58,677 INFO L290 TraceCheckUtils]: 73: Hoare triple {1873#false} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {1873#false} is VALID [2022-02-21 04:28:58,677 INFO L290 TraceCheckUtils]: 74: Hoare triple {1873#false} check_#res#1 := check_~tmp~1#1; {1873#false} is VALID [2022-02-21 04:28:58,677 INFO L290 TraceCheckUtils]: 75: Hoare triple {1873#false} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {1873#false} is VALID [2022-02-21 04:28:58,678 INFO L290 TraceCheckUtils]: 76: Hoare triple {1873#false} assume !(0 == assert_~arg#1 % 256); {1873#false} is VALID [2022-02-21 04:28:58,678 INFO L290 TraceCheckUtils]: 77: Hoare triple {1873#false} assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {1873#false} is VALID [2022-02-21 04:28:58,678 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:58,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:58,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691749394] [2022-02-21 04:28:58,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691749394] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:58,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:58,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:28:58,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181405627] [2022-02-21 04:28:58,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:59,600 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:59,601 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:59,601 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:59,601 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:59,601 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:28:59,602 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:59,602 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:59,602 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:59,602 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2022-02-21 04:28:59,602 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:59,602 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:59,622 INFO L141 MapEliminator]: 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:59,629 INFO L141 MapEliminator]: 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:59,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:59,634 INFO L141 MapEliminator]: 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:59,636 INFO L141 MapEliminator]: 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:59,638 INFO L141 MapEliminator]: 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:59,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:59,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:59,655 INFO L141 MapEliminator]: 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:59,658 INFO L141 MapEliminator]: 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:59,659 INFO L141 MapEliminator]: 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:59,662 INFO L141 MapEliminator]: 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:59,664 INFO L141 MapEliminator]: 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:59,667 INFO L141 MapEliminator]: 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:59,669 INFO L141 MapEliminator]: 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:59,670 INFO L141 MapEliminator]: 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:59,674 INFO L141 MapEliminator]: 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:59,677 INFO L141 MapEliminator]: 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:59,680 INFO L141 MapEliminator]: 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:59,685 INFO L141 MapEliminator]: 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:59,687 INFO L141 MapEliminator]: 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:59,688 INFO L141 MapEliminator]: 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:59,693 INFO L141 MapEliminator]: 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:59,694 INFO L141 MapEliminator]: 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:59,698 INFO L141 MapEliminator]: 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:59,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,512 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:29:00,513 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:29:00,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,516 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:29:00,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:29:00,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:29:00,523 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:29:00,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:29:00,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:00,575 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:29:00,577 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:29:00,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:29:00,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:29:00,688 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:29:00,692 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:29:00,692 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:29:00,693 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:29:00,693 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:29:00,693 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:29:00,693 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:29:00,693 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:00,693 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:29:00,693 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:29:00,693 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2022-02-21 04:29:00,693 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:29:00,693 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:29:00,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:00,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:01,547 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:29:01,550 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:29:01,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:01,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:01,552 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:29:01,553 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:29:01,555 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:29:01,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:01,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:01,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:01,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:01,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:01,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:01,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:01,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:01,602 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:29:01,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:01,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:01,605 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:29:01,610 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:29:01,616 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:29:01,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:01,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:01,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:01,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:01,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:01,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:01,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:01,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:01,651 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:29:01,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:01,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:01,653 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:29:01,666 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:29:01,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:01,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:01,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:01,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:01,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:01,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:01,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:01,675 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:29:01,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:01,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 04:29:01,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:01,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:01,698 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:29:01,698 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:29:01,700 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:29:01,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:01,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:01,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:01,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:01,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:01,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:01,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:01,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:01,731 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:29:01,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:01,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:01,732 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:29:01,733 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:29:01,734 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:29:01,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:01,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:01,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:01,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:01,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:01,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:01,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:01,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:01,763 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:29:01,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:01,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:01,766 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:29:01,767 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:29:01,775 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:29:01,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:01,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:01,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:01,782 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:29:01,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:01,784 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:29:01,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:01,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:01,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 04:29:01,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:01,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:01,805 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:29:01,806 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:29:01,808 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:29:01,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:01,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:01,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:01,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:01,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:01,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:01,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:01,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:01,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 04:29:01,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:01,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:01,842 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:29:01,845 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:29:01,845 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:29:01,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:01,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:01,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:01,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:01,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:01,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:01,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:01,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:01,877 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:29:01,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:01,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:01,879 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:29:01,879 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:29:01,881 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:29:01,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:01,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:01,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:01,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:01,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:01,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:01,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:01,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:01,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:29:01,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:01,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:01,910 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:29:01,919 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:29:01,919 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:29:01,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:01,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:01,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:01,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:01,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:01,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:01,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:01,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:01,947 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:29:01,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:01,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:01,949 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:29:01,949 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:29:01,951 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:29:01,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:01,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:01,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:01,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:01,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:01,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:01,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:01,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:01,974 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:29:01,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:01,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:01,977 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:29:01,979 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:29:01,980 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:29:01,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:01,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:01,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:01,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:01,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:01,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:01,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:01,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:02,015 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:29:02,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:02,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:02,016 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:29:02,017 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:29:02,018 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:29:02,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:02,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:02,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:02,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:02,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:02,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:02,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:02,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:02,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 04:29:02,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:02,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:02,073 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:29:02,075 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:29:02,075 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:29:02,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:02,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:02,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:02,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:02,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:02,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:02,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:02,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:02,101 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:29:02,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:02,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:02,102 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:29:02,102 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:29:02,104 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:29:02,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:02,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:02,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:02,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:02,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:02,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:02,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:02,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:02,129 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:29:02,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:02,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:02,131 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:29:02,138 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:29:02,139 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:29:02,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:02,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:02,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:02,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:02,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:02,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:02,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:02,155 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:29:02,184 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:29:02,184 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:29:02,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:02,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:02,187 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:29:02,191 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:29:02,191 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:29:02,191 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:29:02,192 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 23 Supporting invariants [] [2022-02-21 04:29:02,193 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:29:02,208 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:29:02,226 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:29:02,232 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 12);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 := ~p6_old~0;~p6_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;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0;" "assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0;" "assume !(node6_~m6~0#1 != ~nomsg~0);" "~mode6~0 := 0;" "assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_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 + ~st6~0 <= 1;" "assume ~r1~0 < 6;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1;" [2022-02-21 04:29:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:02,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:02,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:29:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:02,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:29:02,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {1875#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(48, 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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; {1875#unseeded} is VALID [2022-02-21 04:29:02,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {1875#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1, main_#t~post49#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~nondet16#1;havoc main_#t~nondet16#1;~id1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode4~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~alive4~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~id5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~send5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode5~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~alive5~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id6~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~st6~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~send6~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~mode6~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~alive6~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1875#unseeded} is VALID [2022-02-21 04:29:02,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {1875#unseeded} assume 0 == ~r1~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {1875#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1875#unseeded} is VALID [2022-02-21 04:29:02,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {1875#unseeded} assume ~id1~0 >= 0; {1875#unseeded} is VALID [2022-02-21 04:29:02,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {1875#unseeded} assume 0 == ~st1~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {1875#unseeded} assume ~send1~0 == ~id1~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {1875#unseeded} assume 0 == ~mode1~0 % 256; {1875#unseeded} is VALID [2022-02-21 04:29:02,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {1875#unseeded} assume ~id2~0 >= 0; {1875#unseeded} is VALID [2022-02-21 04:29:02,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {1875#unseeded} assume 0 == ~st2~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {1875#unseeded} assume ~send2~0 == ~id2~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {1875#unseeded} assume 0 == ~mode2~0 % 256; {1875#unseeded} is VALID [2022-02-21 04:29:02,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {1875#unseeded} assume ~id3~0 >= 0; {1875#unseeded} is VALID [2022-02-21 04:29:02,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {1875#unseeded} assume 0 == ~st3~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {1875#unseeded} assume ~send3~0 == ~id3~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {1875#unseeded} assume 0 == ~mode3~0 % 256; {1875#unseeded} is VALID [2022-02-21 04:29:02,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {1875#unseeded} assume ~id4~0 >= 0; {1875#unseeded} is VALID [2022-02-21 04:29:02,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {1875#unseeded} assume 0 == ~st4~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {1875#unseeded} assume ~send4~0 == ~id4~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {1875#unseeded} assume 0 == ~mode4~0 % 256; {1875#unseeded} is VALID [2022-02-21 04:29:02,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {1875#unseeded} assume ~id5~0 >= 0; {1875#unseeded} is VALID [2022-02-21 04:29:02,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {1875#unseeded} assume 0 == ~st5~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {1875#unseeded} assume ~send5~0 == ~id5~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {1875#unseeded} assume 0 == ~mode5~0 % 256; {1875#unseeded} is VALID [2022-02-21 04:29:02,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {1875#unseeded} assume ~id6~0 >= 0; {1875#unseeded} is VALID [2022-02-21 04:29:02,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {1875#unseeded} assume 0 == ~st6~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {1875#unseeded} assume ~send6~0 == ~id6~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {1875#unseeded} assume 0 == ~mode6~0 % 256; {1875#unseeded} is VALID [2022-02-21 04:29:02,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {1875#unseeded} assume ~id1~0 != ~id2~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {1875#unseeded} assume ~id1~0 != ~id3~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {1875#unseeded} assume ~id1~0 != ~id4~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {1875#unseeded} assume ~id1~0 != ~id5~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {1875#unseeded} assume ~id1~0 != ~id6~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {1875#unseeded} assume ~id2~0 != ~id3~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,458 INFO L290 TraceCheckUtils]: 34: Hoare triple {1875#unseeded} assume ~id2~0 != ~id4~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {1875#unseeded} assume ~id2~0 != ~id5~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {1875#unseeded} assume ~id2~0 != ~id6~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {1875#unseeded} assume ~id3~0 != ~id4~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {1875#unseeded} assume ~id3~0 != ~id5~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,459 INFO L290 TraceCheckUtils]: 39: Hoare triple {1875#unseeded} assume ~id3~0 != ~id6~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {1875#unseeded} assume ~id4~0 != ~id5~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {1875#unseeded} assume ~id4~0 != ~id6~0; {1875#unseeded} is VALID [2022-02-21 04:29:02,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {1875#unseeded} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1875#unseeded} is VALID [2022-02-21 04:29:02,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {1875#unseeded} init_#res#1 := init_~tmp~0#1; {1875#unseeded} is VALID [2022-02-21 04:29:02,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {1875#unseeded} main_#t~ret47#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret47#1;havoc main_#t~ret47#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; {1875#unseeded} is VALID [2022-02-21 04:29:02,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {1875#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {1875#unseeded} is VALID [2022-02-21 04:29:02,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {1875#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1875#unseeded} is VALID [2022-02-21 04:29:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:02,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:29:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:02,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:29:02,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {1878#(>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 12);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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node1_~m1~0#1 != ~nomsg~0); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode1~0 := 0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} 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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node2_~m2~0#1 != ~nomsg~0); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode2~0 := 0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} 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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node3_~m3~0#1 != ~nomsg~0); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode3~0 := 0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} 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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node4_~m4~0#1 != ~nomsg~0); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode4~0 := 0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} 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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node5_~m5~0#1 != ~nomsg~0); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode5~0 := 0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite14#1, node6_#t~ite15#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node6_~m6~0#1 != ~nomsg~0); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode6~0 := 0; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node6 } 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} check_#res#1 := check_~tmp~1#1; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} main_#t~ret48#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret48#1;havoc main_#t~ret48#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; {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(0 == assert_~arg#1 % 256); {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:29:02,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {2031#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_assert } true;main_#t~post49#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post49#1;havoc main_#t~post49#1; {1888#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:29:02,771 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:29:02,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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:29:02,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:02,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:02,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:02,798 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:29:02,799 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 194 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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:29:03,012 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:29:03,094 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 194 transitions. cyclomatic complexity: 56. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 231 states and 342 transitions. Complement of second has 4 states. [2022-02-21 04:29:03,094 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:29:03,094 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:29:03,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 194 transitions. cyclomatic complexity: 56 [2022-02-21 04:29:03,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:03,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:03,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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:29:03,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:29:03,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:03,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:03,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 342 transitions. [2022-02-21 04:29:03,102 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:29:03,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:29:03,105 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 139 states and 194 transitions. cyclomatic complexity: 56 [2022-02-21 04:29:03,146 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 92 examples of accepted words. [2022-02-21 04:29:03,146 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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:29:03,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:29:03,149 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:29:03,149 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 231 states and 342 transitions. cyclomatic complexity: 112 [2022-02-21 04:29:03,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 342 transitions. cyclomatic complexity: 112 [2022-02-21 04:29:03,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:29:03,150 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:29:03,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:03,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:03,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:03,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:29:03,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:29:03,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:29:03,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 231 letters. Loop has 231 letters. [2022-02-21 04:29:03,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 231 letters. Loop has 231 letters. [2022-02-21 04:29:03,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 231 letters. Loop has 231 letters. [2022-02-21 04:29:03,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 139 letters. Loop has 139 letters. [2022-02-21 04:29:03,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 139 letters. [2022-02-21 04:29:03,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 139 letters. Loop has 139 letters. [2022-02-21 04:29:03,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:29:03,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:29:03,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:29:03,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:29:03,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:03,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:29:03,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:29:03,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:29:03,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:29:03,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:29:03,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:29:03,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:29:03,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:29:03,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:29:03,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:29:03,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:29:03,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:29:03,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:29:03,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:29:03,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:29:03,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:29:03,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:29:03,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:29:03,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:29:03,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:29:03,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:29:03,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:29:03,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:29:03,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:29:03,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:29:03,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 34 letters. [2022-02-21 04:29:03,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:03,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 34 letters. [2022-02-21 04:29:03,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:29:03,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:29:03,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:29:03,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:29:03,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:29:03,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:29:03,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:29:03,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:29:03,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:29:03,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 65 letters. Loop has 31 letters. [2022-02-21 04:29:03,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 31 letters. [2022-02-21 04:29:03,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 65 letters. Loop has 31 letters. [2022-02-21 04:29:03,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:29:03,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:29:03,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:29:03,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:29:03,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:29:03,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:29:03,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:29:03,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:03,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:29:03,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:29:03,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:29:03,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:29:03,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 31 letters. [2022-02-21 04:29:03,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 31 letters. [2022-02-21 04:29:03,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 76 letters. Loop has 31 letters. [2022-02-21 04:29:03,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 77 letters. Loop has 31 letters. [2022-02-21 04:29:03,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 31 letters. [2022-02-21 04:29:03,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 77 letters. Loop has 31 letters. [2022-02-21 04:29:03,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 31 letters. [2022-02-21 04:29:03,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:03,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 31 letters. [2022-02-21 04:29:03,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 64 letters. Loop has 31 letters. [2022-02-21 04:29:03,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:03,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 64 letters. Loop has 31 letters. [2022-02-21 04:29:03,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:03,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:03,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:03,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 48 letters. Loop has 31 letters. [2022-02-21 04:29:03,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:03,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 48 letters. Loop has 31 letters. [2022-02-21 04:29:03,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:29:03,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:29:03,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:29:03,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:29:03,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:03,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:29:03,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:29:03,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:29:03,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:29:03,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 34 letters. [2022-02-21 04:29:03,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 34 letters. [2022-02-21 04:29:03,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 34 letters. [2022-02-21 04:29:03,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:29:03,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:29:03,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 72 letters. Loop has 34 letters. [2022-02-21 04:29:03,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 72 letters. Loop has 31 letters. [2022-02-21 04:29:03,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 31 letters. [2022-02-21 04:29:03,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 72 letters. Loop has 31 letters. [2022-02-21 04:29:03,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:29:03,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:29:03,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:29:03,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 31 letters. [2022-02-21 04:29:03,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 31 letters. [2022-02-21 04:29:03,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 73 letters. Loop has 31 letters. [2022-02-21 04:29:03,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:29:03,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:29:03,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:29:03,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:29:03,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:03,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:29:03,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:29:03,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:29:03,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:29:03,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:29:03,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:03,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:29:03,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:29:03,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:29:03,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:29:03,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:29:03,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:29:03,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:29:03,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:29:03,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:29:03,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:29:03,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:29:03,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:29:03,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:29:03,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:29:03,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:29:03,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:29:03,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:29:03,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:29:03,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:29:03,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:29:03,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:29:03,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:29:03,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:29:03,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:29:03,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:29:03,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:29:03,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:29:03,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:29:03,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 31 letters. [2022-02-21 04:29:03,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 31 letters. [2022-02-21 04:29:03,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 31 letters. [2022-02-21 04:29:03,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 31 letters. [2022-02-21 04:29:03,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 31 letters. [2022-02-21 04:29:03,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 31 letters. [2022-02-21 04:29:03,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 31 letters. [2022-02-21 04:29:03,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 31 letters. [2022-02-21 04:29:03,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 31 letters. [2022-02-21 04:29:03,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:29:03,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:03,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:29:03,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:29:03,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:29:03,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:29:03,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:29:03,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:29:03,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:29:03,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:29:03,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:29:03,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:29:03,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:29:03,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:29:03,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:29:03,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:29:03,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:29:03,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:29:03,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 68 letters. Loop has 31 letters. [2022-02-21 04:29:03,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 31 letters. [2022-02-21 04:29:03,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 31 letters. [2022-02-21 04:29:03,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 69 letters. Loop has 31 letters. [2022-02-21 04:29:03,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 31 letters. [2022-02-21 04:29:03,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 69 letters. Loop has 31 letters. [2022-02-21 04:29:03,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:29:03,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:29:03,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:29:03,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:29:03,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:29:03,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:29:03,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 32 letters. [2022-02-21 04:29:03,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:29:03,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 32 letters. [2022-02-21 04:29:03,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 34 letters. [2022-02-21 04:29:03,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:03,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 34 letters. [2022-02-21 04:29:03,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:29:03,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:29:03,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:29:03,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:29:03,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:29:03,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:29:03,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:29:03,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:29:03,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:29:03,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:29:03,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:29:03,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:29:03,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 33 letters. [2022-02-21 04:29:03,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 33 letters. [2022-02-21 04:29:03,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 33 letters. [2022-02-21 04:29:03,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:29:03,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:29:03,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:29:03,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:29:03,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:29:03,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:29:03,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:29:03,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:03,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:29:03,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:29:03,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:29:03,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:29:03,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:29:03,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:29:03,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:29:03,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 34 letters. [2022-02-21 04:29:03,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 34 letters. [2022-02-21 04:29:03,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 34 letters. [2022-02-21 04:29:03,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 34 letters. [2022-02-21 04:29:03,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:03,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 34 letters. [2022-02-21 04:29:03,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:29:03,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:29:03,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:29:03,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 34 letters. [2022-02-21 04:29:03,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:03,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 52 letters. Loop has 34 letters. [2022-02-21 04:29:03,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:29:03,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:29:03,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:29:03,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:29:03,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:29:03,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:29:03,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:29:03,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:29:03,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:29:03,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:29:03,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:29:03,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:29:03,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 49 letters. Loop has 32 letters. [2022-02-21 04:29:03,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:29:03,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 49 letters. Loop has 32 letters. [2022-02-21 04:29:03,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 33 letters. [2022-02-21 04:29:03,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:29:03,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 33 letters. [2022-02-21 04:29:03,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 31 letters. [2022-02-21 04:29:03,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 31 letters. [2022-02-21 04:29:03,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 74 letters. Loop has 31 letters. [2022-02-21 04:29:03,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 31 letters. [2022-02-21 04:29:03,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 31 letters. [2022-02-21 04:29:03,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 75 letters. Loop has 31 letters. [2022-02-21 04:29:03,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:29:03,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:29:03,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:29:03,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 34 letters. [2022-02-21 04:29:03,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:03,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 52 letters. Loop has 34 letters. [2022-02-21 04:29:03,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:29:03,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:29:03,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 34 letters. [2022-02-21 04:29:03,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:29:03,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:03,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 56 letters. Loop has 34 letters. [2022-02-21 04:29:03,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:29:03,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:29:03,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:29:03,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:29:03,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:29:03,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:29:03,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:29:03,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:29:03,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:29:03,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 31 letters. [2022-02-21 04:29:03,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 31 letters. [2022-02-21 04:29:03,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 31 letters. [2022-02-21 04:29:03,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:29:03,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:29:03,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:29:03,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 61 letters. Loop has 31 letters. [2022-02-21 04:29:03,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:03,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 61 letters. Loop has 31 letters. [2022-02-21 04:29:03,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:29:03,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:29:03,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:29:03,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,258 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:29:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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:29:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2022-02-21 04:29:03,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 194 transitions. Stem has 47 letters. Loop has 31 letters. [2022-02-21 04:29:03,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 194 transitions. Stem has 78 letters. Loop has 31 letters. [2022-02-21 04:29:03,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 194 transitions. Stem has 47 letters. Loop has 62 letters. [2022-02-21 04:29:03,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:03,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 342 transitions. cyclomatic complexity: 112 [2022-02-21 04:29:03,266 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:29:03,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 0 states and 0 transitions. [2022-02-21 04:29:03,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:29:03,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:29:03,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:29:03,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:03,267 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:03,267 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:03,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:03,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:29:03,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:29:03,268 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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:29:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:03,268 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:29:03,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:29:03,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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:29:03,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:03,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:29:03,321 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:29:03,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:29:03,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:29:03,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:29:03,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:29:03,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:03,322 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:03,322 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:03,322 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:03,322 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:29:03,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:29:03,322 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:29:03,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:29:03,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:29:03 BoogieIcfgContainer [2022-02-21 04:29:03,328 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:29:03,328 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:29:03,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:29:03,329 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:29:03,329 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:56" (3/4) ... [2022-02-21 04:29:03,331 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:29:03,331 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:29:03,332 INFO L158 Benchmark]: Toolchain (without parser) took 7753.26ms. Allocated memory was 88.1MB in the beginning and 201.3MB in the end (delta: 113.2MB). Free memory was 52.8MB in the beginning and 87.3MB in the end (delta: -34.4MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2022-02-21 04:29:03,332 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 58.6MB in the beginning and 58.6MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:29:03,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.68ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 52.6MB in the beginning and 80.5MB in the end (delta: -27.9MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2022-02-21 04:29:03,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.17ms. Allocated memory is still 113.2MB. Free memory was 80.5MB in the beginning and 76.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:29:03,333 INFO L158 Benchmark]: Boogie Preprocessor took 26.23ms. Allocated memory is still 113.2MB. Free memory was 76.7MB in the beginning and 74.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:29:03,333 INFO L158 Benchmark]: RCFGBuilder took 683.20ms. Allocated memory is still 113.2MB. Free memory was 74.2MB in the beginning and 72.2MB in the end (delta: 2.0MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2022-02-21 04:29:03,334 INFO L158 Benchmark]: BuchiAutomizer took 6663.85ms. Allocated memory was 113.2MB in the beginning and 201.3MB in the end (delta: 88.1MB). Free memory was 71.7MB in the beginning and 87.3MB in the end (delta: -15.6MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2022-02-21 04:29:03,334 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 201.3MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:29:03,335 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 88.1MB. Free memory was 58.6MB in the beginning and 58.6MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.68ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 52.6MB in the beginning and 80.5MB in the end (delta: -27.9MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.17ms. Allocated memory is still 113.2MB. Free memory was 80.5MB in the beginning and 76.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.23ms. Allocated memory is still 113.2MB. Free memory was 76.7MB in the beginning and 74.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 683.20ms. Allocated memory is still 113.2MB. Free memory was 74.2MB in the beginning and 72.2MB in the end (delta: 2.0MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 6663.85ms. Allocated memory was 113.2MB in the beginning and 201.3MB in the end (delta: 88.1MB). Free memory was 71.7MB in the beginning and 87.3MB in the end (delta: -15.6MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 201.3MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 23 + -2 * i2 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. Construction of modules took 0.0s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 139 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 2245 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1382 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 863 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital189 mio100 ax100 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms 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:29:03,359 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