./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product03.cil.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/product-lines/email_spec11_product03.cil.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 ceaa95778492e3bc285d343b26b58125dae05b4d97d6b8fbdf100b65fa491c48 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:08:52,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:08:52,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:08:52,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:08:52,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:08:52,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:08:52,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:08:52,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:08:52,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:08:52,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:08:52,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:08:52,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:08:52,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:08:52,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:08:52,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:08:52,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:08:52,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:08:52,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:08:52,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:08:52,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:08:52,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:08:52,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:08:52,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:08:52,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:08:52,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:08:52,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:08:52,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:08:52,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:08:52,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:08:52,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:08:52,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:08:52,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:08:52,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:08:52,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:08:52,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:08:52,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:08:52,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:08:52,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:08:52,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:08:52,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:08:52,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:08:52,891 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:08:52,918 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:08:52,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:08:52,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:08:52,919 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:08:52,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:08:52,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:08:52,920 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:08:52,920 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:08:52,920 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:08:52,920 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:08:52,920 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:08:52,920 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:08:52,920 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:08:52,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:08:52,921 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:08:52,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:08:52,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:08:52,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:08:52,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:08:52,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:08:52,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:08:52,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:08:52,921 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:08:52,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:08:52,922 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:08:52,922 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:08:52,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:08:52,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:08:52,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:08:52,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:08:52,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:08:52,923 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:08:52,923 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 -> ceaa95778492e3bc285d343b26b58125dae05b4d97d6b8fbdf100b65fa491c48 [2022-02-21 04:08:53,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:08:53,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:08:53,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:08:53,214 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:08:53,215 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:08:53,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product03.cil.c [2022-02-21 04:08:53,290 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e95906f/d732bb4ff0aa4c5696a1d95c81e28973/FLAG590cf744b [2022-02-21 04:08:53,723 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:08:53,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product03.cil.c [2022-02-21 04:08:53,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e95906f/d732bb4ff0aa4c5696a1d95c81e28973/FLAG590cf744b [2022-02-21 04:08:54,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e95906f/d732bb4ff0aa4c5696a1d95c81e28973 [2022-02-21 04:08:54,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:08:54,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:08:54,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:08:54,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:08:54,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:08:54,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:08:54" (1/1) ... [2022-02-21 04:08:54,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0a5828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:08:54, skipping insertion in model container [2022-02-21 04:08:54,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:08:54" (1/1) ... [2022-02-21 04:08:54,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:08:54,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:08:54,459 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/product-lines/email_spec11_product03.cil.c[19915,19928] [2022-02-21 04:08:54,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:08:54,627 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:08:54,673 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/product-lines/email_spec11_product03.cil.c[19915,19928] [2022-02-21 04:08:54,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:08:54,766 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:08:54,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:08:54 WrapperNode [2022-02-21 04:08:54,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:08:54,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:08:54,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:08:54,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:08:54,775 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:08:54" (1/1) ... [2022-02-21 04:08:54,803 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:08:54" (1/1) ... [2022-02-21 04:08:54,858 INFO L137 Inliner]: procedures = 107, calls = 125, calls flagged for inlining = 54, calls inlined = 55, statements flattened = 754 [2022-02-21 04:08:54,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:08:54,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:08:54,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:08:54,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:08:54,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:08:54" (1/1) ... [2022-02-21 04:08:54,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:08:54" (1/1) ... [2022-02-21 04:08:54,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:08:54" (1/1) ... [2022-02-21 04:08:54,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:08:54" (1/1) ... [2022-02-21 04:08:54,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:08:54" (1/1) ... [2022-02-21 04:08:54,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:08:54" (1/1) ... [2022-02-21 04:08:54,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:08:54" (1/1) ... [2022-02-21 04:08:54,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:08:54,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:08:54,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:08:54,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:08:54,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:08:54" (1/1) ... [2022-02-21 04:08:54,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:08:54,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:08:54,973 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:08:54,979 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:08:55,020 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2022-02-21 04:08:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:08:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:08:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:08:55,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:08:55,221 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:08:55,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:08:55,654 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:08:55,659 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:08:55,660 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:08:55,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:08:55 BoogieIcfgContainer [2022-02-21 04:08:55,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:08:55,662 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:08:55,662 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:08:55,664 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:08:55,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:08:55,665 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:08:54" (1/3) ... [2022-02-21 04:08:55,665 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ff2b406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:08:55, skipping insertion in model container [2022-02-21 04:08:55,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:08:55,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:08:54" (2/3) ... [2022-02-21 04:08:55,666 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ff2b406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:08:55, skipping insertion in model container [2022-02-21 04:08:55,666 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:08:55,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:08:55" (3/3) ... [2022-02-21 04:08:55,667 INFO L388 chiAutomizerObserver]: Analyzing ICFG email_spec11_product03.cil.c [2022-02-21 04:08:55,706 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:08:55,706 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:08:55,706 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:08:55,706 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:08:55,706 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:08:55,706 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:08:55,706 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:08:55,707 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:08:55,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 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:08:55,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-02-21 04:08:55,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:08:55,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:08:55,763 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:08:55,765 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:08:55,765 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:08:55,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 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:08:55,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-02-21 04:08:55,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:08:55,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:08:55,785 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:08:55,785 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 04:08:55,789 INFO L791 eck$LassoCheckResult]: Stem: 117#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(29, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(44, 4);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(9, 7);call #Ultimate.allocInit(11, 8);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(16, 10);call #Ultimate.allocInit(22, 11);call #Ultimate.allocInit(20, 12);call #Ultimate.allocInit(4, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(10, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(30, 14);call #Ultimate.allocInit(9, 15);call #Ultimate.allocInit(21, 16);call #Ultimate.allocInit(30, 17);call #Ultimate.allocInit(9, 18);call #Ultimate.allocInit(21, 19);call #Ultimate.allocInit(30, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(25, 22);call #Ultimate.allocInit(30, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(10, 26);call #Ultimate.allocInit(12, 27);call #Ultimate.allocInit(10, 28);call #Ultimate.allocInit(18, 29);~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0; 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~retValue_acc~0#1, main_~tmp~1#1;main_~retValue_acc~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~tmp~1#1;assume { :begin_inline_select_helpers } true; 44#L417true assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 104#L410true assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~2#1;havoc valid_product_~retValue_acc~2#1;valid_product_~retValue_acc~2#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~2#1; 110#L425true main_#t~ret13#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~1#1 := main_#t~ret13#1;havoc main_#t~ret13#1; 100#L181true assume 0 != main_~tmp~1#1;assume { :begin_inline_setup } true;havoc setup_#t~nondet9#1, setup_#t~nondet10#1, setup_#t~nondet11#1, setup_~__cil_tmp1~0#1.base, setup_~__cil_tmp1~0#1.offset, setup_~__cil_tmp2~0#1.base, setup_~__cil_tmp2~0#1.offset, setup_~__cil_tmp3~0#1.base, setup_~__cil_tmp3~0#1.offset;havoc setup_~__cil_tmp1~0#1.base, setup_~__cil_tmp1~0#1.offset;havoc setup_~__cil_tmp2~0#1.base, setup_~__cil_tmp2~0#1.offset;havoc setup_~__cil_tmp3~0#1.base, setup_~__cil_tmp3~0#1.offset;~bob~0 := 1;assume { :begin_inline_setup_bob } true;setup_bob_#in~bob___0#1 := ~bob~0;havoc setup_bob_~bob___0#1;setup_bob_~bob___0#1 := setup_bob_#in~bob___0#1;assume { :begin_inline_setClientId } true;setClientId_#in~handle#1, setClientId_#in~value#1 := setup_bob_~bob___0#1, setup_bob_~bob___0#1;havoc setClientId_~handle#1, setClientId_~value#1;setClientId_~handle#1 := setClientId_#in~handle#1;setClientId_~value#1 := setClientId_#in~value#1; 107#L2475true assume 1 == setClientId_~handle#1;~__ste_client_idCounter0~0 := setClientId_~value#1; 47#L2481-2true assume { :end_inline_setClientId } true; 30#L91true assume { :end_inline_setup_bob } true;setup_~__cil_tmp1~0#1.base, setup_~__cil_tmp1~0#1.offset := 6, 0;havoc setup_#t~nondet9#1;~rjh~0 := 2;assume { :begin_inline_setup_rjh } true;setup_rjh_#in~rjh___0#1 := ~rjh~0;havoc setup_rjh_~rjh___0#1;setup_rjh_~rjh___0#1 := setup_rjh_#in~rjh___0#1;assume { :begin_inline_setClientId } true;setClientId_#in~handle#1, setClientId_#in~value#1 := setup_rjh_~rjh___0#1, setup_rjh_~rjh___0#1;havoc setClientId_~handle#1, setClientId_~value#1;setClientId_~handle#1 := setClientId_#in~handle#1;setClientId_~value#1 := setClientId_#in~value#1; 31#L2475-2true assume 1 == setClientId_~handle#1;~__ste_client_idCounter0~0 := setClientId_~value#1; 6#L2481-5true assume { :end_inline_setClientId } true; 118#L101true assume { :end_inline_setup_rjh } true;setup_~__cil_tmp2~0#1.base, setup_~__cil_tmp2~0#1.offset := 7, 0;havoc setup_#t~nondet10#1;~chuck~0 := 3;assume { :begin_inline_setup_chuck } true;setup_chuck_#in~chuck___0#1 := ~chuck~0;havoc setup_chuck_~chuck___0#1;setup_chuck_~chuck___0#1 := setup_chuck_#in~chuck___0#1;assume { :begin_inline_setClientId } true;setClientId_#in~handle#1, setClientId_#in~value#1 := setup_chuck_~chuck___0#1, setup_chuck_~chuck___0#1;havoc setClientId_~handle#1, setClientId_~value#1;setClientId_~handle#1 := setClientId_#in~handle#1;setClientId_~value#1 := setClientId_#in~value#1; 121#L2475-4true assume 1 == setClientId_~handle#1;~__ste_client_idCounter0~0 := setClientId_~value#1; 111#L2481-8true assume { :end_inline_setClientId } true; 27#L111true assume { :end_inline_setup_chuck } true;setup_~__cil_tmp3~0#1.base, setup_~__cil_tmp3~0#1.offset := 8, 0;havoc setup_#t~nondet11#1; 7#L168true assume { :end_inline_setup } true;assume { :begin_inline_test } true;havoc test_#t~nondet14#1, test_#t~nondet15#1, test_#t~nondet16#1, test_#t~nondet17#1, test_#t~nondet18#1, test_#t~nondet19#1, test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_#t~nondet23#1, test_#t~nondet24#1, test_~op1~0#1, test_~op2~0#1, test_~op3~0#1, test_~op4~0#1, test_~op5~0#1, test_~op6~0#1, test_~op7~0#1, test_~op8~0#1, test_~op9~0#1, test_~op10~0#1, test_~op11~0#1, test_~splverifierCounter~0#1, test_~tmp~2#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1, test_~tmp___3~0#1, test_~tmp___4~0#1, test_~tmp___5~0#1, test_~tmp___6~0#1, test_~tmp___7~0#1, test_~tmp___8~0#1, test_~tmp___9~0#1;havoc test_~op1~0#1;havoc test_~op2~0#1;havoc test_~op3~0#1;havoc test_~op4~0#1;havoc test_~op5~0#1;havoc test_~op6~0#1;havoc test_~op7~0#1;havoc test_~op8~0#1;havoc test_~op9~0#1;havoc test_~op10~0#1;havoc test_~op11~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~2#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;havoc test_~tmp___3~0#1;havoc test_~tmp___4~0#1;havoc test_~tmp___5~0#1;havoc test_~tmp___6~0#1;havoc test_~tmp___7~0#1;havoc test_~tmp___8~0#1;havoc test_~tmp___9~0#1;test_~op1~0#1 := 0;test_~op2~0#1 := 0;test_~op3~0#1 := 0;test_~op4~0#1 := 0;test_~op5~0#1 := 0;test_~op6~0#1 := 0;test_~op7~0#1 := 0;test_~op8~0#1 := 0;test_~op9~0#1 := 0;test_~op10~0#1 := 0;test_~op11~0#1 := 0;test_~splverifierCounter~0#1 := 0; 106#L367-1true [2022-02-21 04:08:55,791 INFO L793 eck$LassoCheckResult]: Loop: 106#L367-1true assume !false; 76#L243true assume test_~splverifierCounter~0#1 < 4; 13#L244true test_~splverifierCounter~0#1 := 1 + test_~splverifierCounter~0#1; 93#L250true assume 0 == test_~op1~0#1;test_~tmp___9~0#1 := test_#t~nondet14#1;havoc test_#t~nondet14#1; 55#L254true assume 0 != test_~tmp___9~0#1;test_~op1~0#1 := 1; 106#L367-1true [2022-02-21 04:08:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:08:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash -546462003, now seen corresponding path program 1 times [2022-02-21 04:08:55,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:08:55,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365627724] [2022-02-21 04:08:55,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:08:55,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:08:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:08:56,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#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(29, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(44, 4);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(9, 7);call #Ultimate.allocInit(11, 8);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(16, 10);call #Ultimate.allocInit(22, 11);call #Ultimate.allocInit(20, 12);call #Ultimate.allocInit(4, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(10, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(30, 14);call #Ultimate.allocInit(9, 15);call #Ultimate.allocInit(21, 16);call #Ultimate.allocInit(30, 17);call #Ultimate.allocInit(9, 18);call #Ultimate.allocInit(21, 19);call #Ultimate.allocInit(30, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(25, 22);call #Ultimate.allocInit(30, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(10, 26);call #Ultimate.allocInit(12, 27);call #Ultimate.allocInit(10, 28);call #Ultimate.allocInit(18, 29);~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0; {141#true} is VALID [2022-02-21 04:08:56,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~retValue_acc~0#1, main_~tmp~1#1;main_~retValue_acc~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~tmp~1#1;assume { :begin_inline_select_helpers } true; {141#true} is VALID [2022-02-21 04:08:56,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {141#true} is VALID [2022-02-21 04:08:56,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {141#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~2#1;havoc valid_product_~retValue_acc~2#1;valid_product_~retValue_acc~2#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~2#1; {141#true} is VALID [2022-02-21 04:08:56,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {141#true} main_#t~ret13#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~1#1 := main_#t~ret13#1;havoc main_#t~ret13#1; {141#true} is VALID [2022-02-21 04:08:56,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} assume 0 != main_~tmp~1#1;assume { :begin_inline_setup } true;havoc setup_#t~nondet9#1, setup_#t~nondet10#1, setup_#t~nondet11#1, setup_~__cil_tmp1~0#1.base, setup_~__cil_tmp1~0#1.offset, setup_~__cil_tmp2~0#1.base, setup_~__cil_tmp2~0#1.offset, setup_~__cil_tmp3~0#1.base, setup_~__cil_tmp3~0#1.offset;havoc setup_~__cil_tmp1~0#1.base, setup_~__cil_tmp1~0#1.offset;havoc setup_~__cil_tmp2~0#1.base, setup_~__cil_tmp2~0#1.offset;havoc setup_~__cil_tmp3~0#1.base, setup_~__cil_tmp3~0#1.offset;~bob~0 := 1;assume { :begin_inline_setup_bob } true;setup_bob_#in~bob___0#1 := ~bob~0;havoc setup_bob_~bob___0#1;setup_bob_~bob___0#1 := setup_bob_#in~bob___0#1;assume { :begin_inline_setClientId } true;setClientId_#in~handle#1, setClientId_#in~value#1 := setup_bob_~bob___0#1, setup_bob_~bob___0#1;havoc setClientId_~handle#1, setClientId_~value#1;setClientId_~handle#1 := setClientId_#in~handle#1;setClientId_~value#1 := setClientId_#in~value#1; {141#true} is VALID [2022-02-21 04:08:56,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {141#true} assume 1 == setClientId_~handle#1;~__ste_client_idCounter0~0 := setClientId_~value#1; {141#true} is VALID [2022-02-21 04:08:56,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} assume { :end_inline_setClientId } true; {141#true} is VALID [2022-02-21 04:08:56,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#true} assume { :end_inline_setup_bob } true;setup_~__cil_tmp1~0#1.base, setup_~__cil_tmp1~0#1.offset := 6, 0;havoc setup_#t~nondet9#1;~rjh~0 := 2;assume { :begin_inline_setup_rjh } true;setup_rjh_#in~rjh___0#1 := ~rjh~0;havoc setup_rjh_~rjh___0#1;setup_rjh_~rjh___0#1 := setup_rjh_#in~rjh___0#1;assume { :begin_inline_setClientId } true;setClientId_#in~handle#1, setClientId_#in~value#1 := setup_rjh_~rjh___0#1, setup_rjh_~rjh___0#1;havoc setClientId_~handle#1, setClientId_~value#1;setClientId_~handle#1 := setClientId_#in~handle#1;setClientId_~value#1 := setClientId_#in~value#1; {143#(= 2 |ULTIMATE.start_setClientId_~handle#1|)} is VALID [2022-02-21 04:08:56,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#(= 2 |ULTIMATE.start_setClientId_~handle#1|)} assume 1 == setClientId_~handle#1;~__ste_client_idCounter0~0 := setClientId_~value#1; {142#false} is VALID [2022-02-21 04:08:56,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {142#false} assume { :end_inline_setClientId } true; {142#false} is VALID [2022-02-21 04:08:56,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {142#false} assume { :end_inline_setup_rjh } true;setup_~__cil_tmp2~0#1.base, setup_~__cil_tmp2~0#1.offset := 7, 0;havoc setup_#t~nondet10#1;~chuck~0 := 3;assume { :begin_inline_setup_chuck } true;setup_chuck_#in~chuck___0#1 := ~chuck~0;havoc setup_chuck_~chuck___0#1;setup_chuck_~chuck___0#1 := setup_chuck_#in~chuck___0#1;assume { :begin_inline_setClientId } true;setClientId_#in~handle#1, setClientId_#in~value#1 := setup_chuck_~chuck___0#1, setup_chuck_~chuck___0#1;havoc setClientId_~handle#1, setClientId_~value#1;setClientId_~handle#1 := setClientId_#in~handle#1;setClientId_~value#1 := setClientId_#in~value#1; {142#false} is VALID [2022-02-21 04:08:56,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {142#false} assume 1 == setClientId_~handle#1;~__ste_client_idCounter0~0 := setClientId_~value#1; {142#false} is VALID [2022-02-21 04:08:56,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {142#false} assume { :end_inline_setClientId } true; {142#false} is VALID [2022-02-21 04:08:56,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume { :end_inline_setup_chuck } true;setup_~__cil_tmp3~0#1.base, setup_~__cil_tmp3~0#1.offset := 8, 0;havoc setup_#t~nondet11#1; {142#false} is VALID [2022-02-21 04:08:56,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume { :end_inline_setup } true;assume { :begin_inline_test } true;havoc test_#t~nondet14#1, test_#t~nondet15#1, test_#t~nondet16#1, test_#t~nondet17#1, test_#t~nondet18#1, test_#t~nondet19#1, test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_#t~nondet23#1, test_#t~nondet24#1, test_~op1~0#1, test_~op2~0#1, test_~op3~0#1, test_~op4~0#1, test_~op5~0#1, test_~op6~0#1, test_~op7~0#1, test_~op8~0#1, test_~op9~0#1, test_~op10~0#1, test_~op11~0#1, test_~splverifierCounter~0#1, test_~tmp~2#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1, test_~tmp___3~0#1, test_~tmp___4~0#1, test_~tmp___5~0#1, test_~tmp___6~0#1, test_~tmp___7~0#1, test_~tmp___8~0#1, test_~tmp___9~0#1;havoc test_~op1~0#1;havoc test_~op2~0#1;havoc test_~op3~0#1;havoc test_~op4~0#1;havoc test_~op5~0#1;havoc test_~op6~0#1;havoc test_~op7~0#1;havoc test_~op8~0#1;havoc test_~op9~0#1;havoc test_~op10~0#1;havoc test_~op11~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~2#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;havoc test_~tmp___3~0#1;havoc test_~tmp___4~0#1;havoc test_~tmp___5~0#1;havoc test_~tmp___6~0#1;havoc test_~tmp___7~0#1;havoc test_~tmp___8~0#1;havoc test_~tmp___9~0#1;test_~op1~0#1 := 0;test_~op2~0#1 := 0;test_~op3~0#1 := 0;test_~op4~0#1 := 0;test_~op5~0#1 := 0;test_~op6~0#1 := 0;test_~op7~0#1 := 0;test_~op8~0#1 := 0;test_~op9~0#1 := 0;test_~op10~0#1 := 0;test_~op11~0#1 := 0;test_~splverifierCounter~0#1 := 0; {142#false} is VALID [2022-02-21 04:08:56,030 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:08:56,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:08:56,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365627724] [2022-02-21 04:08:56,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365627724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:08:56,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:08:56,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:08:56,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938708006] [2022-02-21 04:08:56,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:08:56,036 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:08:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:08:56,037 INFO L85 PathProgramCache]: Analyzing trace with hash 107009368, now seen corresponding path program 1 times [2022-02-21 04:08:56,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:08:56,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341309570] [2022-02-21 04:08:56,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:08:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:08:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:08:56,049 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:08:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:08:56,079 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:08:56,130 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:08:56,131 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:08:56,131 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:08:56,131 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:08:56,131 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:08:56,132 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:08:56,132 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:08:56,132 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:08:56,132 INFO L133 ssoRankerPreferences]: Filename of dumped script: email_spec11_product03.cil.c_Iteration1_Loop [2022-02-21 04:08:56,133 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:08:56,133 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:08:56,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:08:56,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:08:56,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:08:56,252 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:08:56,253 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:08:56,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:08:56,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:08:56,256 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:08:56,258 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:08:56,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:08:56,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:08:56,297 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:08:56,298 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_test_#t~nondet14#1=7, ULTIMATE.start_test_~tmp___9~0#1=7} Honda state: {ULTIMATE.start_test_#t~nondet14#1=7, ULTIMATE.start_test_~tmp___9~0#1=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:08:56,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:08:56,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:08:56,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:08:56,320 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:08:56,321 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:08:56,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:08:56,323 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:08:56,358 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:08:56,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:08:56,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:08:56,360 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:08:56,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:08:56,369 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:08:56,371 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:08:56,411 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:08:56,454 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:08:56,455 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:08:56,455 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:08:56,455 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:08:56,455 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:08:56,455 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:08:56,455 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:08:56,455 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:08:56,455 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:08:56,455 INFO L133 ssoRankerPreferences]: Filename of dumped script: email_spec11_product03.cil.c_Iteration1_Loop [2022-02-21 04:08:56,455 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:08:56,455 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:08:56,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:08:56,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:08:56,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:08:56,533 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:08:56,536 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:08:56,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:08:56,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:08:56,538 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:08:56,539 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:08:56,540 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:08:56,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:08:56,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:08:56,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:08:56,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:08:56,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:08:56,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:08:56,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:08:56,562 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:08:56,564 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:08:56,565 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:08:56,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:08:56,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:08:56,567 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:08:56,569 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:08:56,569 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:08:56,569 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:08:56,569 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:08:56,570 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_~splverifierCounter~0#1) = -2*ULTIMATE.start_test_~splverifierCounter~0#1 + 7 Supporting invariants [] [2022-02-21 04:08:56,592 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:08:56,623 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:08:56,628 INFO L390 LassoCheck]: Loop: "assume !false;" "assume test_~splverifierCounter~0#1 < 4;" "test_~splverifierCounter~0#1 := 1 + test_~splverifierCounter~0#1;" "assume 0 == test_~op1~0#1;test_~tmp___9~0#1 := test_#t~nondet14#1;havoc test_#t~nondet14#1;" "assume 0 != test_~tmp___9~0#1;test_~op1~0#1 := 1;" [2022-02-21 04:08:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:08:56,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:08:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:08:56,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:08:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:08:56,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:08:56,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#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(29, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(44, 4);call #Ultimate.allocInit(44, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(9, 7);call #Ultimate.allocInit(11, 8);call #Ultimate.allocInit(10, 9);call #Ultimate.allocInit(16, 10);call #Ultimate.allocInit(22, 11);call #Ultimate.allocInit(20, 12);call #Ultimate.allocInit(4, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(10, 13, 2, 1);call write~init~int(0, 13, 3, 1);call #Ultimate.allocInit(30, 14);call #Ultimate.allocInit(9, 15);call #Ultimate.allocInit(21, 16);call #Ultimate.allocInit(30, 17);call #Ultimate.allocInit(9, 18);call #Ultimate.allocInit(21, 19);call #Ultimate.allocInit(30, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(25, 22);call #Ultimate.allocInit(30, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(10, 26);call #Ultimate.allocInit(12, 27);call #Ultimate.allocInit(10, 28);call #Ultimate.allocInit(18, 29);~__SELECTED_FEATURE_Base~0 := 0;~__SELECTED_FEATURE_Keys~0 := 0;~__SELECTED_FEATURE_Encrypt~0 := 0;~__SELECTED_FEATURE_AutoResponder~0 := 0;~__SELECTED_FEATURE_AddressBook~0 := 0;~__SELECTED_FEATURE_Sign~0 := 0;~__SELECTED_FEATURE_Forward~0 := 0;~__SELECTED_FEATURE_Verify~0 := 0;~__SELECTED_FEATURE_Decrypt~0 := 0;~__GUIDSL_ROOT_PRODUCTION~0 := 0;~__GUIDSL_NON_TERMINAL_main~0 := 0;~bob~0 := 0;~rjh~0 := 0;~chuck~0 := 0;~__ste_Email_counter~0 := 0;~__ste_email_id0~0 := 0;~__ste_email_id1~0 := 0;~__ste_email_from0~0 := 0;~__ste_email_from1~0 := 0;~__ste_email_to0~0 := 0;~__ste_email_to1~0 := 0;~__ste_email_subject0~0.base, ~__ste_email_subject0~0.offset := 0, 0;~__ste_email_subject1~0.base, ~__ste_email_subject1~0.offset := 0, 0;~__ste_email_body0~0.base, ~__ste_email_body0~0.offset := 0, 0;~__ste_email_body1~0.base, ~__ste_email_body1~0.offset := 0, 0;~__ste_email_isEncrypted0~0 := 0;~__ste_email_isEncrypted1~0 := 0;~__ste_email_encryptionKey0~0 := 0;~__ste_email_encryptionKey1~0 := 0;~__ste_email_isSigned0~0 := 0;~__ste_email_isSigned1~0 := 0;~__ste_email_signKey0~0 := 0;~__ste_email_signKey1~0 := 0;~__ste_email_isSignatureVerified0~0 := 0;~__ste_email_isSignatureVerified1~0 := 0;~queue_empty~0 := 1;~queued_message~0 := 0;~queued_client~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~__ste_Client_counter~0 := 0;~__ste_client_name0~0.base, ~__ste_client_name0~0.offset := 0, 0;~__ste_client_name1~0.base, ~__ste_client_name1~0.offset := 0, 0;~__ste_client_name2~0.base, ~__ste_client_name2~0.offset := 0, 0;~__ste_client_outbuffer0~0 := 0;~__ste_client_outbuffer1~0 := 0;~__ste_client_outbuffer2~0 := 0;~__ste_client_outbuffer3~0 := 0;~__ste_ClientAddressBook_size0~0 := 0;~__ste_ClientAddressBook_size1~0 := 0;~__ste_ClientAddressBook_size2~0 := 0;~__ste_Client_AddressBook0_Alias0~0 := 0;~__ste_Client_AddressBook0_Alias1~0 := 0;~__ste_Client_AddressBook0_Alias2~0 := 0;~__ste_Client_AddressBook1_Alias0~0 := 0;~__ste_Client_AddressBook1_Alias1~0 := 0;~__ste_Client_AddressBook1_Alias2~0 := 0;~__ste_Client_AddressBook2_Alias0~0 := 0;~__ste_Client_AddressBook2_Alias1~0 := 0;~__ste_Client_AddressBook2_Alias2~0 := 0;~__ste_Client_AddressBook0_Address0~0 := 0;~__ste_Client_AddressBook0_Address1~0 := 0;~__ste_Client_AddressBook0_Address2~0 := 0;~__ste_Client_AddressBook1_Address0~0 := 0;~__ste_Client_AddressBook1_Address1~0 := 0;~__ste_Client_AddressBook1_Address2~0 := 0;~__ste_Client_AddressBook2_Address0~0 := 0;~__ste_Client_AddressBook2_Address1~0 := 0;~__ste_Client_AddressBook2_Address2~0 := 0;~__ste_client_autoResponse0~0 := 0;~__ste_client_autoResponse1~0 := 0;~__ste_client_autoResponse2~0 := 0;~__ste_client_privateKey0~0 := 0;~__ste_client_privateKey1~0 := 0;~__ste_client_privateKey2~0 := 0;~__ste_ClientKeyring_size0~0 := 0;~__ste_ClientKeyring_size1~0 := 0;~__ste_ClientKeyring_size2~0 := 0;~__ste_Client_Keyring0_User0~0 := 0;~__ste_Client_Keyring0_User1~0 := 0;~__ste_Client_Keyring0_User2~0 := 0;~__ste_Client_Keyring1_User0~0 := 0;~__ste_Client_Keyring1_User1~0 := 0;~__ste_Client_Keyring1_User2~0 := 0;~__ste_Client_Keyring2_User0~0 := 0;~__ste_Client_Keyring2_User1~0 := 0;~__ste_Client_Keyring2_User2~0 := 0;~__ste_Client_Keyring0_PublicKey0~0 := 0;~__ste_Client_Keyring0_PublicKey1~0 := 0;~__ste_Client_Keyring0_PublicKey2~0 := 0;~__ste_Client_Keyring1_PublicKey0~0 := 0;~__ste_Client_Keyring1_PublicKey1~0 := 0;~__ste_Client_Keyring1_PublicKey2~0 := 0;~__ste_Client_Keyring2_PublicKey0~0 := 0;~__ste_Client_Keyring2_PublicKey1~0 := 0;~__ste_Client_Keyring2_PublicKey2~0 := 0;~__ste_client_forwardReceiver0~0 := 0;~__ste_client_forwardReceiver1~0 := 0;~__ste_client_forwardReceiver2~0 := 0;~__ste_client_forwardReceiver3~0 := 0;~__ste_client_idCounter0~0 := 0;~__ste_client_idCounter1~0 := 0;~__ste_client_idCounter2~0 := 0; {146#unseeded} is VALID [2022-02-21 04:08:56,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_~retValue_acc~0#1, main_~tmp~1#1;main_~retValue_acc~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~tmp~1#1;assume { :begin_inline_select_helpers } true; {146#unseeded} is VALID [2022-02-21 04:08:56,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#unseeded} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {146#unseeded} is VALID [2022-02-21 04:08:56,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {146#unseeded} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~2#1;havoc valid_product_~retValue_acc~2#1;valid_product_~retValue_acc~2#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~2#1; {146#unseeded} is VALID [2022-02-21 04:08:56,865 INFO L290 TraceCheckUtils]: 4: Hoare triple {146#unseeded} main_#t~ret13#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~1#1 := main_#t~ret13#1;havoc main_#t~ret13#1; {146#unseeded} is VALID [2022-02-21 04:08:56,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#unseeded} assume 0 != main_~tmp~1#1;assume { :begin_inline_setup } true;havoc setup_#t~nondet9#1, setup_#t~nondet10#1, setup_#t~nondet11#1, setup_~__cil_tmp1~0#1.base, setup_~__cil_tmp1~0#1.offset, setup_~__cil_tmp2~0#1.base, setup_~__cil_tmp2~0#1.offset, setup_~__cil_tmp3~0#1.base, setup_~__cil_tmp3~0#1.offset;havoc setup_~__cil_tmp1~0#1.base, setup_~__cil_tmp1~0#1.offset;havoc setup_~__cil_tmp2~0#1.base, setup_~__cil_tmp2~0#1.offset;havoc setup_~__cil_tmp3~0#1.base, setup_~__cil_tmp3~0#1.offset;~bob~0 := 1;assume { :begin_inline_setup_bob } true;setup_bob_#in~bob___0#1 := ~bob~0;havoc setup_bob_~bob___0#1;setup_bob_~bob___0#1 := setup_bob_#in~bob___0#1;assume { :begin_inline_setClientId } true;setClientId_#in~handle#1, setClientId_#in~value#1 := setup_bob_~bob___0#1, setup_bob_~bob___0#1;havoc setClientId_~handle#1, setClientId_~value#1;setClientId_~handle#1 := setClientId_#in~handle#1;setClientId_~value#1 := setClientId_#in~value#1; {146#unseeded} is VALID [2022-02-21 04:08:56,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#unseeded} assume 1 == setClientId_~handle#1;~__ste_client_idCounter0~0 := setClientId_~value#1; {146#unseeded} is VALID [2022-02-21 04:08:56,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#unseeded} assume { :end_inline_setClientId } true; {146#unseeded} is VALID [2022-02-21 04:08:56,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#unseeded} assume { :end_inline_setup_bob } true;setup_~__cil_tmp1~0#1.base, setup_~__cil_tmp1~0#1.offset := 6, 0;havoc setup_#t~nondet9#1;~rjh~0 := 2;assume { :begin_inline_setup_rjh } true;setup_rjh_#in~rjh___0#1 := ~rjh~0;havoc setup_rjh_~rjh___0#1;setup_rjh_~rjh___0#1 := setup_rjh_#in~rjh___0#1;assume { :begin_inline_setClientId } true;setClientId_#in~handle#1, setClientId_#in~value#1 := setup_rjh_~rjh___0#1, setup_rjh_~rjh___0#1;havoc setClientId_~handle#1, setClientId_~value#1;setClientId_~handle#1 := setClientId_#in~handle#1;setClientId_~value#1 := setClientId_#in~value#1; {146#unseeded} is VALID [2022-02-21 04:08:56,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#unseeded} assume 1 == setClientId_~handle#1;~__ste_client_idCounter0~0 := setClientId_~value#1; {146#unseeded} is VALID [2022-02-21 04:08:56,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#unseeded} assume { :end_inline_setClientId } true; {146#unseeded} is VALID [2022-02-21 04:08:56,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#unseeded} assume { :end_inline_setup_rjh } true;setup_~__cil_tmp2~0#1.base, setup_~__cil_tmp2~0#1.offset := 7, 0;havoc setup_#t~nondet10#1;~chuck~0 := 3;assume { :begin_inline_setup_chuck } true;setup_chuck_#in~chuck___0#1 := ~chuck~0;havoc setup_chuck_~chuck___0#1;setup_chuck_~chuck___0#1 := setup_chuck_#in~chuck___0#1;assume { :begin_inline_setClientId } true;setClientId_#in~handle#1, setClientId_#in~value#1 := setup_chuck_~chuck___0#1, setup_chuck_~chuck___0#1;havoc setClientId_~handle#1, setClientId_~value#1;setClientId_~handle#1 := setClientId_#in~handle#1;setClientId_~value#1 := setClientId_#in~value#1; {146#unseeded} is VALID [2022-02-21 04:08:56,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#unseeded} assume 1 == setClientId_~handle#1;~__ste_client_idCounter0~0 := setClientId_~value#1; {146#unseeded} is VALID [2022-02-21 04:08:56,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {146#unseeded} assume { :end_inline_setClientId } true; {146#unseeded} is VALID [2022-02-21 04:08:56,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {146#unseeded} assume { :end_inline_setup_chuck } true;setup_~__cil_tmp3~0#1.base, setup_~__cil_tmp3~0#1.offset := 8, 0;havoc setup_#t~nondet11#1; {146#unseeded} is VALID [2022-02-21 04:08:56,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {146#unseeded} assume { :end_inline_setup } true;assume { :begin_inline_test } true;havoc test_#t~nondet14#1, test_#t~nondet15#1, test_#t~nondet16#1, test_#t~nondet17#1, test_#t~nondet18#1, test_#t~nondet19#1, test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_#t~nondet23#1, test_#t~nondet24#1, test_~op1~0#1, test_~op2~0#1, test_~op3~0#1, test_~op4~0#1, test_~op5~0#1, test_~op6~0#1, test_~op7~0#1, test_~op8~0#1, test_~op9~0#1, test_~op10~0#1, test_~op11~0#1, test_~splverifierCounter~0#1, test_~tmp~2#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1, test_~tmp___3~0#1, test_~tmp___4~0#1, test_~tmp___5~0#1, test_~tmp___6~0#1, test_~tmp___7~0#1, test_~tmp___8~0#1, test_~tmp___9~0#1;havoc test_~op1~0#1;havoc test_~op2~0#1;havoc test_~op3~0#1;havoc test_~op4~0#1;havoc test_~op5~0#1;havoc test_~op6~0#1;havoc test_~op7~0#1;havoc test_~op8~0#1;havoc test_~op9~0#1;havoc test_~op10~0#1;havoc test_~op11~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~2#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;havoc test_~tmp___3~0#1;havoc test_~tmp___4~0#1;havoc test_~tmp___5~0#1;havoc test_~tmp___6~0#1;havoc test_~tmp___7~0#1;havoc test_~tmp___8~0#1;havoc test_~tmp___9~0#1;test_~op1~0#1 := 0;test_~op2~0#1 := 0;test_~op3~0#1 := 0;test_~op4~0#1 := 0;test_~op5~0#1 := 0;test_~op6~0#1 := 0;test_~op7~0#1 := 0;test_~op8~0#1 := 0;test_~op9~0#1 := 0;test_~op10~0#1 := 0;test_~op11~0#1 := 0;test_~splverifierCounter~0#1 := 0; {146#unseeded} is VALID [2022-02-21 04:08:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:08:56,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:08:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:08:56,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:08:57,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {149#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_test_~splverifierCounter~0#1|) 7))} assume !false; {149#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_test_~splverifierCounter~0#1|) 7))} is VALID [2022-02-21 04:08:57,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_test_~splverifierCounter~0#1|) 7))} assume test_~splverifierCounter~0#1 < 4; {212#(and (< |ULTIMATE.start_test_~splverifierCounter~0#1| 4) (>= oldRank0 (+ (* |ULTIMATE.start_test_~splverifierCounter~0#1| (- 2)) 7)))} is VALID [2022-02-21 04:08:57,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#(and (< |ULTIMATE.start_test_~splverifierCounter~0#1| 4) (>= oldRank0 (+ (* |ULTIMATE.start_test_~splverifierCounter~0#1| (- 2)) 7)))} test_~splverifierCounter~0#1 := 1 + test_~splverifierCounter~0#1; {216#(and (< (div (+ (- 7) oldRank0) (- 2)) 4) (<= (+ (div (+ (- 7) oldRank0) (- 2)) 1) |ULTIMATE.start_test_~splverifierCounter~0#1|))} is VALID [2022-02-21 04:08:57,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {216#(and (< (div (+ (- 7) oldRank0) (- 2)) 4) (<= (+ (div (+ (- 7) oldRank0) (- 2)) 1) |ULTIMATE.start_test_~splverifierCounter~0#1|))} assume 0 == test_~op1~0#1;test_~tmp___9~0#1 := test_#t~nondet14#1;havoc test_#t~nondet14#1; {216#(and (< (div (+ (- 7) oldRank0) (- 2)) 4) (<= (+ (div (+ (- 7) oldRank0) (- 2)) 1) |ULTIMATE.start_test_~splverifierCounter~0#1|))} is VALID [2022-02-21 04:08:57,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {216#(and (< (div (+ (- 7) oldRank0) (- 2)) 4) (<= (+ (div (+ (- 7) oldRank0) (- 2)) 1) |ULTIMATE.start_test_~splverifierCounter~0#1|))} assume 0 != test_~tmp___9~0#1;test_~op1~0#1 := 1; {159#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_test_~splverifierCounter~0#1|) 7))) unseeded)} is VALID [2022-02-21 04:08:57,072 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:08:57,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:08:57,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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:08:57,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:08:57,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:08:57,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,119 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 04:08:57,122 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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:08:57,529 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 339 states and 513 transitions. Complement of second has 7 states. [2022-02-21 04:08:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:08:57,529 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:08:57,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 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:08:57,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-02-21 04:08:57,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:08:57,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:08:57,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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:08:57,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:08:57,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:08:57,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:08:57,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 339 states and 513 transitions. [2022-02-21 04:08:57,556 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:08:57,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:08:57,558 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 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:08:57,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-02-21 04:08:57,570 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 30 examples of accepted words. [2022-02-21 04:08:57,571 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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:08:57,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 04:08:57,575 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:08:57,575 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 339 states and 513 transitions. cyclomatic complexity: 175 [2022-02-21 04:08:57,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 339 states and 513 transitions. cyclomatic complexity: 175 [2022-02-21 04:08:57,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:08:57,576 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:08:57,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:08:57,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:08:57,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:08:57,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 04:08:57,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 04:08:57,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:08:57,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 339 letters. Loop has 339 letters. [2022-02-21 04:08:57,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 339 letters. Loop has 339 letters. [2022-02-21 04:08:57,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 339 letters. Loop has 339 letters. [2022-02-21 04:08:57,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 137 letters. [2022-02-21 04:08:57,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 137 letters. [2022-02-21 04:08:57,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 137 letters. Loop has 137 letters. [2022-02-21 04:08:57,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:08:57,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:08:57,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:08:57,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:08:57,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:08:57,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 23 letters. Loop has 8 letters. [2022-02-21 04:08:57,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 9 letters. [2022-02-21 04:08:57,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 9 letters. [2022-02-21 04:08:57,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 23 letters. Loop has 9 letters. [2022-02-21 04:08:57,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 9 letters. [2022-02-21 04:08:57,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 9 letters. [2022-02-21 04:08:57,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 22 letters. Loop has 9 letters. [2022-02-21 04:08:57,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 13 letters. [2022-02-21 04:08:57,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 13 letters. [2022-02-21 04:08:57,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 27 letters. Loop has 13 letters. [2022-02-21 04:08:57,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 9 letters. [2022-02-21 04:08:57,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 9 letters. [2022-02-21 04:08:57,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 23 letters. Loop has 9 letters. [2022-02-21 04:08:57,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 9 letters. [2022-02-21 04:08:57,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 9 letters. [2022-02-21 04:08:57,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 24 letters. Loop has 9 letters. [2022-02-21 04:08:57,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 13 letters. [2022-02-21 04:08:57,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 13 letters. [2022-02-21 04:08:57,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 28 letters. Loop has 13 letters. [2022-02-21 04:08:57,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 04:08:57,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 04:08:57,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 20 letters. Loop has 7 letters. [2022-02-21 04:08:57,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:08:57,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:08:57,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:08:57,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 04:08:57,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 04:08:57,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 21 letters. Loop has 7 letters. [2022-02-21 04:08:57,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 12 letters. [2022-02-21 04:08:57,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 12 letters. [2022-02-21 04:08:57,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 27 letters. Loop has 12 letters. [2022-02-21 04:08:57,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 14 letters. [2022-02-21 04:08:57,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 14 letters. [2022-02-21 04:08:57,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 28 letters. Loop has 14 letters. [2022-02-21 04:08:57,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 15 letters. [2022-02-21 04:08:57,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 15 letters. [2022-02-21 04:08:57,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 30 letters. Loop has 15 letters. [2022-02-21 04:08:57,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 11 letters. [2022-02-21 04:08:57,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 11 letters. [2022-02-21 04:08:57,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 24 letters. Loop has 11 letters. [2022-02-21 04:08:57,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 15 letters. [2022-02-21 04:08:57,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 15 letters. [2022-02-21 04:08:57,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 29 letters. Loop has 15 letters. [2022-02-21 04:08:57,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:08:57,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:08:57,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 21 letters. Loop has 8 letters. [2022-02-21 04:08:57,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 14 letters. [2022-02-21 04:08:57,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 14 letters. [2022-02-21 04:08:57,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 29 letters. Loop has 14 letters. [2022-02-21 04:08:57,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:08:57,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:08:57,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 25 letters. Loop has 10 letters. [2022-02-21 04:08:57,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 11 letters. [2022-02-21 04:08:57,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 11 letters. [2022-02-21 04:08:57,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 25 letters. Loop has 11 letters. [2022-02-21 04:08:57,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 10 letters. [2022-02-21 04:08:57,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 10 letters. [2022-02-21 04:08:57,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 24 letters. Loop has 10 letters. [2022-02-21 04:08:57,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 12 letters. [2022-02-21 04:08:57,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 12 letters. [2022-02-21 04:08:57,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 26 letters. Loop has 12 letters. [2022-02-21 04:08:57,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 10 letters. [2022-02-21 04:08:57,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 10 letters. [2022-02-21 04:08:57,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 23 letters. Loop has 10 letters. [2022-02-21 04:08:57,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 9 letters. [2022-02-21 04:08:57,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 9 letters. [2022-02-21 04:08:57,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 24 letters. Loop has 9 letters. [2022-02-21 04:08:57,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 11 letters. [2022-02-21 04:08:57,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 11 letters. [2022-02-21 04:08:57,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 26 letters. Loop has 11 letters. [2022-02-21 04:08:57,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 7 letters. [2022-02-21 04:08:57,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 7 letters. [2022-02-21 04:08:57,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 22 letters. Loop has 7 letters. [2022-02-21 04:08:57,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:08:57,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:08:57,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 22 letters. Loop has 8 letters. [2022-02-21 04:08:57,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:08:57,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:08:57,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 17 letters. Loop has 5 letters. [2022-02-21 04:08:57,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:08:57,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:08:57,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 18 letters. Loop has 5 letters. [2022-02-21 04:08:57,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:08:57,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:08:57,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 19 letters. Loop has 5 letters. [2022-02-21 04:08:57,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 5 letters. [2022-02-21 04:08:57,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 5 letters. [2022-02-21 04:08:57,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 20 letters. Loop has 5 letters. [2022-02-21 04:08:57,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:08:57,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:08:57,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:08:57,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 137 states, 136 states have (on average 1.5514705882352942) internal successors, (211), 136 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 04:08:57,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 04:08:57,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 339 states and 513 transitions. cyclomatic complexity: 175 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:08:57,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,626 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:08:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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:08:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2022-02-21 04:08:57,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 336 transitions. Stem has 16 letters. Loop has 5 letters. [2022-02-21 04:08:57,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 336 transitions. Stem has 21 letters. Loop has 5 letters. [2022-02-21 04:08:57,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 336 transitions. Stem has 16 letters. Loop has 10 letters. [2022-02-21 04:08:57,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:08:57,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 339 states and 513 transitions. cyclomatic complexity: 175 [2022-02-21 04:08:57,646 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:08:57,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 339 states to 0 states and 0 transitions. [2022-02-21 04:08:57,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:08:57,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:08:57,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:08:57,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:08:57,649 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:08:57,649 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:08:57,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:08:57,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:08:57,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:08:57,654 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:08:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:08:57,656 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:08:57,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:08:57,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:08:57,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:08:57,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:08:57,671 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:08:57,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:08:57,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:08:57,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:08:57,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:08:57,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:08:57,672 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:08:57,672 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:08:57,672 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:08:57,672 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:08:57,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:08:57,672 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:08:57,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:08:57,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:08:57 BoogieIcfgContainer [2022-02-21 04:08:57,678 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:08:57,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:08:57,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:08:57,678 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:08:57,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:08:55" (3/4) ... [2022-02-21 04:08:57,681 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:08:57,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:08:57,682 INFO L158 Benchmark]: Toolchain (without parser) took 3612.44ms. Allocated memory was 86.0MB in the beginning and 138.4MB in the end (delta: 52.4MB). Free memory was 63.7MB in the beginning and 79.1MB in the end (delta: -15.4MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2022-02-21 04:08:57,683 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 86.0MB. Free memory was 64.0MB in the beginning and 64.0MB in the end (delta: 50.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:08:57,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.71ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 63.5MB in the beginning and 83.6MB in the end (delta: -20.0MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2022-02-21 04:08:57,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.65ms. Allocated memory is still 109.1MB. Free memory was 83.6MB in the beginning and 77.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:08:57,684 INFO L158 Benchmark]: Boogie Preprocessor took 60.65ms. Allocated memory is still 109.1MB. Free memory was 77.8MB in the beginning and 74.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:08:57,684 INFO L158 Benchmark]: RCFGBuilder took 734.17ms. Allocated memory is still 109.1MB. Free memory was 74.9MB in the beginning and 77.1MB in the end (delta: -2.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2022-02-21 04:08:57,685 INFO L158 Benchmark]: BuchiAutomizer took 2015.98ms. Allocated memory was 109.1MB in the beginning and 138.4MB in the end (delta: 29.4MB). Free memory was 76.5MB in the beginning and 79.1MB in the end (delta: -2.6MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2022-02-21 04:08:57,685 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 138.4MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:08:57,687 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.22ms. Allocated memory is still 86.0MB. Free memory was 64.0MB in the beginning and 64.0MB in the end (delta: 50.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 695.71ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 63.5MB in the beginning and 83.6MB in the end (delta: -20.0MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.65ms. Allocated memory is still 109.1MB. Free memory was 83.6MB in the beginning and 77.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.65ms. Allocated memory is still 109.1MB. Free memory was 77.8MB in the beginning and 74.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 734.17ms. Allocated memory is still 109.1MB. Free memory was 74.9MB in the beginning and 77.1MB in the end (delta: -2.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 2015.98ms. Allocated memory was 109.1MB in the beginning and 138.4MB in the end (delta: 29.4MB). Free memory was 76.5MB in the beginning and 79.1MB in the end (delta: -2.6MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 138.4MB. Free memory is still 79.1MB. 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * splverifierCounter + 7 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 545 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 205 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf94 smp100 dnf150 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 33ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 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:08:57,720 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