./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.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/bitvector/soft_float_1-3a.c.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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:37:07,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:37:07,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:37:07,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:37:07,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:37:07,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:37:07,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:37:07,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:37:07,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:37:07,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:37:07,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:37:07,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:37:07,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:37:07,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:37:07,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:37:07,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:37:07,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:37:07,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:37:07,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:37:07,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:37:07,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:37:07,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:37:07,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:37:07,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:37:07,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:37:07,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:37:07,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:37:07,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:37:07,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:37:07,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:37:07,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:37:07,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:37:07,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:37:07,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:37:07,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:37:07,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:37:07,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:37:07,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:37:07,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:37:07,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:37:07,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:37:07,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:37:07,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:37:07,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:37:07,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:37:07,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:37:07,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:37:07,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:37:07,932 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:37:07,932 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:37:07,932 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:37:07,932 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:37:07,933 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:37:07,933 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:37:07,933 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:37:07,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:37:07,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:37:07,934 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:37:07,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:37:07,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:37:07,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:37:07,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:37:07,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:37:07,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:37:07,935 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:37:07,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:37:07,935 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:37:07,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:37:07,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:37:07,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:37:07,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:37:07,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:37:07,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:37:07,937 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:37:07,937 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2022-02-21 03:37:08,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:37:08,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:37:08,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:37:08,171 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:37:08,171 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:37:08,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-02-21 03:37:08,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53fb35a64/7b39667288bb46c2b7163ddafdbbd467/FLAG98bec89a0 [2022-02-21 03:37:08,537 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:37:08,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-02-21 03:37:08,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53fb35a64/7b39667288bb46c2b7163ddafdbbd467/FLAG98bec89a0 [2022-02-21 03:37:08,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53fb35a64/7b39667288bb46c2b7163ddafdbbd467 [2022-02-21 03:37:08,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:37:08,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:37:08,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:37:08,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:37:08,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:37:08,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:37:08" (1/1) ... [2022-02-21 03:37:08,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87fc587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:08, skipping insertion in model container [2022-02-21 03:37:08,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:37:08" (1/1) ... [2022-02-21 03:37:08,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:37:08,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:37:09,110 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-02-21 03:37:09,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:37:09,225 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:37:09,242 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-02-21 03:37:09,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:37:09,344 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:37:09,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:09 WrapperNode [2022-02-21 03:37:09,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:37:09,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:37:09,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:37:09,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:37:09,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:09" (1/1) ... [2022-02-21 03:37:09,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:09" (1/1) ... [2022-02-21 03:37:09,444 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 14, calls inlined = 12, statements flattened = 433 [2022-02-21 03:37:09,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:37:09,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:37:09,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:37:09,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:37:09,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:09" (1/1) ... [2022-02-21 03:37:09,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:09" (1/1) ... [2022-02-21 03:37:09,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:09" (1/1) ... [2022-02-21 03:37:09,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:09" (1/1) ... [2022-02-21 03:37:09,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:09" (1/1) ... [2022-02-21 03:37:09,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:09" (1/1) ... [2022-02-21 03:37:09,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:09" (1/1) ... [2022-02-21 03:37:09,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:37:09,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:37:09,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:37:09,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:37:09,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:09" (1/1) ... [2022-02-21 03:37:09,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:09,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:09,527 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 03:37:09,531 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 03:37:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:37:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:37:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:37:09,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:37:09,658 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:37:09,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:37:10,347 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:37:10,360 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:37:10,360 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-21 03:37:10,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:10 BoogieIcfgContainer [2022-02-21 03:37:10,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:37:10,364 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:37:10,365 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:37:10,367 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:37:10,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:10,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:37:08" (1/3) ... [2022-02-21 03:37:10,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@713f8027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:37:10, skipping insertion in model container [2022-02-21 03:37:10,369 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:10,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:09" (2/3) ... [2022-02-21 03:37:10,370 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@713f8027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:37:10, skipping insertion in model container [2022-02-21 03:37:10,370 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:10,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:10" (3/3) ... [2022-02-21 03:37:10,374 INFO L388 chiAutomizerObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2022-02-21 03:37:10,404 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:37:10,404 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:37:10,404 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:37:10,404 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:37:10,404 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:37:10,404 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:37:10,405 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:37:10,405 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:37:10,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 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 03:37:10,454 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:10,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:10,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:10,458 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:37:10,459 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:10,459 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:37:10,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 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 03:37:10,474 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:10,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:10,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:10,474 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:37:10,474 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:10,479 INFO L791 eck$LassoCheckResult]: Stem: 130#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(24, 2);call #Ultimate.allocInit(12, 3); 41#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 92#L29true assume !(0 == base2flt_~m#1 % 4294967296); 127#L35true assume !(base2flt_~m#1 % 4294967296 < 16777216); 59#L57-2true [2022-02-21 03:37:10,480 INFO L793 eck$LassoCheckResult]: Loop: 59#L57-2true assume !false; 40#L58true assume base2flt_~m#1 % 4294967296 >= 33554432; 109#L59true assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 59#L57-2true [2022-02-21 03:37:10,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash 925696, now seen corresponding path program 1 times [2022-02-21 03:37:10,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:10,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062559369] [2022-02-21 03:37:10,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:10,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:10,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {149#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(24, 2);call #Ultimate.allocInit(12, 3); {149#true} is VALID [2022-02-21 03:37:10,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {151#(= |ULTIMATE.start_base2flt_~m#1| 0)} is VALID [2022-02-21 03:37:10,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {151#(= |ULTIMATE.start_base2flt_~m#1| 0)} assume !(0 == base2flt_~m#1 % 4294967296); {151#(= |ULTIMATE.start_base2flt_~m#1| 0)} is VALID [2022-02-21 03:37:10,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {151#(= |ULTIMATE.start_base2flt_~m#1| 0)} assume !(base2flt_~m#1 % 4294967296 < 16777216); {150#false} is VALID [2022-02-21 03:37:10,647 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 03:37:10,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:10,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062559369] [2022-02-21 03:37:10,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062559369] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:10,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:10,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:37:10,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569854053] [2022-02-21 03:37:10,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:10,654 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:10,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:10,656 INFO L85 PathProgramCache]: Analyzing trace with hash 74612, now seen corresponding path program 1 times [2022-02-21 03:37:10,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:10,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438257743] [2022-02-21 03:37:10,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:10,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:10,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:10,700 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:10,736 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:10,737 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:10,737 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:10,737 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:10,737 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:10,737 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:10,737 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:10,738 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:10,738 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration1_Loop [2022-02-21 03:37:10,738 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:10,738 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:10,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:10,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:10,895 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:10,895 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:10,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:10,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:10,916 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 03:37:10,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:10,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:10,935 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 03:37:10,956 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:37:10,957 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m#1=-1} Honda state: {ULTIMATE.start_base2flt_~m#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:37:10,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:10,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:10,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:10,983 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 03:37:10,984 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 03:37:10,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:10,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:11,030 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 03:37:11,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:11,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:11,032 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 03:37:11,034 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 03:37:11,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:11,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:11,066 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:11,072 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 03:37:11,072 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:11,072 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:11,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:11,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:11,073 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:11,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:11,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:11,073 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:11,073 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration1_Loop [2022-02-21 03:37:11,074 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:11,074 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:11,075 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 03:37:11,081 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 03:37:11,189 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:11,192 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:11,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:11,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:11,194 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 03:37:11,216 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 03:37:11,216 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 03:37:11,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:11,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:11,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:11,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:11,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:11,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:11,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:11,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:11,255 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 03:37:11,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:11,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:11,257 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 03:37:11,259 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 03:37:11,261 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 03:37:11,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:11,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:11,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:11,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:11,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:11,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:11,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:11,284 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:11,287 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:11,287 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:11,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:11,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:11,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:11,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:37:11,332 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:11,332 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:11,332 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:11,332 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2022-02-21 03:37:11,366 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 03:37:11,376 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:11,380 INFO L390 LassoCheck]: Loop: "assume !false;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2;" [2022-02-21 03:37:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:11,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:11,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:11,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#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(24, 2);call #Ultimate.allocInit(12, 3); {154#unseeded} is VALID [2022-02-21 03:37:11,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {154#unseeded} is VALID [2022-02-21 03:37:11,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {154#unseeded} is VALID [2022-02-21 03:37:11,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {154#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {154#unseeded} is VALID [2022-02-21 03:37:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:11,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:11,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:11,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {157#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:11,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {157#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:11,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; {167#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:11,506 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 03:37:11,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:11,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:11,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,551 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:37:11,553 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:11,888 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 443 states and 758 transitions. Complement of second has 6 states. [2022-02-21 03:37:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:11,889 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:11,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 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 03:37:11,896 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:11,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:11,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:11,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:11,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:11,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:11,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:11,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 443 states and 758 transitions. [2022-02-21 03:37:11,916 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2022-02-21 03:37:11,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:11,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:11,923 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 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 03:37:11,930 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:11,934 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 18 examples of accepted words. [2022-02-21 03:37:11,935 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:11,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:11,941 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:37:11,941 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 443 states and 758 transitions. cyclomatic complexity: 329 [2022-02-21 03:37:11,951 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 27 examples of accepted words. [2022-02-21 03:37:11,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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 1 letters. [2022-02-21 03:37:11,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:11,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:11,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 443 letters. Loop has 443 letters. [2022-02-21 03:37:11,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 443 letters. Loop has 443 letters. [2022-02-21 03:37:11,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 443 letters. Loop has 443 letters. [2022-02-21 03:37:11,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 145 letters. [2022-02-21 03:37:11,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 145 letters. [2022-02-21 03:37:11,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 145 letters. Loop has 145 letters. [2022-02-21 03:37:11,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:37:11,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:37:11,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:37:11,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:11,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:11,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:11,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:11,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:11,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:11,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:11,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:11,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:11,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:11,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:11,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:11,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:11,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:11,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:11,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:11,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:11,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:11,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:11,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:11,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:11,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:37:11,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:11,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:11,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:37:11,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:11,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:11,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:11,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:11,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:11,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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 1 letters. [2022-02-21 03:37:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:11,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:11,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:11,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:11,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:11,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:11,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:11,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:11,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:11,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:11,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:12,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:12,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:12,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:12,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:12,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:12,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:37:12,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:12,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:12,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:37:12,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:12,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:12,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:12,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:12,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:12,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:12,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:12,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:12,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:37:12,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:12,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:12,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:12,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:12,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:12,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:12,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:12,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:12,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:12,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:12,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 145 states, 144 states have (on average 1.7430555555555556) internal successors, (251), 144 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:12,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:12,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 443 states and 758 transitions. cyclomatic complexity: 329 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:12,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,024 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:12,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2022-02-21 03:37:12,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 500 transitions. Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:12,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 500 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 500 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:37:12,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 443 states and 758 transitions. cyclomatic complexity: 329 [2022-02-21 03:37:12,064 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2022-02-21 03:37:12,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 443 states to 89 states and 146 transitions. [2022-02-21 03:37:12,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2022-02-21 03:37:12,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2022-02-21 03:37:12,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 146 transitions. [2022-02-21 03:37:12,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:12,071 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 146 transitions. [2022-02-21 03:37:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 146 transitions. [2022-02-21 03:37:12,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2022-02-21 03:37:12,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:12,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states and 146 transitions. Second operand has 70 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 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 03:37:12,091 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states and 146 transitions. Second operand has 70 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 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 03:37:12,093 INFO L87 Difference]: Start difference. First operand 89 states and 146 transitions. Second operand has 70 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 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 03:37:12,095 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:12,099 INFO L93 Difference]: Finished difference Result 89 states and 146 transitions. [2022-02-21 03:37:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 146 transitions. [2022-02-21 03:37:12,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:12,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:12,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 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 89 states and 146 transitions. [2022-02-21 03:37:12,101 INFO L87 Difference]: Start difference. First operand has 70 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 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 89 states and 146 transitions. [2022-02-21 03:37:12,101 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:12,105 INFO L93 Difference]: Finished difference Result 89 states and 146 transitions. [2022-02-21 03:37:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 146 transitions. [2022-02-21 03:37:12,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:12,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:12,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:12,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 69 states have internal predecessors, (118), 0 states have call successors, (0), 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 03:37:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2022-02-21 03:37:12,109 INFO L704 BuchiCegarLoop]: Abstraction has 70 states and 118 transitions. [2022-02-21 03:37:12,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:12,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:37:12,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:37:12,112 INFO L87 Difference]: Start difference. First operand 70 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:37:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:12,188 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-02-21 03:37:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:37:12,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:37:12,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:12,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 57 transitions. [2022-02-21 03:37:12,194 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:12,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 57 transitions. [2022-02-21 03:37:12,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-02-21 03:37:12,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-02-21 03:37:12,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 57 transitions. [2022-02-21 03:37:12,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:12,196 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 57 transitions. [2022-02-21 03:37:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 57 transitions. [2022-02-21 03:37:12,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-02-21 03:37:12,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:12,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 57 transitions. Second operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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 03:37:12,198 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 57 transitions. Second operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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 03:37:12,198 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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 03:37:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:12,199 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-02-21 03:37:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2022-02-21 03:37:12,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:12,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:12,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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 39 states and 57 transitions. [2022-02-21 03:37:12,200 INFO L87 Difference]: Start difference. First operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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 39 states and 57 transitions. [2022-02-21 03:37:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:12,201 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2022-02-21 03:37:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2022-02-21 03:37:12,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:12,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:12,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:12,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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 03:37:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2022-02-21 03:37:12,202 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-02-21 03:37:12,202 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-02-21 03:37:12,202 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:37:12,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 48 transitions. [2022-02-21 03:37:12,203 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:12,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:12,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:12,203 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:12,203 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:12,204 INFO L791 eck$LassoCheckResult]: Stem: 1132#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3); 1110#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1111#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1134#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1113#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1114#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 1115#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 1116#L47-3 [2022-02-21 03:37:12,204 INFO L793 eck$LassoCheckResult]: Loop: 1116#L47-3 assume !false; 1133#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 1125#L47-2 assume base2flt_~m#1 % 4294967296 < 16777216; 1116#L47-3 [2022-02-21 03:37:12,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1807920711, now seen corresponding path program 1 times [2022-02-21 03:37:12,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:12,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869950258] [2022-02-21 03:37:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,214 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,223 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,225 INFO L85 PathProgramCache]: Analyzing trace with hash 153118, now seen corresponding path program 1 times [2022-02-21 03:37:12,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:12,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346724148] [2022-02-21 03:37:12,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:12,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,234 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:12,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,235 INFO L85 PathProgramCache]: Analyzing trace with hash 876132888, now seen corresponding path program 1 times [2022-02-21 03:37:12,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:12,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364035038] [2022-02-21 03:37:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:12,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,247 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,259 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:12,281 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:12,281 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:12,281 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:12,281 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:12,281 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:12,281 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,281 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:12,282 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:12,282 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration2_Loop [2022-02-21 03:37:12,282 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:12,282 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:12,283 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 03:37:12,287 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 03:37:12,347 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:12,347 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:12,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:12,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:12,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:37:12,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:12,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:12,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:12,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:12,395 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:12,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:12,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:12,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:37:12,432 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:12,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:12,436 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:12,436 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:12,436 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:12,436 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:12,436 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:12,436 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,436 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:12,436 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:12,436 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration2_Loop [2022-02-21 03:37:12,436 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:12,436 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:12,437 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 03:37:12,442 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 03:37:12,518 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:12,518 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:12,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:12,519 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:12,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:37:12,538 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 03:37:12,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:12,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:12,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:12,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:12,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:12,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:12,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:12,560 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:12,563 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:12,563 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:12,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:12,564 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:12,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:37:12,567 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:12,567 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:12,567 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:12,567 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2022-02-21 03:37:12,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:37:12,588 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:12,591 INFO L390 LassoCheck]: Loop: "assume !false;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1;" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2022-02-21 03:37:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:12,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:12,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:12,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:12,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {1224#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(24, 2);call #Ultimate.allocInit(12, 3); {1224#unseeded} is VALID [2022-02-21 03:37:12,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {1224#unseeded} is VALID [2022-02-21 03:37:12,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {1224#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {1224#unseeded} is VALID [2022-02-21 03:37:12,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {1224#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {1224#unseeded} is VALID [2022-02-21 03:37:12,634 INFO L290 TraceCheckUtils]: 4: Hoare triple {1224#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {1224#unseeded} is VALID [2022-02-21 03:37:12,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {1224#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {1224#unseeded} is VALID [2022-02-21 03:37:12,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {1224#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {1224#unseeded} is VALID [2022-02-21 03:37:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:12,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:12,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:12,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {1227#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !false; {1227#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} is VALID [2022-02-21 03:37:12,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {1227#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {1263#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} is VALID [2022-02-21 03:37:12,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {1263#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} assume base2flt_~m#1 % 4294967296 < 16777216; {1237#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))) unseeded)} is VALID [2022-02-21 03:37:12,709 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 03:37:12,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:12,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:12,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,715 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:37:12,715 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 48 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:12,807 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 48 transitions. cyclomatic complexity: 19. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 69 states and 103 transitions. Complement of second has 5 states. [2022-02-21 03:37:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:12,807 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:12,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 48 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:12,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:12,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:12,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:12,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:12,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:12,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:12,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 103 transitions. [2022-02-21 03:37:12,809 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-02-21 03:37:12,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:12,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:12,809 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 48 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:12,810 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:37:12,810 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:12,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:12,810 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:12,810 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 69 states and 103 transitions. cyclomatic complexity: 40 [2022-02-21 03:37:12,811 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:37:12,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:12,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:12,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:12,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 69 letters. Loop has 69 letters. [2022-02-21 03:37:12,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 69 letters. [2022-02-21 03:37:12,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 69 letters. Loop has 69 letters. [2022-02-21 03:37:12,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:37:12,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:37:12,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 33 letters. Loop has 33 letters. [2022-02-21 03:37:12,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:12,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:12,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:12,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:12,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:12,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:12,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:12,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:12,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:12,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:12,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:12,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:12,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:12,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:12,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:12,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:12,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:12,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:12,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:12,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:12,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:12,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:12,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:12,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:12,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:12,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:12,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 48 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:12,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:12,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 103 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:12,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,829 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-21 03:37:12,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:12,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:12,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:37:12,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:12,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 103 transitions. cyclomatic complexity: 40 [2022-02-21 03:37:12,832 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-02-21 03:37:12,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 57 states and 82 transitions. [2022-02-21 03:37:12,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2022-02-21 03:37:12,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-02-21 03:37:12,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 82 transitions. [2022-02-21 03:37:12,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:12,835 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 82 transitions. [2022-02-21 03:37:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 82 transitions. [2022-02-21 03:37:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2022-02-21 03:37:12,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:12,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states and 82 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 03:37:12,839 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states and 82 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 03:37:12,840 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 03:37:12,840 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:12,842 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2022-02-21 03:37:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-02-21 03:37:12,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:12,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:12,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 57 states and 82 transitions. [2022-02-21 03:37:12,843 INFO L87 Difference]: Start difference. First operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 57 states and 82 transitions. [2022-02-21 03:37:12,844 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:12,847 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2022-02-21 03:37:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2022-02-21 03:37:12,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:12,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:12,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:12,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 03:37:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2022-02-21 03:37:12,848 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:12,849 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:12,849 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:37:12,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 52 transitions. [2022-02-21 03:37:12,849 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:37:12,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:12,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:12,849 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:12,849 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:12,849 INFO L791 eck$LassoCheckResult]: Stem: 1375#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3); 1349#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1350#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1376#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1352#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1353#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 1357#L35-1 assume !(base2flt_~m#1 % 4294967296 < 16777216); 1359#L57-5 [2022-02-21 03:37:12,849 INFO L793 eck$LassoCheckResult]: Loop: 1359#L57-5 assume !false; 1354#L58-1 assume base2flt_~m#1 % 4294967296 >= 33554432; 1355#L59-1 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 1359#L57-5 [2022-02-21 03:37:12,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1807920737, now seen corresponding path program 1 times [2022-02-21 03:37:12,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:12,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539282516] [2022-02-21 03:37:12,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:12,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,870 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,877 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash 178877, now seen corresponding path program 1 times [2022-02-21 03:37:12,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:12,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061817737] [2022-02-21 03:37:12,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:12,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,883 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,887 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash 876933213, now seen corresponding path program 1 times [2022-02-21 03:37:12,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:12,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506692009] [2022-02-21 03:37:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:12,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,897 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,909 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:12,934 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:12,934 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:12,935 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:12,935 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:12,935 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:12,935 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:12,935 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:12,935 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:12,935 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration3_Loop [2022-02-21 03:37:12,935 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:12,935 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:12,936 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 03:37:12,941 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 03:37:13,046 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:13,047 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:13,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,048 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:13,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:37:13,051 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:13,051 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:13,100 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:37:13,100 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m#1=-1} Honda state: {ULTIMATE.start_base2flt_~m#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:37:13,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:13,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,108 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:13,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:37:13,111 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:13,111 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:13,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:13,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,172 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:13,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:37:13,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:13,175 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:13,212 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:13,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:13,217 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:13,217 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:13,217 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:13,217 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:13,217 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:13,217 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,217 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:13,217 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:13,217 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration3_Loop [2022-02-21 03:37:13,217 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:13,217 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:13,218 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 03:37:13,225 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 03:37:13,326 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:13,326 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:13,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,339 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:13,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:37:13,343 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 03:37:13,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:13,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:13,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:13,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:13,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:13,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:13,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:13,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:13,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:13,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,397 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:13,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:37:13,399 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 03:37:13,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:13,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:13,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:13,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:13,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:13,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:13,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:13,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:13,415 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:13,415 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:13,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,417 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:13,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:37:13,420 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:13,421 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:13,421 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:13,421 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2022-02-21 03:37:13,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:13,445 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:13,449 INFO L390 LassoCheck]: Loop: "assume !false;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2;" [2022-02-21 03:37:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:13,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {1618#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(24, 2);call #Ultimate.allocInit(12, 3); {1618#unseeded} is VALID [2022-02-21 03:37:13,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {1618#unseeded} is VALID [2022-02-21 03:37:13,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {1618#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {1618#unseeded} is VALID [2022-02-21 03:37:13,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {1618#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {1618#unseeded} is VALID [2022-02-21 03:37:13,505 INFO L290 TraceCheckUtils]: 4: Hoare triple {1618#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {1618#unseeded} is VALID [2022-02-21 03:37:13,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {1618#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {1618#unseeded} is VALID [2022-02-21 03:37:13,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {1618#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {1618#unseeded} is VALID [2022-02-21 03:37:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:13,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {1621#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {1621#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:13,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {1621#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {1621#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:13,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {1621#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; {1631#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:13,528 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 03:37:13,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:13,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:13,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:13,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,534 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:37:13,534 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 52 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:13,615 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 52 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 71 states and 106 transitions. Complement of second has 5 states. [2022-02-21 03:37:13,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:13,615 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:13,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 52 transitions. cyclomatic complexity: 20 [2022-02-21 03:37:13,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:13,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:13,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:13,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:13,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:13,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:13,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 106 transitions. [2022-02-21 03:37:13,617 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:13,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:13,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:13,617 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 52 transitions. cyclomatic complexity: 20 [2022-02-21 03:37:13,618 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:37:13,618 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:13,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:13,619 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:13,619 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 71 states and 106 transitions. cyclomatic complexity: 41 [2022-02-21 03:37:13,619 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:37:13,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 71 letters. Loop has 71 letters. [2022-02-21 03:37:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 71 letters. [2022-02-21 03:37:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 71 letters. Loop has 71 letters. [2022-02-21 03:37:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:37:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:37:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:37:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:37:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:37:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 71 states and 106 transitions. cyclomatic complexity: 41 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,630 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-21 03:37:13,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:13,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:13,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:37:13,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:13,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 106 transitions. cyclomatic complexity: 41 [2022-02-21 03:37:13,634 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:13,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 59 states and 85 transitions. [2022-02-21 03:37:13,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-02-21 03:37:13,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2022-02-21 03:37:13,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 85 transitions. [2022-02-21 03:37:13,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:13,635 INFO L681 BuchiCegarLoop]: Abstraction has 59 states and 85 transitions. [2022-02-21 03:37:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 85 transitions. [2022-02-21 03:37:13,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-02-21 03:37:13,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:13,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states and 85 transitions. Second operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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 03:37:13,644 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states and 85 transitions. Second operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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 03:37:13,645 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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 03:37:13,645 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:13,648 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-02-21 03:37:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2022-02-21 03:37:13,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:13,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:13,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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 59 states and 85 transitions. [2022-02-21 03:37:13,649 INFO L87 Difference]: Start difference. First operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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 59 states and 85 transitions. [2022-02-21 03:37:13,649 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:13,650 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2022-02-21 03:37:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2022-02-21 03:37:13,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:13,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:13,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:13,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.435897435897436) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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 03:37:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2022-02-21 03:37:13,652 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2022-02-21 03:37:13,652 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2022-02-21 03:37:13,652 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:37:13,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. [2022-02-21 03:37:13,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:37:13,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:13,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:13,652 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:13,652 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:13,653 INFO L791 eck$LassoCheckResult]: Stem: 1773#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3); 1744#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1745#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1774#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1747#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1748#L29-1 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1746#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 1761#L80-1 main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1768#L29-2 assume !(0 == base2flt_~m#1 % 4294967296); 1765#L35-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 1766#L57-8 [2022-02-21 03:37:13,655 INFO L793 eck$LassoCheckResult]: Loop: 1766#L57-8 assume !false; 1759#L58-2 assume base2flt_~m#1 % 4294967296 >= 33554432; 1760#L59-2 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 1766#L57-8 [2022-02-21 03:37:13,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash 877203369, now seen corresponding path program 1 times [2022-02-21 03:37:13,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:13,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49381321] [2022-02-21 03:37:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:13,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:13,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:13,683 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:13,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash 283142, now seen corresponding path program 1 times [2022-02-21 03:37:13,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:13,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441927439] [2022-02-21 03:37:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:13,690 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:13,695 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:13,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2110176930, now seen corresponding path program 1 times [2022-02-21 03:37:13,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:13,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:13,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184537599] [2022-02-21 03:37:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:13,710 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:13,720 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:13,745 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:13,745 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:13,745 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:13,746 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:13,746 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:13,746 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,746 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:13,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:13,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration4_Loop [2022-02-21 03:37:13,746 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:13,746 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:13,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:13,752 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 03:37:13,836 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:13,836 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:13,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,838 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:13,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:37:13,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:13,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:13,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:13,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,904 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:13,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:13,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:13,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:37:13,971 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:13,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:13,977 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:13,977 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:13,977 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:13,978 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:13,978 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:13,978 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:13,978 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:13,978 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:13,978 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration4_Loop [2022-02-21 03:37:13,978 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:13,978 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:13,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:13,984 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 03:37:14,062 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:14,062 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:14,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,076 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:14,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:37:14,137 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 03:37:14,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:14,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:14,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:14,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:14,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:14,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:14,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:14,156 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:14,159 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:14,160 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:14,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,176 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:14,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:37:14,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:14,196 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:14,197 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:14,197 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2022-02-21 03:37:14,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:14,230 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:14,244 INFO L390 LassoCheck]: Loop: "assume !false;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2;" [2022-02-21 03:37:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:14,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {2020#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(24, 2);call #Ultimate.allocInit(12, 3); {2020#unseeded} is VALID [2022-02-21 03:37:14,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {2020#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2020#unseeded} is VALID [2022-02-21 03:37:14,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {2020#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2020#unseeded} is VALID [2022-02-21 03:37:14,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {2020#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2020#unseeded} is VALID [2022-02-21 03:37:14,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {2020#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2020#unseeded} is VALID [2022-02-21 03:37:14,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {2020#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2020#unseeded} is VALID [2022-02-21 03:37:14,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {2020#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2020#unseeded} is VALID [2022-02-21 03:37:14,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {2020#unseeded} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2020#unseeded} is VALID [2022-02-21 03:37:14,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {2020#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {2020#unseeded} is VALID [2022-02-21 03:37:14,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {2020#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {2020#unseeded} is VALID [2022-02-21 03:37:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:14,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {2023#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {2023#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:14,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {2023#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {2023#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:14,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {2023#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; {2033#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:14,326 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 03:37:14,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 03:37:14,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:14,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,332 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:37:14,332 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 21 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 03:37:14,368 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 56 transitions. cyclomatic complexity: 21. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 42 states and 60 transitions. Complement of second has 4 states. [2022-02-21 03:37:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:14,368 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:14,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 56 transitions. cyclomatic complexity: 21 [2022-02-21 03:37:14,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:14,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:14,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 03:37:14,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:14,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:14,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:14,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 60 transitions. [2022-02-21 03:37:14,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:14,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:14,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:14,370 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 56 transitions. cyclomatic complexity: 21 [2022-02-21 03:37:14,370 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:37:14,371 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 03:37:14,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:14,371 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:14,371 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 60 transitions. cyclomatic complexity: 22 [2022-02-21 03:37:14,372 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:37:14,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:14,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:14,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:14,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:37:14,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:37:14,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:37:14,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:37:14,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:37:14,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:37:14,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:14,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:14,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:14,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:14,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:14,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:14,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:14,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:14,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:14,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:14,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:14,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:14,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:14,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:14,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:14,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:14,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:14,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:14,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:14,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:14,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:14,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 56 transitions. cyclomatic complexity: 21 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:14,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:14,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 60 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:14,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,380 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 03:37:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-21 03:37:14,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:14,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:14,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:37:14,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:14,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 60 transitions. cyclomatic complexity: 22 [2022-02-21 03:37:14,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:14,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 36 states and 52 transitions. [2022-02-21 03:37:14,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-02-21 03:37:14,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-02-21 03:37:14,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 52 transitions. [2022-02-21 03:37:14,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:14,385 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 52 transitions. [2022-02-21 03:37:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-21 03:37:14,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:14,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 52 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 03:37:14,387 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 52 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 03:37:14,387 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 03:37:14,387 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:14,389 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-02-21 03:37:14,389 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2022-02-21 03:37:14,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:14,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:14,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 36 states and 52 transitions. [2022-02-21 03:37:14,389 INFO L87 Difference]: Start difference. First operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 36 states and 52 transitions. [2022-02-21 03:37:14,390 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:14,391 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-02-21 03:37:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2022-02-21 03:37:14,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:14,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:14,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:14,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 0 states have call successors, (0), 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 03:37:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2022-02-21 03:37:14,392 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:14,393 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2022-02-21 03:37:14,393 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:37:14,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 52 transitions. [2022-02-21 03:37:14,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:14,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:14,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:14,393 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:14,393 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:14,394 INFO L791 eck$LassoCheckResult]: Stem: 2149#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3); 2125#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 2126#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 2152#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 2127#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 2128#L29-1 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 2129#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 2140#L80-1 main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 2146#L29-2 assume !(0 == base2flt_~m#1 % 4294967296); 2144#L35-2 assume base2flt_~m#1 % 4294967296 < 16777216; 2145#L47-5 [2022-02-21 03:37:14,394 INFO L793 eck$LassoCheckResult]: Loop: 2145#L47-5 assume !false; 2148#L38-2 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 2153#L47-4 assume base2flt_~m#1 % 4294967296 < 16777216; 2145#L47-5 [2022-02-21 03:37:14,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:14,394 INFO L85 PathProgramCache]: Analyzing trace with hash 877203343, now seen corresponding path program 1 times [2022-02-21 03:37:14,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:14,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660727211] [2022-02-21 03:37:14,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:14,405 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:14,415 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash 257383, now seen corresponding path program 1 times [2022-02-21 03:37:14,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:14,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636337437] [2022-02-21 03:37:14,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:14,420 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:14,423 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:14,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:14,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2110977255, now seen corresponding path program 1 times [2022-02-21 03:37:14,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:14,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119470418] [2022-02-21 03:37:14,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:14,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:14,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:14,447 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:14,468 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:14,468 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:14,468 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:14,468 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:14,468 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:14,468 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,468 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:14,468 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:14,469 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration5_Loop [2022-02-21 03:37:14,469 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:14,469 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:14,469 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 03:37:14,473 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 03:37:14,552 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:14,553 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:14,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,576 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:14,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:37:14,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:14,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:14,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:14,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,669 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:14,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:37:14,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:14,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:14,700 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:14,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:14,704 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:14,704 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:14,704 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:14,704 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:14,704 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:14,704 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,704 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:14,704 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:14,704 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration5_Loop [2022-02-21 03:37:14,704 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:14,704 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:14,705 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 03:37:14,720 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 03:37:14,811 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:14,811 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:14,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,813 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:14,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:37:14,816 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 03:37:14,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:14,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:14,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:14,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:14,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:14,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:14,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:14,839 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:14,851 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:14,851 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:14,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,853 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:14,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:37:14,856 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:14,856 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:14,856 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:14,856 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2022-02-21 03:37:14,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:14,881 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:14,884 INFO L390 LassoCheck]: Loop: "assume !false;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1;" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2022-02-21 03:37:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:14,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {2326#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(24, 2);call #Ultimate.allocInit(12, 3); {2326#unseeded} is VALID [2022-02-21 03:37:14,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {2326#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2326#unseeded} is VALID [2022-02-21 03:37:14,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {2326#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2326#unseeded} is VALID [2022-02-21 03:37:14,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {2326#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2326#unseeded} is VALID [2022-02-21 03:37:14,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {2326#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2326#unseeded} is VALID [2022-02-21 03:37:14,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {2326#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2326#unseeded} is VALID [2022-02-21 03:37:14,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {2326#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2326#unseeded} is VALID [2022-02-21 03:37:14,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {2326#unseeded} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2326#unseeded} is VALID [2022-02-21 03:37:14,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {2326#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {2326#unseeded} is VALID [2022-02-21 03:37:14,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {2326#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {2326#unseeded} is VALID [2022-02-21 03:37:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:14,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:15,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:15,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:15,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {2329#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !false; {2329#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} is VALID [2022-02-21 03:37:15,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {2329#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {2374#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} is VALID [2022-02-21 03:37:15,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {2374#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} assume base2flt_~m#1 % 4294967296 < 16777216; {2339#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))) unseeded)} is VALID [2022-02-21 03:37:15,052 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 03:37:15,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 03:37:15,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:15,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:15,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,059 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:37:15,059 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 52 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 03:37:15,097 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 52 transitions. cyclomatic complexity: 19. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 40 states and 56 transitions. Complement of second has 4 states. [2022-02-21 03:37:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:15,098 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:15,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 52 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:15,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:15,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:15,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 03:37:15,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:15,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:15,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:15,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. [2022-02-21 03:37:15,104 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:15,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:15,104 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 52 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:15,104 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:37:15,104 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 03:37:15,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:15,105 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:15,105 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 56 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:15,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:15,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:15,105 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:37:15,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:15,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:15,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:15,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:15,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:15,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:15,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:37:15,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:37:15,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:37:15,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:37:15,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:37:15,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:37:15,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:15,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:15,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:15,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:15,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:15,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:15,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:15,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:15,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:15,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:15,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:15,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:15,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 52 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:15,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:15,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 56 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:15,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,115 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 03:37:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-21 03:37:15,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:15,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:15,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:37:15,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:15,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 56 transitions. cyclomatic complexity: 19 [2022-02-21 03:37:15,133 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:15,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2022-02-21 03:37:15,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:37:15,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:37:15,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:37:15,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:15,133 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:15,134 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:15,134 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:15,134 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:37:15,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:37:15,134 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:15,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:15,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:37:15 BoogieIcfgContainer [2022-02-21 03:37:15,139 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:37:15,140 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:37:15,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:37:15,140 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:37:15,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:10" (3/4) ... [2022-02-21 03:37:15,142 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:37:15,142 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:37:15,143 INFO L158 Benchmark]: Toolchain (without parser) took 6179.20ms. Allocated memory was 102.8MB in the beginning and 178.3MB in the end (delta: 75.5MB). Free memory was 71.5MB in the beginning and 138.4MB in the end (delta: -66.9MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-02-21 03:37:15,143 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:15,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.63ms. Allocated memory is still 102.8MB. Free memory was 71.2MB in the beginning and 72.6MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:37:15,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.82ms. Allocated memory is still 102.8MB. Free memory was 72.6MB in the beginning and 68.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:37:15,144 INFO L158 Benchmark]: Boogie Preprocessor took 37.98ms. Allocated memory is still 102.8MB. Free memory was 68.5MB in the beginning and 66.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:37:15,144 INFO L158 Benchmark]: RCFGBuilder took 879.58ms. Allocated memory was 102.8MB in the beginning and 142.6MB in the end (delta: 39.8MB). Free memory was 66.0MB in the beginning and 101.2MB in the end (delta: -35.2MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2022-02-21 03:37:15,145 INFO L158 Benchmark]: BuchiAutomizer took 4774.88ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 101.2MB in the beginning and 138.4MB in the end (delta: -37.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:15,145 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 178.3MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:15,146 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.18ms. Allocated memory is still 83.9MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.63ms. Allocated memory is still 102.8MB. Free memory was 71.2MB in the beginning and 72.6MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.82ms. Allocated memory is still 102.8MB. Free memory was 72.6MB in the beginning and 68.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.98ms. Allocated memory is still 102.8MB. Free memory was 68.5MB in the beginning and 66.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 879.58ms. Allocated memory was 102.8MB in the beginning and 142.6MB in the end (delta: 39.8MB). Free memory was 66.0MB in the beginning and 101.2MB in the end (delta: -35.2MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 4774.88ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 101.2MB in the beginning and 138.4MB in the end (delta: -37.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 178.3MB. Free memory is still 138.4MB. 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 6 terminating modules (1 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * e + 253 and consists of 4 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 66 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 3. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 466 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 466 mSDsluCounter, 522 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 470 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp56 ukn100 mio100 lsp100 div570 bol100 ite100 ukn100 eq132 hnf96 smp42 dnf100 smp100 tf105 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:37:15,180 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