/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:32:42,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:32:42,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:32:42,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:32:42,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:32:42,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:32:42,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:32:42,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:32:42,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:32:42,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:32:42,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:32:42,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:32:42,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:32:42,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:32:42,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:32:42,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:32:42,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:32:42,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:32:42,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:32:42,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:32:42,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:32:42,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:32:42,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:32:42,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:32:42,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:32:42,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:32:42,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:32:42,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:32:42,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:32:42,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:32:42,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:32:42,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:32:42,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:32:42,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:32:42,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:32:42,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:32:42,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:32:42,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:32:42,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:32:42,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:32:42,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:32:42,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:32:42,629 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:32:42,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:32:42,631 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:32:42,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:32:42,632 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:32:42,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:32:42,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:32:42,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:32:42,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:32:42,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:32:42,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:32:42,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:32:42,633 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:32:42,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:32:42,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:32:42,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:32:42,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:32:42,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:32:42,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:32:42,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:32:42,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:32:42,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:32:42,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:32:42,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:32:42,636 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:32:42,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-bitabs/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 [2021-01-06 11:32:43,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:32:43,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:32:43,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:32:43,044 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:32:43,045 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:32:43,046 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2021-01-06 11:32:43,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b73803c5f/b9f77483c4ba463188eeec946bd8c47d/FLAG9d165bff6 [2021-01-06 11:32:43,800 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:32:43,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2021-01-06 11:32:43,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b73803c5f/b9f77483c4ba463188eeec946bd8c47d/FLAG9d165bff6 [2021-01-06 11:32:44,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b73803c5f/b9f77483c4ba463188eeec946bd8c47d [2021-01-06 11:32:44,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:32:44,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:32:44,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:32:44,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:32:44,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:32:44,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:32:44" (1/1) ... [2021-01-06 11:32:44,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261b1983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44, skipping insertion in model container [2021-01-06 11:32:44,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:32:44" (1/1) ... [2021-01-06 11:32:44,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:32:44,240 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~s__in_handshake~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres67~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres67~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_accept~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_accept_renegotiate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_accept_good~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__in_handshake~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres67~0,] [2021-01-06 11:32:44,460 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c[44298,44311] left hand side expression in assignment: lhs: VariableLHS[~__retres67~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2021-01-06 11:32:44,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:32:44,489 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~s__in_handshake~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres67~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__server~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres67~0,] left hand side expression in assignment: lhs: VariableLHS[~s__type~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_accept~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_accept_renegotiate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__shutdown~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__use_rsa_tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__cert_request~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__rwstate~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__session__cipher~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__s3__tmp__next_state___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_buf___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s__init_num~0,] left hand side expression in assignment: lhs: VariableLHS[~s__new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~s__ctx__stats__sess_accept_good~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~s__state~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~s__in_handshake~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres67~0,] [2021-01-06 11:32:44,554 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c[44298,44311] left hand side expression in assignment: lhs: VariableLHS[~__retres67~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] [2021-01-06 11:32:44,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:32:44,575 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:32:44,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44 WrapperNode [2021-01-06 11:32:44,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:32:44,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:32:44,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:32:44,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:32:44,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44" (1/1) ... [2021-01-06 11:32:44,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44" (1/1) ... [2021-01-06 11:32:44,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:32:44,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:32:44,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:32:44,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:32:44,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44" (1/1) ... [2021-01-06 11:32:44,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44" (1/1) ... [2021-01-06 11:32:44,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44" (1/1) ... [2021-01-06 11:32:44,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44" (1/1) ... [2021-01-06 11:32:44,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44" (1/1) ... [2021-01-06 11:32:44,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44" (1/1) ... [2021-01-06 11:32:44,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44" (1/1) ... [2021-01-06 11:32:44,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:32:44,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:32:44,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:32:44,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:32:44,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:32:44,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:32:44,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:32:44,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:32:44,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:32:45,009 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:32:45,722 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-01-06 11:32:45,722 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-01-06 11:32:45,739 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:32:45,739 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-01-06 11:32:45,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:32:45 BoogieIcfgContainer [2021-01-06 11:32:45,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:32:45,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:32:45,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:32:45,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:32:45,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:32:44" (1/3) ... [2021-01-06 11:32:45,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3266ce17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:32:45, skipping insertion in model container [2021-01-06 11:32:45,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:44" (2/3) ... [2021-01-06 11:32:45,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3266ce17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:32:45, skipping insertion in model container [2021-01-06 11:32:45,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:32:45" (3/3) ... [2021-01-06 11:32:45,759 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2021-01-06 11:32:45,766 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:32:45,772 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:32:45,790 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:32:45,821 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:32:45,822 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:32:45,822 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:32:45,822 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:32:45,822 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:32:45,822 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:32:45,823 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:32:45,823 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:32:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2021-01-06 11:32:45,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:32:45,851 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:45,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:45,853 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:45,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:45,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1632003015, now seen corresponding path program 1 times [2021-01-06 11:32:45,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:45,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822097001] [2021-01-06 11:32:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:32:46,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822097001] [2021-01-06 11:32:46,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:46,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:46,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671683086] [2021-01-06 11:32:46,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:46,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:46,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:46,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:46,160 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2021-01-06 11:32:46,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:46,466 INFO L93 Difference]: Finished difference Result 317 states and 547 transitions. [2021-01-06 11:32:46,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:46,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-06 11:32:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:46,482 INFO L225 Difference]: With dead ends: 317 [2021-01-06 11:32:46,482 INFO L226 Difference]: Without dead ends: 161 [2021-01-06 11:32:46,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-01-06 11:32:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2021-01-06 11:32:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2021-01-06 11:32:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2021-01-06 11:32:46,544 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 44 [2021-01-06 11:32:46,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:46,545 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2021-01-06 11:32:46,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2021-01-06 11:32:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:32:46,550 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:46,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:46,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:32:46,551 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:46,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:46,552 INFO L82 PathProgramCache]: Analyzing trace with hash -954579415, now seen corresponding path program 1 times [2021-01-06 11:32:46,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:46,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610474180] [2021-01-06 11:32:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:32:46,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610474180] [2021-01-06 11:32:46,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:46,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:46,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035937345] [2021-01-06 11:32:46,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:46,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:46,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:46,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:46,675 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand 3 states. [2021-01-06 11:32:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:46,907 INFO L93 Difference]: Finished difference Result 352 states and 565 transitions. [2021-01-06 11:32:46,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:46,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2021-01-06 11:32:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:46,914 INFO L225 Difference]: With dead ends: 352 [2021-01-06 11:32:46,914 INFO L226 Difference]: Without dead ends: 202 [2021-01-06 11:32:46,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-01-06 11:32:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2021-01-06 11:32:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2021-01-06 11:32:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 320 transitions. [2021-01-06 11:32:46,955 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 320 transitions. Word has length 45 [2021-01-06 11:32:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:46,955 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 320 transitions. [2021-01-06 11:32:46,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 320 transitions. [2021-01-06 11:32:46,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 11:32:46,961 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:46,961 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:46,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:32:46,961 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:46,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:46,965 INFO L82 PathProgramCache]: Analyzing trace with hash -420309214, now seen corresponding path program 1 times [2021-01-06 11:32:46,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:46,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149241777] [2021-01-06 11:32:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:32:47,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149241777] [2021-01-06 11:32:47,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:47,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:47,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772835094] [2021-01-06 11:32:47,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:47,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:47,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:47,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:47,117 INFO L87 Difference]: Start difference. First operand 197 states and 320 transitions. Second operand 3 states. [2021-01-06 11:32:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:47,284 INFO L93 Difference]: Finished difference Result 417 states and 681 transitions. [2021-01-06 11:32:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:47,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 11:32:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:47,287 INFO L225 Difference]: With dead ends: 417 [2021-01-06 11:32:47,288 INFO L226 Difference]: Without dead ends: 228 [2021-01-06 11:32:47,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-01-06 11:32:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2021-01-06 11:32:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2021-01-06 11:32:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 371 transitions. [2021-01-06 11:32:47,322 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 371 transitions. Word has length 72 [2021-01-06 11:32:47,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:47,322 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 371 transitions. [2021-01-06 11:32:47,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 371 transitions. [2021-01-06 11:32:47,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:32:47,332 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:47,333 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:47,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:32:47,333 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:47,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:47,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1606429448, now seen corresponding path program 1 times [2021-01-06 11:32:47,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:47,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905432042] [2021-01-06 11:32:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:32:47,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905432042] [2021-01-06 11:32:47,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:47,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:47,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350055452] [2021-01-06 11:32:47,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:47,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:47,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:47,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:47,443 INFO L87 Difference]: Start difference. First operand 228 states and 371 transitions. Second operand 3 states. [2021-01-06 11:32:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:47,563 INFO L93 Difference]: Finished difference Result 450 states and 732 transitions. [2021-01-06 11:32:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:47,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2021-01-06 11:32:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:47,566 INFO L225 Difference]: With dead ends: 450 [2021-01-06 11:32:47,566 INFO L226 Difference]: Without dead ends: 230 [2021-01-06 11:32:47,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-01-06 11:32:47,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2021-01-06 11:32:47,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2021-01-06 11:32:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 368 transitions. [2021-01-06 11:32:47,576 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 368 transitions. Word has length 84 [2021-01-06 11:32:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:47,576 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 368 transitions. [2021-01-06 11:32:47,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 368 transitions. [2021-01-06 11:32:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:32:47,578 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:47,578 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:47,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:32:47,578 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:47,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:47,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1610778141, now seen corresponding path program 1 times [2021-01-06 11:32:47,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:47,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728714146] [2021-01-06 11:32:47,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:32:47,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728714146] [2021-01-06 11:32:47,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:47,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:47,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881304106] [2021-01-06 11:32:47,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:47,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:47,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:47,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:47,646 INFO L87 Difference]: Start difference. First operand 228 states and 368 transitions. Second operand 3 states. [2021-01-06 11:32:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:47,810 INFO L93 Difference]: Finished difference Result 494 states and 800 transitions. [2021-01-06 11:32:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:47,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2021-01-06 11:32:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:47,814 INFO L225 Difference]: With dead ends: 494 [2021-01-06 11:32:47,814 INFO L226 Difference]: Without dead ends: 274 [2021-01-06 11:32:47,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-01-06 11:32:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2021-01-06 11:32:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2021-01-06 11:32:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 437 transitions. [2021-01-06 11:32:47,832 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 437 transitions. Word has length 84 [2021-01-06 11:32:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:47,832 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 437 transitions. [2021-01-06 11:32:47,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 437 transitions. [2021-01-06 11:32:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:32:47,835 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:47,835 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:47,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:32:47,835 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:47,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:47,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1470428767, now seen corresponding path program 1 times [2021-01-06 11:32:47,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:47,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630867712] [2021-01-06 11:32:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:32:47,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630867712] [2021-01-06 11:32:47,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:47,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:47,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145581739] [2021-01-06 11:32:47,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:47,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:47,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:47,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:47,953 INFO L87 Difference]: Start difference. First operand 270 states and 437 transitions. Second operand 3 states. [2021-01-06 11:32:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:48,076 INFO L93 Difference]: Finished difference Result 534 states and 864 transitions. [2021-01-06 11:32:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:48,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:32:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:48,079 INFO L225 Difference]: With dead ends: 534 [2021-01-06 11:32:48,079 INFO L226 Difference]: Without dead ends: 272 [2021-01-06 11:32:48,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-01-06 11:32:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2021-01-06 11:32:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2021-01-06 11:32:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 433 transitions. [2021-01-06 11:32:48,092 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 433 transitions. Word has length 85 [2021-01-06 11:32:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:48,094 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 433 transitions. [2021-01-06 11:32:48,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 433 transitions. [2021-01-06 11:32:48,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:32:48,101 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:48,102 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:48,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:32:48,106 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:48,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:48,107 INFO L82 PathProgramCache]: Analyzing trace with hash -564791579, now seen corresponding path program 1 times [2021-01-06 11:32:48,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:48,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599926974] [2021-01-06 11:32:48,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:32:48,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599926974] [2021-01-06 11:32:48,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:48,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:48,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055500574] [2021-01-06 11:32:48,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:48,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:48,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:48,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:48,195 INFO L87 Difference]: Start difference. First operand 270 states and 433 transitions. Second operand 3 states. [2021-01-06 11:32:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:48,332 INFO L93 Difference]: Finished difference Result 536 states and 859 transitions. [2021-01-06 11:32:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:48,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:32:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:48,335 INFO L225 Difference]: With dead ends: 536 [2021-01-06 11:32:48,335 INFO L226 Difference]: Without dead ends: 272 [2021-01-06 11:32:48,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:48,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-01-06 11:32:48,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 268. [2021-01-06 11:32:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2021-01-06 11:32:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 428 transitions. [2021-01-06 11:32:48,345 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 428 transitions. Word has length 85 [2021-01-06 11:32:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:48,345 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 428 transitions. [2021-01-06 11:32:48,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 428 transitions. [2021-01-06 11:32:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:32:48,347 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:48,347 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:48,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:32:48,347 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash 183697243, now seen corresponding path program 1 times [2021-01-06 11:32:48,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:48,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261136796] [2021-01-06 11:32:48,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:32:48,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261136796] [2021-01-06 11:32:48,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:48,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:48,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952907354] [2021-01-06 11:32:48,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:48,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:48,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:48,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:48,410 INFO L87 Difference]: Start difference. First operand 268 states and 428 transitions. Second operand 3 states. [2021-01-06 11:32:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:48,555 INFO L93 Difference]: Finished difference Result 559 states and 893 transitions. [2021-01-06 11:32:48,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:48,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 11:32:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:48,558 INFO L225 Difference]: With dead ends: 559 [2021-01-06 11:32:48,558 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:32:48,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:48,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:32:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2021-01-06 11:32:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2021-01-06 11:32:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 471 transitions. [2021-01-06 11:32:48,569 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 471 transitions. Word has length 98 [2021-01-06 11:32:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:48,570 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 471 transitions. [2021-01-06 11:32:48,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 471 transitions. [2021-01-06 11:32:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:32:48,571 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:48,571 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:48,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:32:48,572 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:48,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:48,572 INFO L82 PathProgramCache]: Analyzing trace with hash 156444990, now seen corresponding path program 1 times [2021-01-06 11:32:48,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:48,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759115448] [2021-01-06 11:32:48,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:32:48,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759115448] [2021-01-06 11:32:48,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:48,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:48,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774901089] [2021-01-06 11:32:48,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:48,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:48,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:48,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:48,616 INFO L87 Difference]: Start difference. First operand 297 states and 471 transitions. Second operand 3 states. [2021-01-06 11:32:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:48,753 INFO L93 Difference]: Finished difference Result 620 states and 985 transitions. [2021-01-06 11:32:48,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:48,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 11:32:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:48,756 INFO L225 Difference]: With dead ends: 620 [2021-01-06 11:32:48,756 INFO L226 Difference]: Without dead ends: 331 [2021-01-06 11:32:48,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-01-06 11:32:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 324. [2021-01-06 11:32:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2021-01-06 11:32:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 509 transitions. [2021-01-06 11:32:48,768 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 509 transitions. Word has length 99 [2021-01-06 11:32:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:48,769 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 509 transitions. [2021-01-06 11:32:48,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:48,769 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 509 transitions. [2021-01-06 11:32:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:32:48,770 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:48,770 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:48,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:32:48,771 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:48,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:48,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2130209566, now seen corresponding path program 1 times [2021-01-06 11:32:48,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:48,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318790202] [2021-01-06 11:32:48,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:32:48,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318790202] [2021-01-06 11:32:48,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:48,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:48,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990930724] [2021-01-06 11:32:48,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:48,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:48,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:48,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:48,823 INFO L87 Difference]: Start difference. First operand 324 states and 509 transitions. Second operand 3 states. [2021-01-06 11:32:48,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:48,986 INFO L93 Difference]: Finished difference Result 642 states and 1008 transitions. [2021-01-06 11:32:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:48,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 11:32:48,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:48,989 INFO L225 Difference]: With dead ends: 642 [2021-01-06 11:32:48,990 INFO L226 Difference]: Without dead ends: 326 [2021-01-06 11:32:48,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-01-06 11:32:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2021-01-06 11:32:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2021-01-06 11:32:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 505 transitions. [2021-01-06 11:32:49,008 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 505 transitions. Word has length 99 [2021-01-06 11:32:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:49,009 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 505 transitions. [2021-01-06 11:32:49,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 505 transitions. [2021-01-06 11:32:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:32:49,012 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:49,012 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:49,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:32:49,013 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:49,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:49,014 INFO L82 PathProgramCache]: Analyzing trace with hash -417318601, now seen corresponding path program 1 times [2021-01-06 11:32:49,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:49,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595756591] [2021-01-06 11:32:49,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 11:32:49,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595756591] [2021-01-06 11:32:49,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:49,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:49,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306674690] [2021-01-06 11:32:49,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:49,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:49,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:49,081 INFO L87 Difference]: Start difference. First operand 324 states and 505 transitions. Second operand 3 states. [2021-01-06 11:32:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:49,255 INFO L93 Difference]: Finished difference Result 647 states and 1010 transitions. [2021-01-06 11:32:49,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:49,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 11:32:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:49,258 INFO L225 Difference]: With dead ends: 647 [2021-01-06 11:32:49,258 INFO L226 Difference]: Without dead ends: 331 [2021-01-06 11:32:49,259 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-01-06 11:32:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 324. [2021-01-06 11:32:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2021-01-06 11:32:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 500 transitions. [2021-01-06 11:32:49,275 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 500 transitions. Word has length 100 [2021-01-06 11:32:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:49,276 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 500 transitions. [2021-01-06 11:32:49,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 500 transitions. [2021-01-06 11:32:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 11:32:49,279 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:49,279 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:49,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:32:49,280 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:49,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:49,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1321281040, now seen corresponding path program 1 times [2021-01-06 11:32:49,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:49,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355474930] [2021-01-06 11:32:49,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:32:49,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355474930] [2021-01-06 11:32:49,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:49,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:49,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665690339] [2021-01-06 11:32:49,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:49,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:49,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:49,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:49,326 INFO L87 Difference]: Start difference. First operand 324 states and 500 transitions. Second operand 3 states. [2021-01-06 11:32:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:49,441 INFO L93 Difference]: Finished difference Result 665 states and 1025 transitions. [2021-01-06 11:32:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:49,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 11:32:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:49,444 INFO L225 Difference]: With dead ends: 665 [2021-01-06 11:32:49,444 INFO L226 Difference]: Without dead ends: 349 [2021-01-06 11:32:49,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:49,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-01-06 11:32:49,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2021-01-06 11:32:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2021-01-06 11:32:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 525 transitions. [2021-01-06 11:32:49,458 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 525 transitions. Word has length 105 [2021-01-06 11:32:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:49,458 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 525 transitions. [2021-01-06 11:32:49,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 525 transitions. [2021-01-06 11:32:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:32:49,460 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:49,460 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:49,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:32:49,460 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:49,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:49,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1276596489, now seen corresponding path program 1 times [2021-01-06 11:32:49,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:49,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509238556] [2021-01-06 11:32:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:32:49,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509238556] [2021-01-06 11:32:49,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:49,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:49,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939424090] [2021-01-06 11:32:49,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:49,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:49,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:49,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:49,513 INFO L87 Difference]: Start difference. First operand 345 states and 525 transitions. Second operand 3 states. [2021-01-06 11:32:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:49,643 INFO L93 Difference]: Finished difference Result 686 states and 1044 transitions. [2021-01-06 11:32:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:49,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 11:32:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:49,647 INFO L225 Difference]: With dead ends: 686 [2021-01-06 11:32:49,648 INFO L226 Difference]: Without dead ends: 349 [2021-01-06 11:32:49,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:49,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-01-06 11:32:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2021-01-06 11:32:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2021-01-06 11:32:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 519 transitions. [2021-01-06 11:32:49,671 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 519 transitions. Word has length 106 [2021-01-06 11:32:49,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:49,671 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 519 transitions. [2021-01-06 11:32:49,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 519 transitions. [2021-01-06 11:32:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 11:32:49,675 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:49,675 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:49,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:32:49,675 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:49,676 INFO L82 PathProgramCache]: Analyzing trace with hash -687746511, now seen corresponding path program 1 times [2021-01-06 11:32:49,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:49,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171094124] [2021-01-06 11:32:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:32:49,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171094124] [2021-01-06 11:32:49,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:49,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:49,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910695695] [2021-01-06 11:32:49,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:49,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:49,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:49,744 INFO L87 Difference]: Start difference. First operand 345 states and 519 transitions. Second operand 3 states. [2021-01-06 11:32:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:49,794 INFO L93 Difference]: Finished difference Result 973 states and 1467 transitions. [2021-01-06 11:32:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:49,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 11:32:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:49,798 INFO L225 Difference]: With dead ends: 973 [2021-01-06 11:32:49,799 INFO L226 Difference]: Without dead ends: 636 [2021-01-06 11:32:49,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:49,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2021-01-06 11:32:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2021-01-06 11:32:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2021-01-06 11:32:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 955 transitions. [2021-01-06 11:32:49,828 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 955 transitions. Word has length 121 [2021-01-06 11:32:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:49,828 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 955 transitions. [2021-01-06 11:32:49,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 955 transitions. [2021-01-06 11:32:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 11:32:49,831 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:49,831 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:49,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:32:49,832 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash 209646767, now seen corresponding path program 1 times [2021-01-06 11:32:49,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:49,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40064148] [2021-01-06 11:32:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-01-06 11:32:49,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40064148] [2021-01-06 11:32:49,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:49,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:49,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715380865] [2021-01-06 11:32:49,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:49,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:49,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:49,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:49,899 INFO L87 Difference]: Start difference. First operand 636 states and 955 transitions. Second operand 3 states. [2021-01-06 11:32:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:49,949 INFO L93 Difference]: Finished difference Result 973 states and 1462 transitions. [2021-01-06 11:32:49,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:49,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 11:32:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:49,955 INFO L225 Difference]: With dead ends: 973 [2021-01-06 11:32:49,955 INFO L226 Difference]: Without dead ends: 971 [2021-01-06 11:32:49,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-01-06 11:32:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2021-01-06 11:32:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2021-01-06 11:32:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1460 transitions. [2021-01-06 11:32:49,994 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1460 transitions. Word has length 121 [2021-01-06 11:32:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:49,995 INFO L481 AbstractCegarLoop]: Abstraction has 971 states and 1460 transitions. [2021-01-06 11:32:49,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1460 transitions. [2021-01-06 11:32:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:32:49,997 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:49,998 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:49,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:32:49,998 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:49,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1473242480, now seen corresponding path program 1 times [2021-01-06 11:32:49,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:49,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589180260] [2021-01-06 11:32:49,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:50,010 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 11:32:50,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403577095] [2021-01-06 11:32:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:50,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:32:50,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:32:50,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589180260] [2021-01-06 11:32:50,263 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 11:32:50,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403577095] [2021-01-06 11:32:50,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:50,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:50,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333048400] [2021-01-06 11:32:50,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:50,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:50,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:50,265 INFO L87 Difference]: Start difference. First operand 971 states and 1460 transitions. Second operand 3 states. [2021-01-06 11:32:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:50,401 INFO L93 Difference]: Finished difference Result 2269 states and 3413 transitions. [2021-01-06 11:32:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:50,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 11:32:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:50,408 INFO L225 Difference]: With dead ends: 2269 [2021-01-06 11:32:50,409 INFO L226 Difference]: Without dead ends: 1306 [2021-01-06 11:32:50,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2021-01-06 11:32:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1306. [2021-01-06 11:32:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2021-01-06 11:32:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1962 transitions. [2021-01-06 11:32:50,457 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1962 transitions. Word has length 122 [2021-01-06 11:32:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:50,457 INFO L481 AbstractCegarLoop]: Abstraction has 1306 states and 1962 transitions. [2021-01-06 11:32:50,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1962 transitions. [2021-01-06 11:32:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 11:32:50,461 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:50,461 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:50,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 11:32:50,677 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:50,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:50,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1161393041, now seen corresponding path program 1 times [2021-01-06 11:32:50,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:50,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63884373] [2021-01-06 11:32:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:50,692 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 11:32:50,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471741746] [2021-01-06 11:32:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:50,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:32:50,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:32:50,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63884373] [2021-01-06 11:32:50,946 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 11:32:50,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471741746] [2021-01-06 11:32:50,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:50,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:50,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073639521] [2021-01-06 11:32:50,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:50,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:50,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:50,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:50,954 INFO L87 Difference]: Start difference. First operand 1306 states and 1962 transitions. Second operand 3 states. [2021-01-06 11:32:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:51,021 INFO L93 Difference]: Finished difference Result 2604 states and 3915 transitions. [2021-01-06 11:32:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:51,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2021-01-06 11:32:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:51,030 INFO L225 Difference]: With dead ends: 2604 [2021-01-06 11:32:51,030 INFO L226 Difference]: Without dead ends: 1641 [2021-01-06 11:32:51,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2021-01-06 11:32:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1641. [2021-01-06 11:32:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2021-01-06 11:32:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2465 transitions. [2021-01-06 11:32:51,091 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2465 transitions. Word has length 138 [2021-01-06 11:32:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:51,092 INFO L481 AbstractCegarLoop]: Abstraction has 1641 states and 2465 transitions. [2021-01-06 11:32:51,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2465 transitions. [2021-01-06 11:32:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 11:32:51,097 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:51,097 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:51,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 11:32:51,311 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:51,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:51,312 INFO L82 PathProgramCache]: Analyzing trace with hash 230274424, now seen corresponding path program 1 times [2021-01-06 11:32:51,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:51,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527847572] [2021-01-06 11:32:51,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:51,328 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 11:32:51,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482635264] [2021-01-06 11:32:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:51,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:32:51,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-01-06 11:32:51,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527847572] [2021-01-06 11:32:51,610 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 11:32:51,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482635264] [2021-01-06 11:32:51,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:51,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:51,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739353427] [2021-01-06 11:32:51,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:51,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:51,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:51,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:51,612 INFO L87 Difference]: Start difference. First operand 1641 states and 2465 transitions. Second operand 3 states. [2021-01-06 11:32:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:51,800 INFO L93 Difference]: Finished difference Result 3274 states and 4918 transitions. [2021-01-06 11:32:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:51,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2021-01-06 11:32:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:51,809 INFO L225 Difference]: With dead ends: 3274 [2021-01-06 11:32:51,809 INFO L226 Difference]: Without dead ends: 1641 [2021-01-06 11:32:51,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2021-01-06 11:32:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1641. [2021-01-06 11:32:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2021-01-06 11:32:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2401 transitions. [2021-01-06 11:32:51,865 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2401 transitions. Word has length 199 [2021-01-06 11:32:51,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:51,866 INFO L481 AbstractCegarLoop]: Abstraction has 1641 states and 2401 transitions. [2021-01-06 11:32:51,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2401 transitions. [2021-01-06 11:32:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-01-06 11:32:51,871 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:51,872 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:52,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 11:32:52,085 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:52,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:52,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1759452965, now seen corresponding path program 1 times [2021-01-06 11:32:52,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:52,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379326287] [2021-01-06 11:32:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:52,101 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 11:32:52,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254928975] [2021-01-06 11:32:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:52,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:32:52,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-01-06 11:32:52,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379326287] [2021-01-06 11:32:52,400 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 11:32:52,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254928975] [2021-01-06 11:32:52,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:52,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:52,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34448815] [2021-01-06 11:32:52,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:52,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:52,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:52,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:52,402 INFO L87 Difference]: Start difference. First operand 1641 states and 2401 transitions. Second operand 3 states. [2021-01-06 11:32:52,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:52,572 INFO L93 Difference]: Finished difference Result 3469 states and 5085 transitions. [2021-01-06 11:32:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:52,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2021-01-06 11:32:52,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:52,581 INFO L225 Difference]: With dead ends: 3469 [2021-01-06 11:32:52,581 INFO L226 Difference]: Without dead ends: 1631 [2021-01-06 11:32:52,584 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-01-06 11:32:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2021-01-06 11:32:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2021-01-06 11:32:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2311 transitions. [2021-01-06 11:32:52,641 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2311 transitions. Word has length 241 [2021-01-06 11:32:52,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:52,641 INFO L481 AbstractCegarLoop]: Abstraction has 1631 states and 2311 transitions. [2021-01-06 11:32:52,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2311 transitions. [2021-01-06 11:32:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-01-06 11:32:52,648 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:52,649 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:52,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:52,863 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:52,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:52,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1622703552, now seen corresponding path program 1 times [2021-01-06 11:32:52,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:52,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630021261] [2021-01-06 11:32:52,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:52,881 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-06 11:32:52,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1286885628] [2021-01-06 11:32:52,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:52,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:32:52,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2021-01-06 11:32:53,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630021261] [2021-01-06 11:32:53,254 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-06 11:32:53,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286885628] [2021-01-06 11:32:53,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:53,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:53,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243696324] [2021-01-06 11:32:53,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:53,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:53,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:53,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:53,256 INFO L87 Difference]: Start difference. First operand 1631 states and 2311 transitions. Second operand 3 states. [2021-01-06 11:32:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:53,346 INFO L93 Difference]: Finished difference Result 4862 states and 6894 transitions. [2021-01-06 11:32:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:53,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2021-01-06 11:32:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:53,356 INFO L225 Difference]: With dead ends: 4862 [2021-01-06 11:32:53,356 INFO L226 Difference]: Without dead ends: 1953 [2021-01-06 11:32:53,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2021-01-06 11:32:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1951. [2021-01-06 11:32:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1951 states. [2021-01-06 11:32:53,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2750 transitions. [2021-01-06 11:32:53,446 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2750 transitions. Word has length 269 [2021-01-06 11:32:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:53,447 INFO L481 AbstractCegarLoop]: Abstraction has 1951 states and 2750 transitions. [2021-01-06 11:32:53,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2750 transitions. [2021-01-06 11:32:53,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2021-01-06 11:32:53,454 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:53,454 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:53,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:53,669 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:53,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1812515673, now seen corresponding path program 1 times [2021-01-06 11:32:53,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:53,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192794803] [2021-01-06 11:32:53,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2021-01-06 11:32:53,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192794803] [2021-01-06 11:32:53,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:53,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:53,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183430587] [2021-01-06 11:32:53,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:53,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:53,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:53,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:53,790 INFO L87 Difference]: Start difference. First operand 1951 states and 2750 transitions. Second operand 3 states. [2021-01-06 11:32:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:53,975 INFO L93 Difference]: Finished difference Result 4027 states and 5672 transitions. [2021-01-06 11:32:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:53,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2021-01-06 11:32:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:53,986 INFO L225 Difference]: With dead ends: 4027 [2021-01-06 11:32:53,986 INFO L226 Difference]: Without dead ends: 2084 [2021-01-06 11:32:53,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2021-01-06 11:32:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2066. [2021-01-06 11:32:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2066 states. [2021-01-06 11:32:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 2890 transitions. [2021-01-06 11:32:54,081 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 2890 transitions. Word has length 307 [2021-01-06 11:32:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:54,082 INFO L481 AbstractCegarLoop]: Abstraction has 2066 states and 2890 transitions. [2021-01-06 11:32:54,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2890 transitions. [2021-01-06 11:32:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2021-01-06 11:32:54,091 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:54,091 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:54,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:32:54,091 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:54,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:54,092 INFO L82 PathProgramCache]: Analyzing trace with hash 493001237, now seen corresponding path program 1 times [2021-01-06 11:32:54,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:54,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075713373] [2021-01-06 11:32:54,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2021-01-06 11:32:54,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075713373] [2021-01-06 11:32:54,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:54,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:54,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314976419] [2021-01-06 11:32:54,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:54,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:54,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:54,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:54,256 INFO L87 Difference]: Start difference. First operand 2066 states and 2890 transitions. Second operand 3 states. [2021-01-06 11:32:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:54,432 INFO L93 Difference]: Finished difference Result 4346 states and 6104 transitions. [2021-01-06 11:32:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:54,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2021-01-06 11:32:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:54,443 INFO L225 Difference]: With dead ends: 4346 [2021-01-06 11:32:54,443 INFO L226 Difference]: Without dead ends: 2288 [2021-01-06 11:32:54,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2021-01-06 11:32:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2216. [2021-01-06 11:32:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2021-01-06 11:32:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3070 transitions. [2021-01-06 11:32:54,532 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3070 transitions. Word has length 327 [2021-01-06 11:32:54,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:54,532 INFO L481 AbstractCegarLoop]: Abstraction has 2216 states and 3070 transitions. [2021-01-06 11:32:54,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3070 transitions. [2021-01-06 11:32:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2021-01-06 11:32:54,541 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:54,541 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:54,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:32:54,541 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:54,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:54,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1757399063, now seen corresponding path program 1 times [2021-01-06 11:32:54,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:54,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549484222] [2021-01-06 11:32:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2021-01-06 11:32:54,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549484222] [2021-01-06 11:32:54,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:54,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:54,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124632185] [2021-01-06 11:32:54,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:54,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:54,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:54,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:54,730 INFO L87 Difference]: Start difference. First operand 2216 states and 3070 transitions. Second operand 3 states. [2021-01-06 11:32:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:54,878 INFO L93 Difference]: Finished difference Result 4466 states and 6200 transitions. [2021-01-06 11:32:54,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:54,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2021-01-06 11:32:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:54,888 INFO L225 Difference]: With dead ends: 4466 [2021-01-06 11:32:54,889 INFO L226 Difference]: Without dead ends: 2258 [2021-01-06 11:32:54,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2021-01-06 11:32:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2216. [2021-01-06 11:32:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2021-01-06 11:32:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3022 transitions. [2021-01-06 11:32:54,966 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3022 transitions. Word has length 353 [2021-01-06 11:32:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:54,966 INFO L481 AbstractCegarLoop]: Abstraction has 2216 states and 3022 transitions. [2021-01-06 11:32:54,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3022 transitions. [2021-01-06 11:32:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2021-01-06 11:32:54,976 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:54,976 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:54,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:32:54,976 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:54,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:54,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1876884711, now seen corresponding path program 1 times [2021-01-06 11:32:54,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:54,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259540844] [2021-01-06 11:32:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-01-06 11:32:55,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259540844] [2021-01-06 11:32:55,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533146838] [2021-01-06 11:32:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:55,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:32:55,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-01-06 11:32:55,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:32:55,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:32:55,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545804335] [2021-01-06 11:32:55,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:32:55,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:55,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:32:55,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:32:55,622 INFO L87 Difference]: Start difference. First operand 2216 states and 3022 transitions. Second operand 4 states. [2021-01-06 11:32:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:56,009 INFO L93 Difference]: Finished difference Result 6734 states and 9190 transitions. [2021-01-06 11:32:56,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:32:56,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2021-01-06 11:32:56,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:56,029 INFO L225 Difference]: With dead ends: 6734 [2021-01-06 11:32:56,029 INFO L226 Difference]: Without dead ends: 4380 [2021-01-06 11:32:56,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:32:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4380 states. [2021-01-06 11:32:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4380 to 2408. [2021-01-06 11:32:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2408 states. [2021-01-06 11:32:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3258 transitions. [2021-01-06 11:32:56,139 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3258 transitions. Word has length 370 [2021-01-06 11:32:56,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:56,139 INFO L481 AbstractCegarLoop]: Abstraction has 2408 states and 3258 transitions. [2021-01-06 11:32:56,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:32:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3258 transitions. [2021-01-06 11:32:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2021-01-06 11:32:56,151 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:56,151 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:56,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:56,365 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:56,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:56,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1628763683, now seen corresponding path program 1 times [2021-01-06 11:32:56,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:56,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25439498] [2021-01-06 11:32:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2021-01-06 11:32:56,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25439498] [2021-01-06 11:32:56,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:56,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:56,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791834657] [2021-01-06 11:32:56,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:56,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:56,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:56,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:56,577 INFO L87 Difference]: Start difference. First operand 2408 states and 3258 transitions. Second operand 3 states. [2021-01-06 11:32:56,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:56,728 INFO L93 Difference]: Finished difference Result 4820 states and 6516 transitions. [2021-01-06 11:32:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:56,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2021-01-06 11:32:56,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:56,740 INFO L225 Difference]: With dead ends: 4820 [2021-01-06 11:32:56,740 INFO L226 Difference]: Without dead ends: 2420 [2021-01-06 11:32:56,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2021-01-06 11:32:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2408. [2021-01-06 11:32:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2408 states. [2021-01-06 11:32:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3210 transitions. [2021-01-06 11:32:56,846 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3210 transitions. Word has length 438 [2021-01-06 11:32:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:56,846 INFO L481 AbstractCegarLoop]: Abstraction has 2408 states and 3210 transitions. [2021-01-06 11:32:56,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3210 transitions. [2021-01-06 11:32:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2021-01-06 11:32:56,851 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:56,852 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:56,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:32:56,852 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1752367566, now seen corresponding path program 1 times [2021-01-06 11:32:56,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:56,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491710552] [2021-01-06 11:32:56,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2021-01-06 11:32:57,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491710552] [2021-01-06 11:32:57,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:57,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:57,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515758632] [2021-01-06 11:32:57,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:57,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:57,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:57,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:57,096 INFO L87 Difference]: Start difference. First operand 2408 states and 3210 transitions. Second operand 3 states. [2021-01-06 11:32:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:57,253 INFO L93 Difference]: Finished difference Result 5024 states and 6714 transitions. [2021-01-06 11:32:57,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:57,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2021-01-06 11:32:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:57,262 INFO L225 Difference]: With dead ends: 5024 [2021-01-06 11:32:57,263 INFO L226 Difference]: Without dead ends: 2624 [2021-01-06 11:32:57,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2021-01-06 11:32:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2612. [2021-01-06 11:32:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2612 states. [2021-01-06 11:32:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 3444 transitions. [2021-01-06 11:32:57,347 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 3444 transitions. Word has length 470 [2021-01-06 11:32:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:57,347 INFO L481 AbstractCegarLoop]: Abstraction has 2612 states and 3444 transitions. [2021-01-06 11:32:57,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3444 transitions. [2021-01-06 11:32:57,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2021-01-06 11:32:57,354 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:57,355 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:57,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:32:57,355 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:57,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:57,356 INFO L82 PathProgramCache]: Analyzing trace with hash -742298620, now seen corresponding path program 1 times [2021-01-06 11:32:57,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:57,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584336158] [2021-01-06 11:32:57,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2021-01-06 11:32:57,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584336158] [2021-01-06 11:32:57,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:57,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:57,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509038896] [2021-01-06 11:32:57,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:57,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:57,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:57,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:57,669 INFO L87 Difference]: Start difference. First operand 2612 states and 3444 transitions. Second operand 3 states. [2021-01-06 11:32:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:57,845 INFO L93 Difference]: Finished difference Result 5444 states and 7206 transitions. [2021-01-06 11:32:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:57,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 532 [2021-01-06 11:32:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:57,852 INFO L225 Difference]: With dead ends: 5444 [2021-01-06 11:32:57,852 INFO L226 Difference]: Without dead ends: 2840 [2021-01-06 11:32:57,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2021-01-06 11:32:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2828. [2021-01-06 11:32:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2021-01-06 11:32:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3690 transitions. [2021-01-06 11:32:57,940 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3690 transitions. Word has length 532 [2021-01-06 11:32:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:57,941 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 3690 transitions. [2021-01-06 11:32:57,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3690 transitions. [2021-01-06 11:32:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2021-01-06 11:32:57,949 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:57,949 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:57,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:32:57,950 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:57,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1835374162, now seen corresponding path program 1 times [2021-01-06 11:32:57,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:57,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393846777] [2021-01-06 11:32:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-01-06 11:32:58,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393846777] [2021-01-06 11:32:58,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390218533] [2021-01-06 11:32:58,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:58,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:32:58,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-01-06 11:32:58,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:32:58,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-06 11:32:58,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480049526] [2021-01-06 11:32:58,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 11:32:58,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:58,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 11:32:58,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:32:58,917 INFO L87 Difference]: Start difference. First operand 2828 states and 3690 transitions. Second operand 6 states. [2021-01-06 11:32:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:59,089 INFO L93 Difference]: Finished difference Result 4436 states and 5793 transitions. [2021-01-06 11:32:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:32:59,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 598 [2021-01-06 11:32:59,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:59,090 INFO L225 Difference]: With dead ends: 4436 [2021-01-06 11:32:59,090 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 11:32:59,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:32:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 11:32:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 11:32:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 11:32:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 11:32:59,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2021-01-06 11:32:59,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:59,095 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 11:32:59,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 11:32:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 11:32:59,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 11:32:59,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-06 11:32:59,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 11:32:59,734 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 87 [2021-01-06 11:33:00,337 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 87 [2021-01-06 11:33:00,598 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2021-01-06 11:33:00,804 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-01-06 11:33:01,243 WARN L197 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2021-01-06 11:33:01,447 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2021-01-06 11:33:01,641 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-01-06 11:33:01,786 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 23 [2021-01-06 11:33:02,031 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2021-01-06 11:33:02,282 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2021-01-06 11:33:02,450 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-01-06 11:33:02,629 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2021-01-06 11:33:02,827 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2021-01-06 11:33:03,048 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-01-06 11:33:03,226 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2021-01-06 11:33:03,437 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2021-01-06 11:33:03,623 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2021-01-06 11:33:04,072 WARN L197 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2021-01-06 11:33:04,283 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-01-06 11:33:04,479 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2021-01-06 11:33:04,483 INFO L189 CegarLoopUtils]: For program point L663(lines 663 667) no Hoare annotation was computed. [2021-01-06 11:33:04,483 INFO L189 CegarLoopUtils]: For program point L630(lines 630 639) no Hoare annotation was computed. [2021-01-06 11:33:04,483 INFO L189 CegarLoopUtils]: For program point L663-2(lines 663 667) no Hoare annotation was computed. [2021-01-06 11:33:04,484 INFO L189 CegarLoopUtils]: For program point L630-2(lines 629 651) no Hoare annotation was computed. [2021-01-06 11:33:04,487 INFO L185 CegarLoopUtils]: At program point L399(lines 390 421) the Hoare annotation is: (let ((.cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse7) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse1 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-01-06 11:33:04,488 INFO L185 CegarLoopUtils]: At program point L168(lines 167 606) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse1) (and .cse2 .cse1 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)))) [2021-01-06 11:33:04,488 INFO L185 CegarLoopUtils]: At program point L135(lines 128 619) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse5 .cse1 .cse6 .cse7 .cse2 .cse3 .cse4 .cse9 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse5 .cse1 .cse6 .cse7 .cse2 .cse3 .cse4 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse8))) [2021-01-06 11:33:04,489 INFO L189 CegarLoopUtils]: For program point L102(line 102) no Hoare annotation was computed. [2021-01-06 11:33:04,489 INFO L189 CegarLoopUtils]: For program point L367(lines 367 371) no Hoare annotation was computed. [2021-01-06 11:33:04,489 INFO L189 CegarLoopUtils]: For program point L632(lines 632 636) no Hoare annotation was computed. [2021-01-06 11:33:04,490 INFO L189 CegarLoopUtils]: For program point L401(lines 401 407) no Hoare annotation was computed. [2021-01-06 11:33:04,490 INFO L189 CegarLoopUtils]: For program point L203(lines 203 594) no Hoare annotation was computed. [2021-01-06 11:33:04,490 INFO L189 CegarLoopUtils]: For program point L170(lines 170 605) no Hoare annotation was computed. [2021-01-06 11:33:04,490 INFO L189 CegarLoopUtils]: For program point L137(lines 137 616) no Hoare annotation was computed. [2021-01-06 11:33:04,490 INFO L189 CegarLoopUtils]: For program point L104(lines 104 627) no Hoare annotation was computed. [2021-01-06 11:33:04,490 INFO L189 CegarLoopUtils]: For program point L468(lines 468 472) no Hoare annotation was computed. [2021-01-06 11:33:04,490 INFO L185 CegarLoopUtils]: At program point L204(lines 200 595) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2021-01-06 11:33:04,490 INFO L185 CegarLoopUtils]: At program point L105(lines 104 627) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-01-06 11:33:04,490 INFO L189 CegarLoopUtils]: For program point L503(lines 503 507) no Hoare annotation was computed. [2021-01-06 11:33:04,491 INFO L189 CegarLoopUtils]: For program point L503-2(lines 211 589) no Hoare annotation was computed. [2021-01-06 11:33:04,491 INFO L189 CegarLoopUtils]: For program point L239(lines 239 244) no Hoare annotation was computed. [2021-01-06 11:33:04,491 INFO L189 CegarLoopUtils]: For program point L206(lines 206 593) no Hoare annotation was computed. [2021-01-06 11:33:04,491 INFO L189 CegarLoopUtils]: For program point L173(lines 173 604) no Hoare annotation was computed. [2021-01-06 11:33:04,491 INFO L189 CegarLoopUtils]: For program point L140(lines 140 615) no Hoare annotation was computed. [2021-01-06 11:33:04,491 INFO L189 CegarLoopUtils]: For program point L107(lines 107 626) no Hoare annotation was computed. [2021-01-06 11:33:04,491 INFO L185 CegarLoopUtils]: At program point L207(lines 206 593) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-01-06 11:33:04,492 INFO L185 CegarLoopUtils]: At program point L174(lines 170 605) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse8 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-01-06 11:33:04,492 INFO L185 CegarLoopUtils]: At program point L141(lines 137 616) the Hoare annotation is: (let ((.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse1 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-01-06 11:33:04,492 INFO L189 CegarLoopUtils]: For program point L75(lines 75 83) no Hoare annotation was computed. [2021-01-06 11:33:04,492 INFO L189 CegarLoopUtils]: For program point L274(lines 274 278) no Hoare annotation was computed. [2021-01-06 11:33:04,492 INFO L189 CegarLoopUtils]: For program point L308(lines 308 312) no Hoare annotation was computed. [2021-01-06 11:33:04,492 INFO L189 CegarLoopUtils]: For program point L308-2(lines 211 589) no Hoare annotation was computed. [2021-01-06 11:33:04,493 INFO L189 CegarLoopUtils]: For program point L176(lines 176 603) no Hoare annotation was computed. [2021-01-06 11:33:04,493 INFO L189 CegarLoopUtils]: For program point L143(lines 143 614) no Hoare annotation was computed. [2021-01-06 11:33:04,493 INFO L189 CegarLoopUtils]: For program point L110(lines 110 625) no Hoare annotation was computed. [2021-01-06 11:33:04,493 INFO L189 CegarLoopUtils]: For program point L573(lines 573 583) no Hoare annotation was computed. [2021-01-06 11:33:04,493 INFO L189 CegarLoopUtils]: For program point L573-1(lines 573 583) no Hoare annotation was computed. [2021-01-06 11:33:04,493 INFO L189 CegarLoopUtils]: For program point L441-1(lines 441 453) no Hoare annotation was computed. [2021-01-06 11:33:04,493 INFO L185 CegarLoopUtils]: At program point L210(lines 209 592) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-01-06 11:33:04,493 INFO L189 CegarLoopUtils]: For program point L78(lines 78 82) no Hoare annotation was computed. [2021-01-06 11:33:04,493 INFO L189 CegarLoopUtils]: For program point L78-2(lines 75 83) no Hoare annotation was computed. [2021-01-06 11:33:04,494 INFO L185 CegarLoopUtils]: At program point L409(lines 400 420) the Hoare annotation is: (let ((.cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse7) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse1 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-01-06 11:33:04,494 INFO L189 CegarLoopUtils]: For program point L343(lines 343 347) no Hoare annotation was computed. [2021-01-06 11:33:04,494 INFO L189 CegarLoopUtils]: For program point L343-2(lines 211 589) no Hoare annotation was computed. [2021-01-06 11:33:04,494 INFO L192 CegarLoopUtils]: At program point L674(lines 66 676) the Hoare annotation is: true [2021-01-06 11:33:04,494 INFO L189 CegarLoopUtils]: For program point L641(lines 641 647) no Hoare annotation was computed. [2021-01-06 11:33:04,494 INFO L189 CegarLoopUtils]: For program point L542(lines 542 547) no Hoare annotation was computed. [2021-01-06 11:33:04,494 INFO L189 CegarLoopUtils]: For program point L179(lines 179 602) no Hoare annotation was computed. [2021-01-06 11:33:04,494 INFO L189 CegarLoopUtils]: For program point L146(lines 146 613) no Hoare annotation was computed. [2021-01-06 11:33:04,494 INFO L189 CegarLoopUtils]: For program point L113(lines 113 624) no Hoare annotation was computed. [2021-01-06 11:33:04,494 INFO L192 CegarLoopUtils]: At program point L675(lines 11 677) the Hoare annotation is: true [2021-01-06 11:33:04,494 INFO L189 CegarLoopUtils]: For program point L576(lines 576 580) no Hoare annotation was computed. [2021-01-06 11:33:04,494 INFO L189 CegarLoopUtils]: For program point L444(lines 444 449) no Hoare annotation was computed. [2021-01-06 11:33:04,495 INFO L185 CegarLoopUtils]: At program point L180(lines 176 603) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse8 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-01-06 11:33:04,495 INFO L185 CegarLoopUtils]: At program point L147(lines 143 614) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse5 .cse1 .cse6 .cse7 .cse2 .cse3 .cse4 .cse9 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse5 .cse1 .cse6 .cse7 .cse2 .cse3 .cse4 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse8))) [2021-01-06 11:33:04,495 INFO L189 CegarLoopUtils]: For program point L412(lines 412 416) no Hoare annotation was computed. [2021-01-06 11:33:04,495 INFO L185 CegarLoopUtils]: At program point L214(lines 107 626) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-01-06 11:33:04,495 INFO L189 CegarLoopUtils]: For program point L182(lines 182 601) no Hoare annotation was computed. [2021-01-06 11:33:04,495 INFO L189 CegarLoopUtils]: For program point L149(lines 149 612) no Hoare annotation was computed. [2021-01-06 11:33:04,495 INFO L189 CegarLoopUtils]: For program point L116(lines 116 623) no Hoare annotation was computed. [2021-01-06 11:33:04,495 INFO L189 CegarLoopUtils]: For program point L513(lines 513 517) no Hoare annotation was computed. [2021-01-06 11:33:04,495 INFO L189 CegarLoopUtils]: For program point L480(lines 480 484) no Hoare annotation was computed. [2021-01-06 11:33:04,495 INFO L189 CegarLoopUtils]: For program point L513-2(lines 513 517) no Hoare annotation was computed. [2021-01-06 11:33:04,495 INFO L189 CegarLoopUtils]: For program point L85(lines 85 93) no Hoare annotation was computed. [2021-01-06 11:33:04,495 INFO L189 CegarLoopUtils]: For program point L85-1(lines 66 676) no Hoare annotation was computed. [2021-01-06 11:33:04,496 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 11:33:04,496 INFO L189 CegarLoopUtils]: For program point L185(lines 185 600) no Hoare annotation was computed. [2021-01-06 11:33:04,496 INFO L189 CegarLoopUtils]: For program point L152(lines 152 611) no Hoare annotation was computed. [2021-01-06 11:33:04,498 INFO L189 CegarLoopUtils]: For program point L119(lines 119 622) no Hoare annotation was computed. [2021-01-06 11:33:04,498 INFO L189 CegarLoopUtils]: For program point L86(lines 86 90) no Hoare annotation was computed. [2021-01-06 11:33:04,498 INFO L189 CegarLoopUtils]: For program point L351(lines 351 382) no Hoare annotation was computed. [2021-01-06 11:33:04,498 INFO L189 CegarLoopUtils]: For program point L318(lines 318 322) no Hoare annotation was computed. [2021-01-06 11:33:04,498 INFO L189 CegarLoopUtils]: For program point L318-2(lines 318 322) no Hoare annotation was computed. [2021-01-06 11:33:04,498 INFO L189 CegarLoopUtils]: For program point L219(lines 219 223) no Hoare annotation was computed. [2021-01-06 11:33:04,498 INFO L185 CegarLoopUtils]: At program point L186(lines 182 601) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse8 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-01-06 11:33:04,499 INFO L185 CegarLoopUtils]: At program point L153(lines 149 612) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse5 .cse1 .cse6 .cse7 .cse2 .cse3 .cse4 .cse9 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse5 .cse1 .cse6 .cse7 .cse2 .cse3 .cse4 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse8))) [2021-01-06 11:33:04,499 INFO L189 CegarLoopUtils]: For program point L219-2(lines 211 589) no Hoare annotation was computed. [2021-01-06 11:33:04,499 INFO L189 CegarLoopUtils]: For program point L188(lines 188 599) no Hoare annotation was computed. [2021-01-06 11:33:04,499 INFO L189 CegarLoopUtils]: For program point L155(lines 155 610) no Hoare annotation was computed. [2021-01-06 11:33:04,499 INFO L189 CegarLoopUtils]: For program point L122(lines 122 621) no Hoare annotation was computed. [2021-01-06 11:33:04,499 INFO L189 CegarLoopUtils]: For program point L552(lines 552 556) no Hoare annotation was computed. [2021-01-06 11:33:04,499 INFO L189 CegarLoopUtils]: For program point L354(lines 354 381) no Hoare annotation was computed. [2021-01-06 11:33:04,500 INFO L189 CegarLoopUtils]: For program point L354-1(lines 354 381) no Hoare annotation was computed. [2021-01-06 11:33:04,500 INFO L185 CegarLoopUtils]: At program point L123(lines 119 622) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-01-06 11:33:04,500 INFO L185 CegarLoopUtils]: At program point L553(lines 66 676) the Hoare annotation is: false [2021-01-06 11:33:04,500 INFO L189 CegarLoopUtils]: For program point L355(lines 355 378) no Hoare annotation was computed. [2021-01-06 11:33:04,500 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 11:33:04,500 INFO L189 CegarLoopUtils]: For program point L256(lines 256 268) no Hoare annotation was computed. [2021-01-06 11:33:04,500 INFO L189 CegarLoopUtils]: For program point L257(lines 257 262) no Hoare annotation was computed. [2021-01-06 11:33:04,500 INFO L189 CegarLoopUtils]: For program point L191(lines 191 598) no Hoare annotation was computed. [2021-01-06 11:33:04,500 INFO L189 CegarLoopUtils]: For program point L158(lines 158 609) no Hoare annotation was computed. [2021-01-06 11:33:04,501 INFO L189 CegarLoopUtils]: For program point L125(lines 125 620) no Hoare annotation was computed. [2021-01-06 11:33:04,501 INFO L192 CegarLoopUtils]: At program point L687(lines 678 689) the Hoare annotation is: true [2021-01-06 11:33:04,501 INFO L189 CegarLoopUtils]: For program point L390(lines 390 421) no Hoare annotation was computed. [2021-01-06 11:33:04,501 INFO L189 CegarLoopUtils]: For program point L291(lines 291 295) no Hoare annotation was computed. [2021-01-06 11:33:04,501 INFO L189 CegarLoopUtils]: For program point L291-2(lines 211 589) no Hoare annotation was computed. [2021-01-06 11:33:04,501 INFO L185 CegarLoopUtils]: At program point L192(lines 188 599) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse8 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-01-06 11:33:04,501 INFO L185 CegarLoopUtils]: At program point L159(lines 155 610) the Hoare annotation is: (let ((.cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse7) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse1 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)))) [2021-01-06 11:33:04,502 INFO L185 CegarLoopUtils]: At program point L126(lines 125 620) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) [2021-01-06 11:33:04,502 INFO L189 CegarLoopUtils]: For program point L523(lines 523 528) no Hoare annotation was computed. [2021-01-06 11:33:04,502 INFO L189 CegarLoopUtils]: For program point L391(lines 391 397) no Hoare annotation was computed. [2021-01-06 11:33:04,502 INFO L189 CegarLoopUtils]: For program point L358(lines 358 377) no Hoare annotation was computed. [2021-01-06 11:33:04,502 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 11:33:04,502 INFO L185 CegarLoopUtils]: At program point L590(lines 101 658) the Hoare annotation is: (let ((.cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse7 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2) (and .cse4 .cse11 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse11 .cse12) (and .cse0 .cse1 .cse13) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse12 .cse6))) [2021-01-06 11:33:04,502 INFO L189 CegarLoopUtils]: For program point L557(lines 557 561) no Hoare annotation was computed. [2021-01-06 11:33:04,503 INFO L189 CegarLoopUtils]: For program point L491(lines 491 495) no Hoare annotation was computed. [2021-01-06 11:33:04,503 INFO L189 CegarLoopUtils]: For program point L359(lines 359 363) no Hoare annotation was computed. [2021-01-06 11:33:04,503 INFO L189 CegarLoopUtils]: For program point L359-2(lines 358 375) no Hoare annotation was computed. [2021-01-06 11:33:04,503 INFO L189 CegarLoopUtils]: For program point L194(lines 194 597) no Hoare annotation was computed. [2021-01-06 11:33:04,503 INFO L189 CegarLoopUtils]: For program point L161(lines 161 608) no Hoare annotation was computed. [2021-01-06 11:33:04,503 INFO L189 CegarLoopUtils]: For program point L128(lines 128 619) no Hoare annotation was computed. [2021-01-06 11:33:04,503 INFO L189 CegarLoopUtils]: For program point L459(lines 459 463) no Hoare annotation was computed. [2021-01-06 11:33:04,503 INFO L189 CegarLoopUtils]: For program point L327-1(lines 327 336) no Hoare annotation was computed. [2021-01-06 11:33:04,503 INFO L192 CegarLoopUtils]: At program point L659(lines 100 660) the Hoare annotation is: true [2021-01-06 11:33:04,503 INFO L189 CegarLoopUtils]: For program point L197(lines 197 596) no Hoare annotation was computed. [2021-01-06 11:33:04,503 INFO L189 CegarLoopUtils]: For program point L164(lines 164 607) no Hoare annotation was computed. [2021-01-06 11:33:04,504 INFO L189 CegarLoopUtils]: For program point L131(lines 131 618) no Hoare annotation was computed. [2021-01-06 11:33:04,504 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 11:33:04,504 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 670) no Hoare annotation was computed. [2021-01-06 11:33:04,504 INFO L189 CegarLoopUtils]: For program point L231(lines 231 248) no Hoare annotation was computed. [2021-01-06 11:33:04,504 INFO L185 CegarLoopUtils]: At program point L198(lines 194 597) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse6 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse3 .cse5 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-01-06 11:33:04,504 INFO L185 CegarLoopUtils]: At program point L165(lines 161 608) the Hoare annotation is: (let ((.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse7 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-01-06 11:33:04,505 INFO L189 CegarLoopUtils]: For program point L231-2(lines 211 589) no Hoare annotation was computed. [2021-01-06 11:33:04,505 INFO L189 CegarLoopUtils]: For program point L628(lines 628 656) no Hoare annotation was computed. [2021-01-06 11:33:04,505 INFO L189 CegarLoopUtils]: For program point L331(lines 331 335) no Hoare annotation was computed. [2021-01-06 11:33:04,505 INFO L189 CegarLoopUtils]: For program point L629(lines 629 653) no Hoare annotation was computed. [2021-01-06 11:33:04,505 INFO L189 CegarLoopUtils]: For program point L563(lines 563 567) no Hoare annotation was computed. [2021-01-06 11:33:04,505 INFO L189 CegarLoopUtils]: For program point L530(lines 530 534) no Hoare annotation was computed. [2021-01-06 11:33:04,505 INFO L189 CegarLoopUtils]: For program point L563-2(lines 563 567) no Hoare annotation was computed. [2021-01-06 11:33:04,505 INFO L189 CegarLoopUtils]: For program point L464(lines 464 475) no Hoare annotation was computed. [2021-01-06 11:33:04,505 INFO L189 CegarLoopUtils]: For program point L530-2(lines 211 589) no Hoare annotation was computed. [2021-01-06 11:33:04,505 INFO L189 CegarLoopUtils]: For program point L431(lines 431 435) no Hoare annotation was computed. [2021-01-06 11:33:04,506 INFO L185 CegarLoopUtils]: At program point L365(lines 348 383) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse5 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse6 .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse0 .cse5 .cse1 .cse6 .cse7 .cse2 .cse3 .cse4 .cse9 .cse8 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (and .cse0 .cse5 .cse1 .cse6 .cse7 .cse2 .cse3 .cse4 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1) .cse8))) [2021-01-06 11:33:04,506 INFO L189 CegarLoopUtils]: For program point L233(lines 233 238) no Hoare annotation was computed. [2021-01-06 11:33:04,506 INFO L189 CegarLoopUtils]: For program point L200(lines 200 595) no Hoare annotation was computed. [2021-01-06 11:33:04,506 INFO L189 CegarLoopUtils]: For program point L167(lines 167 606) no Hoare annotation was computed. [2021-01-06 11:33:04,506 INFO L189 CegarLoopUtils]: For program point L134(lines 134 617) no Hoare annotation was computed. [2021-01-06 11:33:04,506 INFO L185 CegarLoopUtils]: At program point L101-2(lines 101 658) the Hoare annotation is: (let ((.cse2 (= 2 ULTIMATE.start_ssl3_accept_~blastFlag~0)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse7 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse13 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 1)) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2) (and .cse4 .cse11 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse11 .cse12) (and .cse0 .cse1 .cse13) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and .cse12 .cse6))) [2021-01-06 11:33:04,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:33:04 BoogieIcfgContainer [2021-01-06 11:33:04,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:33:04,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:33:04,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:33:04,572 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:33:04,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:32:45" (3/4) ... [2021-01-06 11:33:04,576 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 11:33:04,592 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-01-06 11:33:04,593 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 11:33:04,594 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:33:04,595 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:33:04,696 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c-witness.graphml [2021-01-06 11:33:04,696 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:33:04,697 INFO L168 Benchmark]: Toolchain (without parser) took 20539.13 ms. Allocated memory was 151.0 MB in the beginning and 806.4 MB in the end (delta: 655.4 MB). Free memory was 125.5 MB in the beginning and 325.3 MB in the end (delta: -199.8 MB). Peak memory consumption was 456.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,697 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 123.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:33:04,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.98 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 109.5 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,698 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.47 ms. Allocated memory is still 151.0 MB. Free memory was 109.4 MB in the beginning and 106.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,698 INFO L168 Benchmark]: Boogie Preprocessor took 81.02 ms. Allocated memory is still 151.0 MB. Free memory was 106.4 MB in the beginning and 104.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,699 INFO L168 Benchmark]: RCFGBuilder took 1002.06 ms. Allocated memory is still 151.0 MB. Free memory was 104.2 MB in the beginning and 86.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 19.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,699 INFO L168 Benchmark]: TraceAbstraction took 18821.27 ms. Allocated memory was 151.0 MB in the beginning and 806.4 MB in the end (delta: 655.4 MB). Free memory was 85.8 MB in the beginning and 337.4 MB in the end (delta: -251.6 MB). Peak memory consumption was 443.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,700 INFO L168 Benchmark]: Witness Printer took 124.42 ms. Allocated memory is still 806.4 MB. Free memory was 337.4 MB in the beginning and 325.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,702 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 123.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 415.98 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 109.5 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 81.47 ms. Allocated memory is still 151.0 MB. Free memory was 109.4 MB in the beginning and 106.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 81.02 ms. Allocated memory is still 151.0 MB. Free memory was 106.4 MB in the beginning and 104.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1002.06 ms. Allocated memory is still 151.0 MB. Free memory was 104.2 MB in the beginning and 86.3 MB in the end (delta: 17.9 MB). Peak memory consumption was 19.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18821.27 ms. Allocated memory was 151.0 MB in the beginning and 806.4 MB in the end (delta: 655.4 MB). Free memory was 85.8 MB in the beginning and 337.4 MB in the end (delta: -251.6 MB). Peak memory consumption was 443.6 MB. Max. memory is 8.0 GB. * Witness Printer took 124.42 ms. Allocated memory is still 806.4 MB. Free memory was 337.4 MB in the beginning and 325.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 670]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: (((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && blastFlag <= 1) && !(s__state == 8481)) || ((((((((((((!(s__state == 8673) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0))) || ((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) && 2 == blastFlag) - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8656)) || ((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0))) || (((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && 2 == blastFlag) || ((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8481)) && 2 == blastFlag)) || ((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state)) || ((3 == s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag <= 1)) || ((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && blastFlag <= 1) && !(s__state == 8481))) || (blastFlag <= 3 && !(s__hit == 0))) || (s__state <= 8448 && !(8448 == s__state)) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) || ((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) && 2 == blastFlag)) || ((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && blastFlag <= 1) && !(s__state == 8481)) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) || ((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) && 2 == blastFlag)) || ((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && blastFlag <= 1) && !(s__state == 8481)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((blastFlag <= 3 && s__state <= 8448) && !(s__hit == 0)) || ((3 == s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && 2 == blastFlag)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8448) && blastFlag <= 1) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: blastFlag <= 3 && 8672 <= s__state - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) || ((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) && 2 == blastFlag)) || ((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && blastFlag <= 1) && !(s__state == 8481)) - InvariantResult [Line: 678]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(s__state == 8657)) && s__state <= 8576) && !(s__state == 8672)) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) || ((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(s__state == 8657)) && s__state <= 8576) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8656))) || ((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8545) && s__s3__tmp__next_state___0 <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && blastFlag <= 1) || ((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8656)) && !(s__hit == 0))) || (((((((((!(s__state == 8545) && s__s3__tmp__next_state___0 <= 8576) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 2 == blastFlag) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8672)) || (((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8673)) && !(s__state == 8544)) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8672)) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__hit == 0)) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) || ((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) && 2 == blastFlag)) || ((((((((((!(s__state == 8545) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && blastFlag <= 1) && !(s__state == 8481)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8656)) || ((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0))) || (((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && blastFlag <= 1) && !(s__state == 8481)) || ((((((((((((!(s__state == 8673) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0))) || ((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) && 2 == blastFlag) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8656)) || (((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0))) || (((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((!(s__state == 8545) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && blastFlag <= 1) && !(s__state == 8481)) || ((((((((!(s__state == 8545) && !(s__state == 8480)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) && 2 == blastFlag)) || ((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && 2 == blastFlag) || ((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8481)) && 2 == blastFlag)) || ((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state)) || ((3 == s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448)) || ((s__s3__tmp__next_state___0 <= 8576 && s__state <= 8576) && blastFlag <= 1)) || ((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && blastFlag <= 1) && !(s__state == 8481))) || (blastFlag <= 3 && !(s__hit == 0))) || (s__state <= 8448 && !(8448 == s__state)) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && blastFlag <= 1) && !(s__state == 8481)) && !(s__state == 8656)) || ((((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0))) || (((((((((((((!(s__state == 8545) && !(s__state == 8673)) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && 2 == blastFlag) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && blastFlag <= 1) && !(s__state == 8481)) || ((((((((((((!(s__state == 8673) && !(s__state == 8480)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__hit == 0))) || ((((((((!(8496 == s__state) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && !(s__state == 8481)) && 2 == blastFlag) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.4s, OverallIterations: 28, TraceHistogramMax: 19, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4514 SDtfs, 2646 SDslu, 2112 SDs, 0 SdLazy, 2496 SolverSat, 667 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2005 GetRequests, 1971 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2828occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 2190 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 331 NumberOfFragments, 2585 HoareAnnotationTreeSize, 29 FomulaSimplifications, 30086 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 4881 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 6680 NumberOfCodeBlocks, 6680 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 6650 ConstructedInterpolants, 0 QuantifiedInterpolants, 2948300 SizeOfPredicates, 2 NumberOfNonLiveVariables, 3324 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 23777/23881 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...