/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_1a.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:32:32,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:32:32,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:32:33,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:32:33,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:32:33,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:32:33,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:32:33,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:32:33,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:32:33,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:32:33,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:32:33,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:32:33,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:32:33,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:32:33,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:32:33,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:32:33,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:32:33,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:32:33,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:32:33,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:32:33,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:32:33,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:32:33,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:32:33,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:32:33,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:32:33,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:32:33,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:32:33,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:32:33,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:32:33,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:32:33,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:32:33,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:32:33,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:32:33,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:32:33,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:32:33,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:32:33,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:32:33,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:32:33,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:32:33,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:32:33,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:32:33,116 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:33,151 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:32:33,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:32:33,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:32:33,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:32:33,153 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:32:33,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:32:33,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:32:33,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:32:33,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:32:33,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:32:33,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:32:33,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:32:33,155 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:32:33,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:32:33,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:32:33,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:32:33,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:32:33,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:32:33,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:32:33,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:32:33,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:32:33,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:32:33,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:32:33,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:32:33,158 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:32:33,159 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:33,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:32:33,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:32:33,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:32:33,589 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:32:33,590 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:32:33,591 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2021-01-06 11:32:33,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a247c3f29/c6e5597184dd4b6bb62a25389b397027/FLAGba7b63d44 [2021-01-06 11:32:34,309 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:32:34,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2021-01-06 11:32:34,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a247c3f29/c6e5597184dd4b6bb62a25389b397027/FLAGba7b63d44 [2021-01-06 11:32:34,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a247c3f29/c6e5597184dd4b6bb62a25389b397027 [2021-01-06 11:32:34,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:32:34,669 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:32:34,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:32:34,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:32:34,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:32:34,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:32:34" (1/1) ... [2021-01-06 11:32:34,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d7d722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:34, skipping insertion in model container [2021-01-06 11:32:34,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:32:34" (1/1) ... [2021-01-06 11:32:34,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:32:34,757 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[~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[~tmp___3~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[~tmp___4~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[~tmp___5~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___6~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[~num1~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__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[~tmp___9~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[~tmp___10~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:34,981 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_1a.BV.c.cil.c[44644,44657] 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:34,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:32:35,001 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[~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[~tmp___3~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[~tmp___4~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[~tmp___5~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___6~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[~num1~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__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[~tmp___9~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[~tmp___10~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:35,082 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_1a.BV.c.cil.c[44644,44657] 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:35,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:32:35,103 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:32:35,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:35 WrapperNode [2021-01-06 11:32:35,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:32:35,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:32:35,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:32:35,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:32:35,115 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:35" (1/1) ... [2021-01-06 11:32:35,128 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:35" (1/1) ... [2021-01-06 11:32:35,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:32:35,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:32:35,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:32:35,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:32:35,185 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:35" (1/1) ... [2021-01-06 11:32:35,186 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:35" (1/1) ... [2021-01-06 11:32:35,190 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:35" (1/1) ... [2021-01-06 11:32:35,190 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:35" (1/1) ... [2021-01-06 11:32:35,201 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:35" (1/1) ... [2021-01-06 11:32:35,213 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:35" (1/1) ... [2021-01-06 11:32:35,217 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:35" (1/1) ... [2021-01-06 11:32:35,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:32:35,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:32:35,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:32:35,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:32:35,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:35" (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:35,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:32:35,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:32:35,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:32:35,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:32:35,695 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:32:36,363 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-01-06 11:32:36,363 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-01-06 11:32:36,374 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:32:36,374 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:32:36,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:32:36 BoogieIcfgContainer [2021-01-06 11:32:36,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:32:36,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:32:36,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:32:36,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:32:36,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:32:34" (1/3) ... [2021-01-06 11:32:36,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e670a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:32:36, skipping insertion in model container [2021-01-06 11:32:36,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:35" (2/3) ... [2021-01-06 11:32:36,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e670a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:32:36, skipping insertion in model container [2021-01-06 11:32:36,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:32:36" (3/3) ... [2021-01-06 11:32:36,387 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2021-01-06 11:32:36,403 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:32:36,412 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:32:36,437 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:32:36,485 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:32:36,487 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:32:36,487 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:32:36,487 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:32:36,488 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:32:36,488 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:32:36,488 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:32:36,488 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:32:36,509 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2021-01-06 11:32:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:32:36,519 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:36,520 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:36,520 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:36,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:36,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1632000041, now seen corresponding path program 1 times [2021-01-06 11:32:36,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:36,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322266251] [2021-01-06 11:32:36,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:36,816 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:36,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322266251] [2021-01-06 11:32:36,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:36,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:36,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830991830] [2021-01-06 11:32:36,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:36,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:36,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:36,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:36,854 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2021-01-06 11:32:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:37,288 INFO L93 Difference]: Finished difference Result 328 states and 565 transitions. [2021-01-06 11:32:37,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:37,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-06 11:32:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:37,323 INFO L225 Difference]: With dead ends: 328 [2021-01-06 11:32:37,324 INFO L226 Difference]: Without dead ends: 174 [2021-01-06 11:32:37,328 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:37,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-01-06 11:32:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 168. [2021-01-06 11:32:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:32:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 274 transitions. [2021-01-06 11:32:37,385 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 274 transitions. Word has length 44 [2021-01-06 11:32:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:37,386 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 274 transitions. [2021-01-06 11:32:37,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 274 transitions. [2021-01-06 11:32:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:32:37,389 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:37,389 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:37,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:32:37,390 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:37,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:37,391 INFO L82 PathProgramCache]: Analyzing trace with hash -954582389, now seen corresponding path program 1 times [2021-01-06 11:32:37,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:37,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163062470] [2021-01-06 11:32:37,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:37,505 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:37,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163062470] [2021-01-06 11:32:37,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:37,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:37,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918586277] [2021-01-06 11:32:37,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:37,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:37,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:37,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:37,509 INFO L87 Difference]: Start difference. First operand 168 states and 274 transitions. Second operand 3 states. [2021-01-06 11:32:37,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:37,761 INFO L93 Difference]: Finished difference Result 377 states and 624 transitions. [2021-01-06 11:32:37,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:37,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2021-01-06 11:32:37,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:37,765 INFO L225 Difference]: With dead ends: 377 [2021-01-06 11:32:37,765 INFO L226 Difference]: Without dead ends: 215 [2021-01-06 11:32:37,767 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:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-01-06 11:32:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 209. [2021-01-06 11:32:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2021-01-06 11:32:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 351 transitions. [2021-01-06 11:32:37,785 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 351 transitions. Word has length 45 [2021-01-06 11:32:37,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:37,785 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 351 transitions. [2021-01-06 11:32:37,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:37,786 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 351 transitions. [2021-01-06 11:32:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 11:32:37,789 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:37,789 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, 1] [2021-01-06 11:32:37,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:32:37,790 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:37,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1257706733, now seen corresponding path program 1 times [2021-01-06 11:32:37,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:37,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298301704] [2021-01-06 11:32:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:37,863 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:37,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298301704] [2021-01-06 11:32:37,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:37,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:37,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699706472] [2021-01-06 11:32:37,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:37,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:37,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:37,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:37,868 INFO L87 Difference]: Start difference. First operand 209 states and 351 transitions. Second operand 3 states. [2021-01-06 11:32:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:38,034 INFO L93 Difference]: Finished difference Result 441 states and 748 transitions. [2021-01-06 11:32:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:38,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 11:32:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:38,037 INFO L225 Difference]: With dead ends: 441 [2021-01-06 11:32:38,037 INFO L226 Difference]: Without dead ends: 240 [2021-01-06 11:32:38,038 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:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-01-06 11:32:38,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-01-06 11:32:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2021-01-06 11:32:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 407 transitions. [2021-01-06 11:32:38,055 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 407 transitions. Word has length 73 [2021-01-06 11:32:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:38,055 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 407 transitions. [2021-01-06 11:32:38,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 407 transitions. [2021-01-06 11:32:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 11:32:38,059 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:38,060 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:38,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:32:38,060 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:38,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:38,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1858309952, now seen corresponding path program 1 times [2021-01-06 11:32:38,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:38,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513027357] [2021-01-06 11:32:38,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:38,169 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:38,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513027357] [2021-01-06 11:32:38,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:38,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:38,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887604350] [2021-01-06 11:32:38,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:38,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:38,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:38,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:38,174 INFO L87 Difference]: Start difference. First operand 240 states and 407 transitions. Second operand 3 states. [2021-01-06 11:32:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:38,394 INFO L93 Difference]: Finished difference Result 518 states and 884 transitions. [2021-01-06 11:32:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:38,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2021-01-06 11:32:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:38,397 INFO L225 Difference]: With dead ends: 518 [2021-01-06 11:32:38,397 INFO L226 Difference]: Without dead ends: 286 [2021-01-06 11:32:38,398 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:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-01-06 11:32:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2021-01-06 11:32:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2021-01-06 11:32:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 482 transitions. [2021-01-06 11:32:38,414 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 482 transitions. Word has length 84 [2021-01-06 11:32:38,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:38,415 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 482 transitions. [2021-01-06 11:32:38,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 482 transitions. [2021-01-06 11:32:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:32:38,418 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:38,418 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, 1] [2021-01-06 11:32:38,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:32:38,418 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:38,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:38,419 INFO L82 PathProgramCache]: Analyzing trace with hash -793628611, now seen corresponding path program 1 times [2021-01-06 11:32:38,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:38,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370298806] [2021-01-06 11:32:38,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:38,473 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:38,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370298806] [2021-01-06 11:32:38,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:38,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:38,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475744792] [2021-01-06 11:32:38,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:38,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:38,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:38,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:38,476 INFO L87 Difference]: Start difference. First operand 282 states and 482 transitions. Second operand 3 states. [2021-01-06 11:32:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:38,617 INFO L93 Difference]: Finished difference Result 573 states and 980 transitions. [2021-01-06 11:32:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:38,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:32:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:38,620 INFO L225 Difference]: With dead ends: 573 [2021-01-06 11:32:38,620 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:32:38,621 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:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:32:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2021-01-06 11:32:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2021-01-06 11:32:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 504 transitions. [2021-01-06 11:32:38,634 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 504 transitions. Word has length 85 [2021-01-06 11:32:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:38,634 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 504 transitions. [2021-01-06 11:32:38,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 504 transitions. [2021-01-06 11:32:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 11:32:38,637 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:38,637 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:38,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:32:38,638 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:38,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:38,638 INFO L82 PathProgramCache]: Analyzing trace with hash -812323390, now seen corresponding path program 1 times [2021-01-06 11:32:38,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:38,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130021906] [2021-01-06 11:32:38,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:38,702 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:38,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130021906] [2021-01-06 11:32:38,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:38,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:38,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880141433] [2021-01-06 11:32:38,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:38,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:38,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:38,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:38,705 INFO L87 Difference]: Start difference. First operand 297 states and 504 transitions. Second operand 3 states. [2021-01-06 11:32:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:38,905 INFO L93 Difference]: Finished difference Result 590 states and 1001 transitions. [2021-01-06 11:32:38,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:38,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 11:32:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:38,910 INFO L225 Difference]: With dead ends: 590 [2021-01-06 11:32:38,910 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:32:38,911 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:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:32:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2021-01-06 11:32:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2021-01-06 11:32:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 499 transitions. [2021-01-06 11:32:38,922 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 499 transitions. Word has length 85 [2021-01-06 11:32:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:38,923 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 499 transitions. [2021-01-06 11:32:38,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 499 transitions. [2021-01-06 11:32:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 11:32:38,924 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:38,924 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, 1] [2021-01-06 11:32:38,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:32:38,925 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash 99695542, now seen corresponding path program 1 times [2021-01-06 11:32:38,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:38,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101933839] [2021-01-06 11:32:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:38,968 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:38,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101933839] [2021-01-06 11:32:38,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:38,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:38,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623262486] [2021-01-06 11:32:38,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:38,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:38,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:38,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:38,971 INFO L87 Difference]: Start difference. First operand 295 states and 499 transitions. Second operand 3 states. [2021-01-06 11:32:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:39,110 INFO L93 Difference]: Finished difference Result 584 states and 988 transitions. [2021-01-06 11:32:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:39,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-06 11:32:39,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:39,114 INFO L225 Difference]: With dead ends: 584 [2021-01-06 11:32:39,114 INFO L226 Difference]: Without dead ends: 297 [2021-01-06 11:32:39,116 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:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-01-06 11:32:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2021-01-06 11:32:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2021-01-06 11:32:39,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 495 transitions. [2021-01-06 11:32:39,127 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 495 transitions. Word has length 86 [2021-01-06 11:32:39,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:39,127 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 495 transitions. [2021-01-06 11:32:39,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 495 transitions. [2021-01-06 11:32:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:32:39,129 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:39,129 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 11:32:39,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:32:39,129 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:39,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash -247819138, now seen corresponding path program 1 times [2021-01-06 11:32:39,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:39,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871060395] [2021-01-06 11:32:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-01-06 11:32:39,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871060395] [2021-01-06 11:32:39,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:39,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:39,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198199572] [2021-01-06 11:32:39,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:39,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:39,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:39,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:39,191 INFO L87 Difference]: Start difference. First operand 295 states and 495 transitions. Second operand 3 states. [2021-01-06 11:32:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:39,313 INFO L93 Difference]: Finished difference Result 590 states and 989 transitions. [2021-01-06 11:32:39,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:39,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 11:32:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:39,316 INFO L225 Difference]: With dead ends: 590 [2021-01-06 11:32:39,316 INFO L226 Difference]: Without dead ends: 303 [2021-01-06 11:32:39,317 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:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-01-06 11:32:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2021-01-06 11:32:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2021-01-06 11:32:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 500 transitions. [2021-01-06 11:32:39,329 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 500 transitions. Word has length 98 [2021-01-06 11:32:39,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:39,329 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 500 transitions. [2021-01-06 11:32:39,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 500 transitions. [2021-01-06 11:32:39,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 11:32:39,331 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:39,331 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, 1] [2021-01-06 11:32:39,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:32:39,332 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:39,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:39,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1134276038, now seen corresponding path program 1 times [2021-01-06 11:32:39,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:39,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428193012] [2021-01-06 11:32:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:39,383 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:39,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428193012] [2021-01-06 11:32:39,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:39,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:39,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909699873] [2021-01-06 11:32:39,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:39,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:39,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:39,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:39,388 INFO L87 Difference]: Start difference. First operand 303 states and 500 transitions. Second operand 3 states. [2021-01-06 11:32:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:39,582 INFO L93 Difference]: Finished difference Result 629 states and 1041 transitions. [2021-01-06 11:32:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:39,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 11:32:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:39,586 INFO L225 Difference]: With dead ends: 629 [2021-01-06 11:32:39,586 INFO L226 Difference]: Without dead ends: 334 [2021-01-06 11:32:39,587 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:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-01-06 11:32:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2021-01-06 11:32:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2021-01-06 11:32:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 547 transitions. [2021-01-06 11:32:39,599 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 547 transitions. Word has length 99 [2021-01-06 11:32:39,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:39,599 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 547 transitions. [2021-01-06 11:32:39,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 547 transitions. [2021-01-06 11:32:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:32:39,601 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:39,601 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, 1] [2021-01-06 11:32:39,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:32:39,602 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:39,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:39,602 INFO L82 PathProgramCache]: Analyzing trace with hash -85258053, now seen corresponding path program 1 times [2021-01-06 11:32:39,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:39,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210982802] [2021-01-06 11:32:39,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:39,647 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:39,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210982802] [2021-01-06 11:32:39,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:39,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:39,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800086361] [2021-01-06 11:32:39,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:39,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:39,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:39,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:39,650 INFO L87 Difference]: Start difference. First operand 332 states and 547 transitions. Second operand 3 states. [2021-01-06 11:32:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:39,814 INFO L93 Difference]: Finished difference Result 690 states and 1141 transitions. [2021-01-06 11:32:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:39,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 11:32:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:39,817 INFO L225 Difference]: With dead ends: 690 [2021-01-06 11:32:39,817 INFO L226 Difference]: Without dead ends: 366 [2021-01-06 11:32:39,818 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:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-01-06 11:32:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 359. [2021-01-06 11:32:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2021-01-06 11:32:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 589 transitions. [2021-01-06 11:32:39,831 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 589 transitions. Word has length 100 [2021-01-06 11:32:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:39,832 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 589 transitions. [2021-01-06 11:32:39,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 589 transitions. [2021-01-06 11:32:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 11:32:39,834 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:39,834 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, 1] [2021-01-06 11:32:39,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:32:39,834 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:39,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:39,835 INFO L82 PathProgramCache]: Analyzing trace with hash 149056915, now seen corresponding path program 1 times [2021-01-06 11:32:39,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:39,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606147292] [2021-01-06 11:32:39,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:39,878 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:39,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606147292] [2021-01-06 11:32:39,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:39,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:39,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372520414] [2021-01-06 11:32:39,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:39,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:39,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:39,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:39,881 INFO L87 Difference]: Start difference. First operand 359 states and 589 transitions. Second operand 3 states. [2021-01-06 11:32:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:40,131 INFO L93 Difference]: Finished difference Result 712 states and 1168 transitions. [2021-01-06 11:32:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:40,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 11:32:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:40,135 INFO L225 Difference]: With dead ends: 712 [2021-01-06 11:32:40,136 INFO L226 Difference]: Without dead ends: 361 [2021-01-06 11:32:40,137 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:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-01-06 11:32:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 359. [2021-01-06 11:32:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2021-01-06 11:32:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 585 transitions. [2021-01-06 11:32:40,156 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 585 transitions. Word has length 100 [2021-01-06 11:32:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:40,157 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 585 transitions. [2021-01-06 11:32:40,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 585 transitions. [2021-01-06 11:32:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 11:32:40,160 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:40,161 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, 1] [2021-01-06 11:32:40,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:32:40,161 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:40,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash -692060190, now seen corresponding path program 1 times [2021-01-06 11:32:40,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:40,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9998230] [2021-01-06 11:32:40,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:40,221 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:40,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9998230] [2021-01-06 11:32:40,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:40,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:40,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984240502] [2021-01-06 11:32:40,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:40,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:40,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:40,224 INFO L87 Difference]: Start difference. First operand 359 states and 585 transitions. Second operand 3 states. [2021-01-06 11:32:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:40,437 INFO L93 Difference]: Finished difference Result 717 states and 1170 transitions. [2021-01-06 11:32:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:40,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2021-01-06 11:32:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:40,440 INFO L225 Difference]: With dead ends: 717 [2021-01-06 11:32:40,441 INFO L226 Difference]: Without dead ends: 366 [2021-01-06 11:32:40,442 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:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-01-06 11:32:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 359. [2021-01-06 11:32:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2021-01-06 11:32:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 580 transitions. [2021-01-06 11:32:40,456 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 580 transitions. Word has length 101 [2021-01-06 11:32:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:40,457 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 580 transitions. [2021-01-06 11:32:40,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 580 transitions. [2021-01-06 11:32:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 11:32:40,459 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:40,459 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:40,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:32:40,460 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:40,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:40,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1838364151, now seen corresponding path program 1 times [2021-01-06 11:32:40,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:40,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174360862] [2021-01-06 11:32:40,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:40,501 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:40,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174360862] [2021-01-06 11:32:40,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:40,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:40,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158078968] [2021-01-06 11:32:40,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:40,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:40,503 INFO L87 Difference]: Start difference. First operand 359 states and 580 transitions. Second operand 3 states. [2021-01-06 11:32:40,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:40,658 INFO L93 Difference]: Finished difference Result 735 states and 1189 transitions. [2021-01-06 11:32:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:40,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 11:32:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:40,661 INFO L225 Difference]: With dead ends: 735 [2021-01-06 11:32:40,661 INFO L226 Difference]: Without dead ends: 384 [2021-01-06 11:32:40,662 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:40,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-01-06 11:32:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2021-01-06 11:32:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2021-01-06 11:32:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 609 transitions. [2021-01-06 11:32:40,677 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 609 transitions. Word has length 105 [2021-01-06 11:32:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:40,677 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 609 transitions. [2021-01-06 11:32:40,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 609 transitions. [2021-01-06 11:32:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 11:32:40,679 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:40,679 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:40,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:32:40,680 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:40,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash 759513378, now seen corresponding path program 1 times [2021-01-06 11:32:40,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:40,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879540635] [2021-01-06 11:32:40,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:40,754 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:40,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879540635] [2021-01-06 11:32:40,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:40,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:40,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467337745] [2021-01-06 11:32:40,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:40,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:40,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:40,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:40,757 INFO L87 Difference]: Start difference. First operand 380 states and 609 transitions. Second operand 3 states. [2021-01-06 11:32:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:40,911 INFO L93 Difference]: Finished difference Result 756 states and 1212 transitions. [2021-01-06 11:32:40,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:40,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 11:32:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:40,914 INFO L225 Difference]: With dead ends: 756 [2021-01-06 11:32:40,914 INFO L226 Difference]: Without dead ends: 384 [2021-01-06 11:32:40,915 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:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-01-06 11:32:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2021-01-06 11:32:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2021-01-06 11:32:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 603 transitions. [2021-01-06 11:32:40,930 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 603 transitions. Word has length 106 [2021-01-06 11:32:40,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:40,930 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 603 transitions. [2021-01-06 11:32:40,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 603 transitions. [2021-01-06 11:32:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 11:32:40,932 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:40,932 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:40,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:32:40,933 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:40,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:40,934 INFO L82 PathProgramCache]: Analyzing trace with hash 112174862, now seen corresponding path program 1 times [2021-01-06 11:32:40,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:40,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961340742] [2021-01-06 11:32:40,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:40,987 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:40,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961340742] [2021-01-06 11:32:40,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:40,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:40,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102636778] [2021-01-06 11:32:40,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:40,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:40,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:40,990 INFO L87 Difference]: Start difference. First operand 380 states and 603 transitions. Second operand 3 states. [2021-01-06 11:32:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:41,042 INFO L93 Difference]: Finished difference Result 752 states and 1194 transitions. [2021-01-06 11:32:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:41,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 11:32:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:41,047 INFO L225 Difference]: With dead ends: 752 [2021-01-06 11:32:41,047 INFO L226 Difference]: Without dead ends: 750 [2021-01-06 11:32:41,048 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:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-01-06 11:32:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 750. [2021-01-06 11:32:41,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2021-01-06 11:32:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1191 transitions. [2021-01-06 11:32:41,076 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1191 transitions. Word has length 121 [2021-01-06 11:32:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:41,077 INFO L481 AbstractCegarLoop]: Abstraction has 750 states and 1191 transitions. [2021-01-06 11:32:41,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1191 transitions. [2021-01-06 11:32:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-06 11:32:41,079 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:41,080 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:41,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:32:41,080 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:41,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:41,081 INFO L82 PathProgramCache]: Analyzing trace with hash 175328748, now seen corresponding path program 1 times [2021-01-06 11:32:41,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:41,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797107538] [2021-01-06 11:32:41,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:41,126 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:41,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797107538] [2021-01-06 11:32:41,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:41,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:41,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738695045] [2021-01-06 11:32:41,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:41,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:41,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:41,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:41,129 INFO L87 Difference]: Start difference. First operand 750 states and 1191 transitions. Second operand 3 states. [2021-01-06 11:32:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:41,356 INFO L93 Difference]: Finished difference Result 1576 states and 2506 transitions. [2021-01-06 11:32:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:41,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2021-01-06 11:32:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:41,362 INFO L225 Difference]: With dead ends: 1576 [2021-01-06 11:32:41,362 INFO L226 Difference]: Without dead ends: 834 [2021-01-06 11:32:41,364 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:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2021-01-06 11:32:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 826. [2021-01-06 11:32:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2021-01-06 11:32:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1309 transitions. [2021-01-06 11:32:41,396 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1309 transitions. Word has length 122 [2021-01-06 11:32:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:41,396 INFO L481 AbstractCegarLoop]: Abstraction has 826 states and 1309 transitions. [2021-01-06 11:32:41,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1309 transitions. [2021-01-06 11:32:41,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-01-06 11:32:41,399 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:41,400 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, 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] [2021-01-06 11:32:41,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:32:41,400 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:41,401 INFO L82 PathProgramCache]: Analyzing trace with hash -772997618, now seen corresponding path program 1 times [2021-01-06 11:32:41,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:41,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716274664] [2021-01-06 11:32:41,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-01-06 11:32:41,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716274664] [2021-01-06 11:32:41,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:41,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:41,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679206564] [2021-01-06 11:32:41,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:41,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:41,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:41,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:41,449 INFO L87 Difference]: Start difference. First operand 826 states and 1309 transitions. Second operand 3 states. [2021-01-06 11:32:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:41,661 INFO L93 Difference]: Finished difference Result 1652 states and 2618 transitions. [2021-01-06 11:32:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:41,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2021-01-06 11:32:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:41,667 INFO L225 Difference]: With dead ends: 1652 [2021-01-06 11:32:41,667 INFO L226 Difference]: Without dead ends: 830 [2021-01-06 11:32:41,668 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:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2021-01-06 11:32:41,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 822. [2021-01-06 11:32:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2021-01-06 11:32:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1297 transitions. [2021-01-06 11:32:41,701 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1297 transitions. Word has length 123 [2021-01-06 11:32:41,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:41,702 INFO L481 AbstractCegarLoop]: Abstraction has 822 states and 1297 transitions. [2021-01-06 11:32:41,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1297 transitions. [2021-01-06 11:32:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 11:32:41,706 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:41,706 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:32:41,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:32:41,706 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:41,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:41,707 INFO L82 PathProgramCache]: Analyzing trace with hash 733239163, now seen corresponding path program 1 times [2021-01-06 11:32:41,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:41,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516564563] [2021-01-06 11:32:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-01-06 11:32:41,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516564563] [2021-01-06 11:32:41,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:41,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:41,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132016918] [2021-01-06 11:32:41,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:41,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:41,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:41,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:41,766 INFO L87 Difference]: Start difference. First operand 822 states and 1297 transitions. Second operand 3 states. [2021-01-06 11:32:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:41,992 INFO L93 Difference]: Finished difference Result 1712 states and 2702 transitions. [2021-01-06 11:32:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:41,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2021-01-06 11:32:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:41,998 INFO L225 Difference]: With dead ends: 1712 [2021-01-06 11:32:41,998 INFO L226 Difference]: Without dead ends: 898 [2021-01-06 11:32:41,999 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:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-01-06 11:32:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 894. [2021-01-06 11:32:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2021-01-06 11:32:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1405 transitions. [2021-01-06 11:32:42,034 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1405 transitions. Word has length 155 [2021-01-06 11:32:42,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:42,034 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1405 transitions. [2021-01-06 11:32:42,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1405 transitions. [2021-01-06 11:32:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-01-06 11:32:42,037 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:42,037 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-01-06 11:32:42,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:32:42,038 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:42,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash -834114823, now seen corresponding path program 1 times [2021-01-06 11:32:42,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:42,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473915239] [2021-01-06 11:32:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-01-06 11:32:42,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473915239] [2021-01-06 11:32:42,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:42,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:42,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072001379] [2021-01-06 11:32:42,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:42,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:42,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:42,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:42,093 INFO L87 Difference]: Start difference. First operand 894 states and 1405 transitions. Second operand 3 states. [2021-01-06 11:32:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:42,296 INFO L93 Difference]: Finished difference Result 1784 states and 2802 transitions. [2021-01-06 11:32:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:42,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2021-01-06 11:32:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:42,302 INFO L225 Difference]: With dead ends: 1784 [2021-01-06 11:32:42,302 INFO L226 Difference]: Without dead ends: 894 [2021-01-06 11:32:42,304 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:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2021-01-06 11:32:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 890. [2021-01-06 11:32:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2021-01-06 11:32:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1391 transitions. [2021-01-06 11:32:42,345 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1391 transitions. Word has length 156 [2021-01-06 11:32:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:42,345 INFO L481 AbstractCegarLoop]: Abstraction has 890 states and 1391 transitions. [2021-01-06 11:32:42,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1391 transitions. [2021-01-06 11:32:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-01-06 11:32:42,348 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:42,349 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1] [2021-01-06 11:32:42,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:32:42,349 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:42,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1569447121, now seen corresponding path program 1 times [2021-01-06 11:32:42,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:42,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778007042] [2021-01-06 11:32:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-01-06 11:32:42,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778007042] [2021-01-06 11:32:42,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:42,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:42,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805798356] [2021-01-06 11:32:42,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:42,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:42,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:42,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:42,503 INFO L87 Difference]: Start difference. First operand 890 states and 1391 transitions. Second operand 3 states. [2021-01-06 11:32:42,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:42,712 INFO L93 Difference]: Finished difference Result 1844 states and 2882 transitions. [2021-01-06 11:32:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:42,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2021-01-06 11:32:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:42,718 INFO L225 Difference]: With dead ends: 1844 [2021-01-06 11:32:42,719 INFO L226 Difference]: Without dead ends: 962 [2021-01-06 11:32:42,720 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:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-01-06 11:32:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 958. [2021-01-06 11:32:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2021-01-06 11:32:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1489 transitions. [2021-01-06 11:32:42,758 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1489 transitions. Word has length 186 [2021-01-06 11:32:42,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:42,759 INFO L481 AbstractCegarLoop]: Abstraction has 958 states and 1489 transitions. [2021-01-06 11:32:42,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1489 transitions. [2021-01-06 11:32:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-01-06 11:32:42,762 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:42,763 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1] [2021-01-06 11:32:42,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:32:42,763 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:42,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1139700173, now seen corresponding path program 1 times [2021-01-06 11:32:42,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:42,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140301417] [2021-01-06 11:32:42,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-01-06 11:32:42,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140301417] [2021-01-06 11:32:42,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:42,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:42,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713945524] [2021-01-06 11:32:42,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:42,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:42,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:42,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:42,836 INFO L87 Difference]: Start difference. First operand 958 states and 1489 transitions. Second operand 3 states. [2021-01-06 11:32:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:43,073 INFO L93 Difference]: Finished difference Result 1912 states and 2970 transitions. [2021-01-06 11:32:43,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:43,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2021-01-06 11:32:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:43,080 INFO L225 Difference]: With dead ends: 1912 [2021-01-06 11:32:43,080 INFO L226 Difference]: Without dead ends: 958 [2021-01-06 11:32:43,083 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:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-01-06 11:32:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 954. [2021-01-06 11:32:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2021-01-06 11:32:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1473 transitions. [2021-01-06 11:32:43,124 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1473 transitions. Word has length 187 [2021-01-06 11:32:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:43,125 INFO L481 AbstractCegarLoop]: Abstraction has 954 states and 1473 transitions. [2021-01-06 11:32:43,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1473 transitions. [2021-01-06 11:32:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-01-06 11:32:43,129 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:43,129 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:43,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:32:43,130 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:43,130 INFO L82 PathProgramCache]: Analyzing trace with hash 449451538, now seen corresponding path program 1 times [2021-01-06 11:32:43,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:43,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118578128] [2021-01-06 11:32:43,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2021-01-06 11:32:43,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118578128] [2021-01-06 11:32:43,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:43,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:43,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246330046] [2021-01-06 11:32:43,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:43,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:43,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:43,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:43,202 INFO L87 Difference]: Start difference. First operand 954 states and 1473 transitions. Second operand 3 states. [2021-01-06 11:32:43,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:43,386 INFO L93 Difference]: Finished difference Result 1974 states and 3056 transitions. [2021-01-06 11:32:43,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:43,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2021-01-06 11:32:43,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:43,392 INFO L225 Difference]: With dead ends: 1974 [2021-01-06 11:32:43,393 INFO L226 Difference]: Without dead ends: 1028 [2021-01-06 11:32:43,394 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:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-01-06 11:32:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1004. [2021-01-06 11:32:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2021-01-06 11:32:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1537 transitions. [2021-01-06 11:32:43,438 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1537 transitions. Word has length 204 [2021-01-06 11:32:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:43,439 INFO L481 AbstractCegarLoop]: Abstraction has 1004 states and 1537 transitions. [2021-01-06 11:32:43,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1537 transitions. [2021-01-06 11:32:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-01-06 11:32:43,442 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:43,443 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:43,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:32:43,443 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:43,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1353531801, now seen corresponding path program 1 times [2021-01-06 11:32:43,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:43,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915993193] [2021-01-06 11:32:43,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2021-01-06 11:32:43,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915993193] [2021-01-06 11:32:43,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:43,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:43,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466188540] [2021-01-06 11:32:43,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:43,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:43,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:43,540 INFO L87 Difference]: Start difference. First operand 1004 states and 1537 transitions. Second operand 3 states. [2021-01-06 11:32:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:43,723 INFO L93 Difference]: Finished difference Result 2024 states and 3102 transitions. [2021-01-06 11:32:43,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:43,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2021-01-06 11:32:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:43,729 INFO L225 Difference]: With dead ends: 2024 [2021-01-06 11:32:43,729 INFO L226 Difference]: Without dead ends: 1028 [2021-01-06 11:32:43,731 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:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-01-06 11:32:43,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1004. [2021-01-06 11:32:43,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2021-01-06 11:32:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1519 transitions. [2021-01-06 11:32:43,772 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1519 transitions. Word has length 205 [2021-01-06 11:32:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:43,772 INFO L481 AbstractCegarLoop]: Abstraction has 1004 states and 1519 transitions. [2021-01-06 11:32:43,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1519 transitions. [2021-01-06 11:32:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-01-06 11:32:43,776 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:43,776 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:43,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:32:43,777 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:43,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:43,777 INFO L82 PathProgramCache]: Analyzing trace with hash -929225253, now seen corresponding path program 1 times [2021-01-06 11:32:43,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:43,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605997579] [2021-01-06 11:32:43,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-01-06 11:32:43,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605997579] [2021-01-06 11:32:43,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:43,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:43,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115600601] [2021-01-06 11:32:43,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:43,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:43,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:43,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:43,853 INFO L87 Difference]: Start difference. First operand 1004 states and 1519 transitions. Second operand 3 states. [2021-01-06 11:32:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:44,035 INFO L93 Difference]: Finished difference Result 2008 states and 3036 transitions. [2021-01-06 11:32:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:44,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2021-01-06 11:32:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:44,041 INFO L225 Difference]: With dead ends: 2008 [2021-01-06 11:32:44,041 INFO L226 Difference]: Without dead ends: 1012 [2021-01-06 11:32:44,043 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:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2021-01-06 11:32:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1004. [2021-01-06 11:32:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2021-01-06 11:32:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1507 transitions. [2021-01-06 11:32:44,084 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1507 transitions. Word has length 217 [2021-01-06 11:32:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:44,084 INFO L481 AbstractCegarLoop]: Abstraction has 1004 states and 1507 transitions. [2021-01-06 11:32:44,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:44,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1507 transitions. [2021-01-06 11:32:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-01-06 11:32:44,088 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:44,089 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:44,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:32:44,089 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:44,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:44,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2118002585, now seen corresponding path program 1 times [2021-01-06 11:32:44,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:44,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182336603] [2021-01-06 11:32:44,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:44,185 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-01-06 11:32:44,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182336603] [2021-01-06 11:32:44,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:44,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:44,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400958035] [2021-01-06 11:32:44,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:44,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:44,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:44,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:44,187 INFO L87 Difference]: Start difference. First operand 1004 states and 1507 transitions. Second operand 3 states. [2021-01-06 11:32:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:44,368 INFO L93 Difference]: Finished difference Result 2008 states and 3012 transitions. [2021-01-06 11:32:44,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:44,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2021-01-06 11:32:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:44,374 INFO L225 Difference]: With dead ends: 2008 [2021-01-06 11:32:44,374 INFO L226 Difference]: Without dead ends: 994 [2021-01-06 11:32:44,375 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:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2021-01-06 11:32:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 986. [2021-01-06 11:32:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2021-01-06 11:32:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1469 transitions. [2021-01-06 11:32:44,415 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1469 transitions. Word has length 218 [2021-01-06 11:32:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:44,416 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 1469 transitions. [2021-01-06 11:32:44,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1469 transitions. [2021-01-06 11:32:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-01-06 11:32:44,420 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:44,420 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:44,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:32:44,420 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:44,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:44,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1080917184, now seen corresponding path program 1 times [2021-01-06 11:32:44,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:44,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263296451] [2021-01-06 11:32:44,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2021-01-06 11:32:44,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263296451] [2021-01-06 11:32:44,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:44,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:44,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948903554] [2021-01-06 11:32:44,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:44,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:44,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:44,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:44,491 INFO L87 Difference]: Start difference. First operand 986 states and 1469 transitions. Second operand 3 states. [2021-01-06 11:32:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:44,701 INFO L93 Difference]: Finished difference Result 2016 states and 3008 transitions. [2021-01-06 11:32:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:44,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2021-01-06 11:32:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:44,708 INFO L225 Difference]: With dead ends: 2016 [2021-01-06 11:32:44,708 INFO L226 Difference]: Without dead ends: 1038 [2021-01-06 11:32:44,710 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:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-01-06 11:32:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1032. [2021-01-06 11:32:44,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2021-01-06 11:32:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1523 transitions. [2021-01-06 11:32:44,762 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1523 transitions. Word has length 224 [2021-01-06 11:32:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:44,762 INFO L481 AbstractCegarLoop]: Abstraction has 1032 states and 1523 transitions. [2021-01-06 11:32:44,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1523 transitions. [2021-01-06 11:32:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 11:32:44,767 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:44,767 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:32:44,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:32:44,768 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:44,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1544536537, now seen corresponding path program 1 times [2021-01-06 11:32:44,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:44,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551197747] [2021-01-06 11:32:44,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2021-01-06 11:32:44,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551197747] [2021-01-06 11:32:44,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:44,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:44,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665930651] [2021-01-06 11:32:44,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:44,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:44,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:44,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:44,871 INFO L87 Difference]: Start difference. First operand 1032 states and 1523 transitions. Second operand 3 states. [2021-01-06 11:32:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:45,035 INFO L93 Difference]: Finished difference Result 2062 states and 3042 transitions. [2021-01-06 11:32:45,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:45,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2021-01-06 11:32:45,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:45,041 INFO L225 Difference]: With dead ends: 2062 [2021-01-06 11:32:45,041 INFO L226 Difference]: Without dead ends: 1030 [2021-01-06 11:32:45,042 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:45,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2021-01-06 11:32:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1024. [2021-01-06 11:32:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2021-01-06 11:32:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1491 transitions. [2021-01-06 11:32:45,081 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1491 transitions. Word has length 225 [2021-01-06 11:32:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:45,082 INFO L481 AbstractCegarLoop]: Abstraction has 1024 states and 1491 transitions. [2021-01-06 11:32:45,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1491 transitions. [2021-01-06 11:32:45,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 11:32:45,086 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:45,087 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 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, 1, 1, 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,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:32:45,087 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:45,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:45,088 INFO L82 PathProgramCache]: Analyzing trace with hash 454513996, now seen corresponding path program 1 times [2021-01-06 11:32:45,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:45,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700469857] [2021-01-06 11:32:45,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2021-01-06 11:32:45,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700469857] [2021-01-06 11:32:45,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744406213] [2021-01-06 11:32:45,223 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:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:45,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 11:32:45,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-01-06 11:32:45,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:32:45,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 11:32:45,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851677195] [2021-01-06 11:32:45,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:45,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:45,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:45,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:32:45,829 INFO L87 Difference]: Start difference. First operand 1024 states and 1491 transitions. Second operand 3 states. [2021-01-06 11:32:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:45,911 INFO L93 Difference]: Finished difference Result 2547 states and 3708 transitions. [2021-01-06 11:32:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:45,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2021-01-06 11:32:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:45,920 INFO L225 Difference]: With dead ends: 2547 [2021-01-06 11:32:45,920 INFO L226 Difference]: Without dead ends: 1531 [2021-01-06 11:32:45,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:32:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2021-01-06 11:32:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2021-01-06 11:32:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1531 states. [2021-01-06 11:32:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2228 transitions. [2021-01-06 11:32:45,990 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2228 transitions. Word has length 261 [2021-01-06 11:32:45,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:45,991 INFO L481 AbstractCegarLoop]: Abstraction has 1531 states and 2228 transitions. [2021-01-06 11:32:45,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2228 transitions. [2021-01-06 11:32:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-01-06 11:32:45,997 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:45,997 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, 1, 1] [2021-01-06 11:32:46,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-06 11:32:46,213 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:46,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:46,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1829254476, now seen corresponding path program 1 times [2021-01-06 11:32:46,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:46,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205314246] [2021-01-06 11:32:46,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:46,410 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:46,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205314246] [2021-01-06 11:32:46,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:46,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:46,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132683736] [2021-01-06 11:32:46,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:46,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:46,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:46,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:46,413 INFO L87 Difference]: Start difference. First operand 1531 states and 2228 transitions. Second operand 3 states. [2021-01-06 11:32:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:46,523 INFO L93 Difference]: Finished difference Result 4496 states and 6540 transitions. [2021-01-06 11:32:46,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:46,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2021-01-06 11:32:46,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:46,538 INFO L225 Difference]: With dead ends: 4496 [2021-01-06 11:32:46,538 INFO L226 Difference]: Without dead ends: 2973 [2021-01-06 11:32:46,541 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,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2021-01-06 11:32:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2971. [2021-01-06 11:32:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2971 states. [2021-01-06 11:32:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 4314 transitions. [2021-01-06 11:32:46,670 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 4314 transitions. Word has length 271 [2021-01-06 11:32:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:46,670 INFO L481 AbstractCegarLoop]: Abstraction has 2971 states and 4314 transitions. [2021-01-06 11:32:46,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4314 transitions. [2021-01-06 11:32:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2021-01-06 11:32:46,679 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:46,679 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 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, 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:46,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:32:46,680 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:46,680 INFO L82 PathProgramCache]: Analyzing trace with hash -86423524, now seen corresponding path program 1 times [2021-01-06 11:32:46,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:46,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8126192] [2021-01-06 11:32:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2021-01-06 11:32:46,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8126192] [2021-01-06 11:32:46,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:46,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:46,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215072725] [2021-01-06 11:32:46,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:46,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:46,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:46,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:46,871 INFO L87 Difference]: Start difference. First operand 2971 states and 4314 transitions. Second operand 3 states. [2021-01-06 11:32:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:47,101 INFO L93 Difference]: Finished difference Result 6054 states and 8808 transitions. [2021-01-06 11:32:47,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:47,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2021-01-06 11:32:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:47,111 INFO L225 Difference]: With dead ends: 6054 [2021-01-06 11:32:47,111 INFO L226 Difference]: Without dead ends: 1980 [2021-01-06 11:32:47,117 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,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2021-01-06 11:32:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1960. [2021-01-06 11:32:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2021-01-06 11:32:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2798 transitions. [2021-01-06 11:32:47,196 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2798 transitions. Word has length 308 [2021-01-06 11:32:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:47,196 INFO L481 AbstractCegarLoop]: Abstraction has 1960 states and 2798 transitions. [2021-01-06 11:32:47,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2798 transitions. [2021-01-06 11:32:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2021-01-06 11:32:47,204 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:47,204 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, 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, 1] [2021-01-06 11:32:47,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:32:47,205 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:47,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1520948552, now seen corresponding path program 1 times [2021-01-06 11:32:47,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:47,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46461213] [2021-01-06 11:32:47,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-01-06 11:32:47,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46461213] [2021-01-06 11:32:47,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394893047] [2021-01-06 11:32:47,465 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:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:47,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:32:47,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-01-06 11:32:48,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:32:48,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 11:32:48,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767602559] [2021-01-06 11:32:48,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:32:48,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:48,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:32:48,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:32:48,147 INFO L87 Difference]: Start difference. First operand 1960 states and 2798 transitions. Second operand 4 states. [2021-01-06 11:32:48,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:48,531 INFO L93 Difference]: Finished difference Result 4530 states and 6458 transitions. [2021-01-06 11:32:48,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:32:48,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2021-01-06 11:32:48,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:48,560 INFO L225 Difference]: With dead ends: 4530 [2021-01-06 11:32:48,560 INFO L226 Difference]: Without dead ends: 2534 [2021-01-06 11:32:48,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 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:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2021-01-06 11:32:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 1935. [2021-01-06 11:32:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2021-01-06 11:32:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2678 transitions. [2021-01-06 11:32:48,672 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2678 transitions. Word has length 373 [2021-01-06 11:32:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:48,673 INFO L481 AbstractCegarLoop]: Abstraction has 1935 states and 2678 transitions. [2021-01-06 11:32:48,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:32:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2678 transitions. [2021-01-06 11:32:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2021-01-06 11:32:48,679 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:48,679 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, 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] [2021-01-06 11:32:48,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:48,894 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:48,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:48,894 INFO L82 PathProgramCache]: Analyzing trace with hash -145524280, now seen corresponding path program 1 times [2021-01-06 11:32:48,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:48,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673318919] [2021-01-06 11:32:48,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-01-06 11:32:49,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673318919] [2021-01-06 11:32:49,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811441297] [2021-01-06 11:32:49,230 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:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:49,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 11:32:49,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:32:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-01-06 11:32:50,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:32:50,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-06 11:32:50,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592808794] [2021-01-06 11:32:50,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 11:32:50,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:50,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 11:32:50,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:32:50,058 INFO L87 Difference]: Start difference. First operand 1935 states and 2678 transitions. Second operand 6 states. [2021-01-06 11:32:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:50,401 INFO L93 Difference]: Finished difference Result 4773 states and 6635 transitions. [2021-01-06 11:32:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:32:50,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 601 [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: 4773 [2021-01-06 11:32:50,408 INFO L226 Difference]: Without dead ends: 2705 [2021-01-06 11:32:50,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 601 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:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2021-01-06 11:32:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 1935. [2021-01-06 11:32:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2021-01-06 11:32:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2678 transitions. [2021-01-06 11:32:50,497 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2678 transitions. Word has length 601 [2021-01-06 11:32:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:50,498 INFO L481 AbstractCegarLoop]: Abstraction has 1935 states and 2678 transitions. [2021-01-06 11:32:50,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 11:32:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2678 transitions. [2021-01-06 11:32:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2021-01-06 11:32:50,504 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:50,505 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 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:50,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:32:50,718 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:50,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:50,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1751516873, now seen corresponding path program 1 times [2021-01-06 11:32:50,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:50,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436979395] [2021-01-06 11:32:50,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5248 backedges. 2921 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2021-01-06 11:32:51,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436979395] [2021-01-06 11:32:51,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:51,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:51,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516763479] [2021-01-06 11:32:51,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:51,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:51,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:51,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:51,120 INFO L87 Difference]: Start difference. First operand 1935 states and 2678 transitions. Second operand 3 states. [2021-01-06 11:32:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:51,342 INFO L93 Difference]: Finished difference Result 3898 states and 5388 transitions. [2021-01-06 11:32:51,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:51,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 668 [2021-01-06 11:32:51,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:51,347 INFO L225 Difference]: With dead ends: 3898 [2021-01-06 11:32:51,348 INFO L226 Difference]: Without dead ends: 1971 [2021-01-06 11:32:51,351 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:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2021-01-06 11:32:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1935. [2021-01-06 11:32:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2021-01-06 11:32:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2658 transitions. [2021-01-06 11:32:51,451 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2658 transitions. Word has length 668 [2021-01-06 11:32:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:51,452 INFO L481 AbstractCegarLoop]: Abstraction has 1935 states and 2658 transitions. [2021-01-06 11:32:51,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2658 transitions. [2021-01-06 11:32:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2021-01-06 11:32:51,458 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:51,459 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 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] [2021-01-06 11:32:51,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:32:51,459 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:51,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:51,460 INFO L82 PathProgramCache]: Analyzing trace with hash -267197401, now seen corresponding path program 1 times [2021-01-06 11:32:51,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:51,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838065089] [2021-01-06 11:32:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5384 backedges. 2914 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2021-01-06 11:32:51,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838065089] [2021-01-06 11:32:51,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:51,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:51,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340233588] [2021-01-06 11:32:51,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:51,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:51,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:51,847 INFO L87 Difference]: Start difference. First operand 1935 states and 2658 transitions. Second operand 3 states. [2021-01-06 11:32:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:52,064 INFO L93 Difference]: Finished difference Result 3877 states and 5322 transitions. [2021-01-06 11:32:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:52,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 682 [2021-01-06 11:32:52,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:52,069 INFO L225 Difference]: With dead ends: 3877 [2021-01-06 11:32:52,069 INFO L226 Difference]: Without dead ends: 1950 [2021-01-06 11:32:52,072 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:52,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2021-01-06 11:32:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1922. [2021-01-06 11:32:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2021-01-06 11:32:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2599 transitions. [2021-01-06 11:32:52,143 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2599 transitions. Word has length 682 [2021-01-06 11:32:52,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:52,144 INFO L481 AbstractCegarLoop]: Abstraction has 1922 states and 2599 transitions. [2021-01-06 11:32:52,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2599 transitions. [2021-01-06 11:32:52,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2021-01-06 11:32:52,151 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:52,152 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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] [2021-01-06 11:32:52,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:32:52,152 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:52,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:52,153 INFO L82 PathProgramCache]: Analyzing trace with hash 616266130, now seen corresponding path program 1 times [2021-01-06 11:32:52,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:52,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236000723] [2021-01-06 11:32:52,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5825 backedges. 3230 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2021-01-06 11:32:52,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236000723] [2021-01-06 11:32:52,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:52,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:52,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010420526] [2021-01-06 11:32:52,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:52,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:52,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:52,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:52,590 INFO L87 Difference]: Start difference. First operand 1922 states and 2599 transitions. Second operand 3 states. [2021-01-06 11:32:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:52,790 INFO L93 Difference]: Finished difference Result 3905 states and 5284 transitions. [2021-01-06 11:32:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:52,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 711 [2021-01-06 11:32:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:52,796 INFO L225 Difference]: With dead ends: 3905 [2021-01-06 11:32:52,796 INFO L226 Difference]: Without dead ends: 1973 [2021-01-06 11:32:52,799 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:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2021-01-06 11:32:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1964. [2021-01-06 11:32:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2021-01-06 11:32:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2644 transitions. [2021-01-06 11:32:52,870 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2644 transitions. Word has length 711 [2021-01-06 11:32:52,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:52,870 INFO L481 AbstractCegarLoop]: Abstraction has 1964 states and 2644 transitions. [2021-01-06 11:32:52,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2644 transitions. [2021-01-06 11:32:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2021-01-06 11:32:52,878 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:32:52,878 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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] [2021-01-06 11:32:52,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 11:32:52,879 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:32:52,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:32:52,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2029147081, now seen corresponding path program 1 times [2021-01-06 11:32:52,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:32:52,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316696466] [2021-01-06 11:32:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:32:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:32:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5991 backedges. 3253 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2021-01-06 11:32:53,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316696466] [2021-01-06 11:32:53,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:32:53,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:32:53,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833765545] [2021-01-06 11:32:53,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:32:53,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:32:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:32:53,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:32:53,304 INFO L87 Difference]: Start difference. First operand 1964 states and 2644 transitions. Second operand 3 states. [2021-01-06 11:32:53,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:32:53,451 INFO L93 Difference]: Finished difference Result 2511 states and 3363 transitions. [2021-01-06 11:32:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:32:53,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 726 [2021-01-06 11:32:53,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:32:53,453 INFO L225 Difference]: With dead ends: 2511 [2021-01-06 11:32:53,453 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 11:32:53,456 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,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 11:32:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 11:32:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 11:32:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 11:32:53,457 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 726 [2021-01-06 11:32:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:32:53,457 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 11:32:53,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:32:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 11:32:53,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 11:32:53,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 11:32:53,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 11:32:54,206 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 122 [2021-01-06 11:32:54,475 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 122 [2021-01-06 11:32:54,946 WARN L197 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2021-01-06 11:32:55,352 WARN L197 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2021-01-06 11:32:55,746 WARN L197 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2021-01-06 11:32:56,253 WARN L197 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 96 [2021-01-06 11:32:56,712 WARN L197 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2021-01-06 11:32:57,158 WARN L197 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2021-01-06 11:32:57,570 WARN L197 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2021-01-06 11:32:58,016 WARN L197 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2021-01-06 11:32:58,546 WARN L197 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2021-01-06 11:32:59,004 WARN L197 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2021-01-06 11:32:59,539 WARN L197 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2021-01-06 11:33:00,078 WARN L197 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2021-01-06 11:33:00,610 WARN L197 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2021-01-06 11:33:01,081 WARN L197 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2021-01-06 11:33:01,612 WARN L197 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2021-01-06 11:33:02,133 WARN L197 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2021-01-06 11:33:02,849 WARN L197 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 69 [2021-01-06 11:33:03,414 WARN L197 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2021-01-06 11:33:04,134 WARN L197 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 69 [2021-01-06 11:33:04,596 WARN L197 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2021-01-06 11:33:04,601 INFO L185 CegarLoopUtils]: At program point L168(lines 167 609) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse4 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse6 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse9 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse6 .cse7 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-01-06 11:33:04,602 INFO L185 CegarLoopUtils]: At program point L135(lines 128 622) the Hoare annotation is: (let ((.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse11 .cse12 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11 .cse12 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-01-06 11:33:04,603 INFO L189 CegarLoopUtils]: For program point L102(line 102) no Hoare annotation was computed. [2021-01-06 11:33:04,603 INFO L189 CegarLoopUtils]: For program point L631(lines 631 659) no Hoare annotation was computed. [2021-01-06 11:33:04,603 INFO L189 CegarLoopUtils]: For program point L466(lines 466 470) no Hoare annotation was computed. [2021-01-06 11:33:04,603 INFO L189 CegarLoopUtils]: For program point L632(lines 632 656) no Hoare annotation was computed. [2021-01-06 11:33:04,603 INFO L189 CegarLoopUtils]: For program point L566(lines 566 570) no Hoare annotation was computed. [2021-01-06 11:33:04,604 INFO L189 CegarLoopUtils]: For program point L500(lines 500 504) no Hoare annotation was computed. [2021-01-06 11:33:04,604 INFO L189 CegarLoopUtils]: For program point L566-2(lines 566 570) no Hoare annotation was computed. [2021-01-06 11:33:04,604 INFO L189 CegarLoopUtils]: For program point L500-2(lines 211 592) no Hoare annotation was computed. [2021-01-06 11:33:04,604 INFO L189 CegarLoopUtils]: For program point L203(lines 203 597) no Hoare annotation was computed. [2021-01-06 11:33:04,604 INFO L189 CegarLoopUtils]: For program point L170(lines 170 608) no Hoare annotation was computed. [2021-01-06 11:33:04,604 INFO L189 CegarLoopUtils]: For program point L137(lines 137 619) no Hoare annotation was computed. [2021-01-06 11:33:04,604 INFO L189 CegarLoopUtils]: For program point L104(lines 104 630) no Hoare annotation was computed. [2021-01-06 11:33:04,604 INFO L189 CegarLoopUtils]: For program point L666(lines 666 670) no Hoare annotation was computed. [2021-01-06 11:33:04,605 INFO L189 CegarLoopUtils]: For program point L633(lines 633 642) no Hoare annotation was computed. [2021-01-06 11:33:04,605 INFO L189 CegarLoopUtils]: For program point L666-2(lines 666 670) no Hoare annotation was computed. [2021-01-06 11:33:04,605 INFO L189 CegarLoopUtils]: For program point L633-2(lines 632 654) no Hoare annotation was computed. [2021-01-06 11:33:04,605 INFO L189 CegarLoopUtils]: For program point L270(lines 270 274) no Hoare annotation was computed. [2021-01-06 11:33:04,605 INFO L185 CegarLoopUtils]: At program point L204(lines 200 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= 8497 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 (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-01-06 11:33:04,606 INFO L185 CegarLoopUtils]: At program point L105(lines 104 630) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (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 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= 8497 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 (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) [2021-01-06 11:33:04,606 INFO L189 CegarLoopUtils]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-01-06 11:33:04,606 INFO L189 CegarLoopUtils]: For program point L304-2(lines 211 592) no Hoare annotation was computed. [2021-01-06 11:33:04,606 INFO L189 CegarLoopUtils]: For program point L635(lines 635 639) no Hoare annotation was computed. [2021-01-06 11:33:04,606 INFO L189 CegarLoopUtils]: For program point L206(lines 206 596) no Hoare annotation was computed. [2021-01-06 11:33:04,606 INFO L189 CegarLoopUtils]: For program point L173(lines 173 607) no Hoare annotation was computed. [2021-01-06 11:33:04,606 INFO L189 CegarLoopUtils]: For program point L140(lines 140 618) no Hoare annotation was computed. [2021-01-06 11:33:04,607 INFO L189 CegarLoopUtils]: For program point L107(lines 107 629) no Hoare annotation was computed. [2021-01-06 11:33:04,607 INFO L189 CegarLoopUtils]: For program point L339(lines 339 343) no Hoare annotation was computed. [2021-01-06 11:33:04,607 INFO L189 CegarLoopUtils]: For program point L339-2(lines 211 592) no Hoare annotation was computed. [2021-01-06 11:33:04,607 INFO L185 CegarLoopUtils]: At program point L207(lines 206 596) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-01-06 11:33:04,607 INFO L185 CegarLoopUtils]: At program point L174(lines 170 608) the Hoare annotation is: (let ((.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse11 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse11 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse7 .cse8 .cse0 .cse1 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-01-06 11:33:04,608 INFO L185 CegarLoopUtils]: At program point L141(lines 137 619) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse10 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse7 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse5 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-01-06 11:33:04,608 INFO L189 CegarLoopUtils]: For program point L75(lines 75 83) no Hoare annotation was computed. [2021-01-06 11:33:04,608 INFO L189 CegarLoopUtils]: For program point L439(lines 439 451) no Hoare annotation was computed. [2021-01-06 11:33:04,608 INFO L185 CegarLoopUtils]: At program point L406(lines 397 417) the Hoare annotation is: (let ((.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse10 .cse11 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse7 .cse0 .cse1 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-01-06 11:33:04,608 INFO L189 CegarLoopUtils]: For program point L439-2(lines 439 451) no Hoare annotation was computed. [2021-01-06 11:33:04,608 INFO L189 CegarLoopUtils]: For program point L176(lines 176 606) no Hoare annotation was computed. [2021-01-06 11:33:04,609 INFO L189 CegarLoopUtils]: For program point L143(lines 143 617) no Hoare annotation was computed. [2021-01-06 11:33:04,609 INFO L189 CegarLoopUtils]: For program point L110(lines 110 628) no Hoare annotation was computed. [2021-01-06 11:33:04,609 INFO L185 CegarLoopUtils]: At program point L210(lines 209 595) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-01-06 11:33:04,609 INFO L189 CegarLoopUtils]: For program point L78(lines 78 82) no Hoare annotation was computed. [2021-01-06 11:33:04,609 INFO L189 CegarLoopUtils]: For program point L78-2(lines 75 83) no Hoare annotation was computed. [2021-01-06 11:33:04,609 INFO L189 CegarLoopUtils]: For program point L541(lines 541 546) no Hoare annotation was computed. [2021-01-06 11:33:04,609 INFO L189 CegarLoopUtils]: For program point L442(lines 442 447) no Hoare annotation was computed. [2021-01-06 11:33:04,609 INFO L189 CegarLoopUtils]: For program point L409(lines 409 413) no Hoare annotation was computed. [2021-01-06 11:33:04,610 INFO L189 CegarLoopUtils]: For program point L244(lines 244 249) no Hoare annotation was computed. [2021-01-06 11:33:04,610 INFO L189 CegarLoopUtils]: For program point L179(lines 179 605) no Hoare annotation was computed. [2021-01-06 11:33:04,610 INFO L189 CegarLoopUtils]: For program point L146(lines 146 616) no Hoare annotation was computed. [2021-01-06 11:33:04,610 INFO L189 CegarLoopUtils]: For program point L113(lines 113 627) no Hoare annotation was computed. [2021-01-06 11:33:04,610 INFO L189 CegarLoopUtils]: For program point L576(lines 576 586) no Hoare annotation was computed. [2021-01-06 11:33:04,610 INFO L189 CegarLoopUtils]: For program point L576-1(lines 576 586) no Hoare annotation was computed. [2021-01-06 11:33:04,610 INFO L189 CegarLoopUtils]: For program point L510(lines 510 514) no Hoare annotation was computed. [2021-01-06 11:33:04,610 INFO L189 CegarLoopUtils]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2021-01-06 11:33:04,611 INFO L185 CegarLoopUtils]: At program point L180(lines 176 606) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse12 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse17 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse1 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-01-06 11:33:04,611 INFO L185 CegarLoopUtils]: At program point L147(lines 143 617) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse8 .cse9 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse5 .cse6 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-01-06 11:33:04,611 INFO L189 CegarLoopUtils]: For program point L478(lines 478 482) no Hoare annotation was computed. [2021-01-06 11:33:04,612 INFO L185 CegarLoopUtils]: At program point L214(lines 107 629) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (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 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= 8497 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 (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) .cse0))) [2021-01-06 11:33:04,613 INFO L192 CegarLoopUtils]: At program point L677(lines 67 679) the Hoare annotation is: true [2021-01-06 11:33:04,613 INFO L189 CegarLoopUtils]: For program point L644(lines 644 650) no Hoare annotation was computed. [2021-01-06 11:33:04,613 INFO L189 CegarLoopUtils]: For program point L347(lines 347 379) no Hoare annotation was computed. [2021-01-06 11:33:04,613 INFO L189 CegarLoopUtils]: For program point L314(lines 314 318) no Hoare annotation was computed. [2021-01-06 11:33:04,613 INFO L189 CegarLoopUtils]: For program point L314-2(lines 314 318) no Hoare annotation was computed. [2021-01-06 11:33:04,614 INFO L189 CegarLoopUtils]: For program point L182(lines 182 604) no Hoare annotation was computed. [2021-01-06 11:33:04,614 INFO L189 CegarLoopUtils]: For program point L149(lines 149 615) no Hoare annotation was computed. [2021-01-06 11:33:04,614 INFO L189 CegarLoopUtils]: For program point L116(lines 116 626) no Hoare annotation was computed. [2021-01-06 11:33:04,614 INFO L192 CegarLoopUtils]: At program point L678(lines 12 680) the Hoare annotation is: true [2021-01-06 11:33:04,614 INFO L189 CegarLoopUtils]: For program point L579(lines 579 583) no Hoare annotation was computed. [2021-01-06 11:33:04,614 INFO L189 CegarLoopUtils]: For program point L85(lines 85 93) no Hoare annotation was computed. [2021-01-06 11:33:04,614 INFO L189 CegarLoopUtils]: For program point L85-1(lines 67 679) no Hoare annotation was computed. [2021-01-06 11:33:04,614 INFO L189 CegarLoopUtils]: For program point L350(lines 350 378) no Hoare annotation was computed. [2021-01-06 11:33:04,614 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 11:33:04,615 INFO L189 CegarLoopUtils]: For program point L350-1(lines 350 378) no Hoare annotation was computed. [2021-01-06 11:33:04,615 INFO L189 CegarLoopUtils]: For program point L251(lines 251 264) no Hoare annotation was computed. [2021-01-06 11:33:04,615 INFO L189 CegarLoopUtils]: For program point L185(lines 185 603) no Hoare annotation was computed. [2021-01-06 11:33:04,617 INFO L189 CegarLoopUtils]: For program point L152(lines 152 614) no Hoare annotation was computed. [2021-01-06 11:33:04,617 INFO L189 CegarLoopUtils]: For program point L119(lines 119 625) no Hoare annotation was computed. [2021-01-06 11:33:04,617 INFO L189 CegarLoopUtils]: For program point L86(lines 86 90) no Hoare annotation was computed. [2021-01-06 11:33:04,617 INFO L189 CegarLoopUtils]: For program point L351(lines 351 375) no Hoare annotation was computed. [2021-01-06 11:33:04,617 INFO L189 CegarLoopUtils]: For program point L219(lines 219 223) no Hoare annotation was computed. [2021-01-06 11:33:04,618 INFO L185 CegarLoopUtils]: At program point L186(lines 182 604) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse12 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse17 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse1 .cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse3 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-01-06 11:33:04,618 INFO L185 CegarLoopUtils]: At program point L153(lines 149 615) the Hoare annotation is: (let ((.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse9 .cse10 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse5 .cse6 .cse0 .cse1 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse9 .cse10 .cse11 .cse2 .cse3 .cse4))) [2021-01-06 11:33:04,618 INFO L189 CegarLoopUtils]: For program point L219-2(lines 211 592) no Hoare annotation was computed. [2021-01-06 11:33:04,618 INFO L189 CegarLoopUtils]: For program point L253(lines 253 258) no Hoare annotation was computed. [2021-01-06 11:33:04,619 INFO L189 CegarLoopUtils]: For program point L551(lines 551 559) no Hoare annotation was computed. [2021-01-06 11:33:04,619 INFO L189 CegarLoopUtils]: For program point L287(lines 287 291) no Hoare annotation was computed. [2021-01-06 11:33:04,619 INFO L189 CegarLoopUtils]: For program point L287-2(lines 211 592) no Hoare annotation was computed. [2021-01-06 11:33:04,619 INFO L189 CegarLoopUtils]: For program point L188(lines 188 602) no Hoare annotation was computed. [2021-01-06 11:33:04,619 INFO L189 CegarLoopUtils]: For program point L155(lines 155 613) no Hoare annotation was computed. [2021-01-06 11:33:04,619 INFO L189 CegarLoopUtils]: For program point L122(lines 122 624) no Hoare annotation was computed. [2021-01-06 11:33:04,619 INFO L189 CegarLoopUtils]: For program point L387(lines 387 418) no Hoare annotation was computed. [2021-01-06 11:33:04,619 INFO L189 CegarLoopUtils]: For program point L354(lines 354 374) no Hoare annotation was computed. [2021-01-06 11:33:04,620 INFO L185 CegarLoopUtils]: At program point L123(lines 119 625) the Hoare annotation is: (let ((.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse11 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse5 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse8 .cse9 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse5 .cse6 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-01-06 11:33:04,620 INFO L189 CegarLoopUtils]: For program point L388(lines 388 394) no Hoare annotation was computed. [2021-01-06 11:33:04,620 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 11:33:04,620 INFO L189 CegarLoopUtils]: For program point L554(lines 554 558) no Hoare annotation was computed. [2021-01-06 11:33:04,620 INFO L189 CegarLoopUtils]: For program point L521(lines 521 526) no Hoare annotation was computed. [2021-01-06 11:33:04,620 INFO L189 CegarLoopUtils]: For program point L356(lines 356 360) no Hoare annotation was computed. [2021-01-06 11:33:04,620 INFO L189 CegarLoopUtils]: For program point L323-1(lines 323 332) no Hoare annotation was computed. [2021-01-06 11:33:04,620 INFO L189 CegarLoopUtils]: For program point L356-2(lines 354 372) no Hoare annotation was computed. [2021-01-06 11:33:04,621 INFO L189 CegarLoopUtils]: For program point L191(lines 191 601) no Hoare annotation was computed. [2021-01-06 11:33:04,621 INFO L189 CegarLoopUtils]: For program point L158(lines 158 612) no Hoare annotation was computed. [2021-01-06 11:33:04,621 INFO L189 CegarLoopUtils]: For program point L125(lines 125 623) no Hoare annotation was computed. [2021-01-06 11:33:04,621 INFO L185 CegarLoopUtils]: At program point L555(lines 67 679) the Hoare annotation is: false [2021-01-06 11:33:04,621 INFO L189 CegarLoopUtils]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-01-06 11:33:04,621 INFO L185 CegarLoopUtils]: At program point L192(lines 188 602) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse12 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse15 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse18 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse17 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-01-06 11:33:04,622 INFO L185 CegarLoopUtils]: At program point L159(lines 155 613) the Hoare annotation is: (let ((.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse10 .cse11 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse7 .cse0 .cse1 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-01-06 11:33:04,622 INFO L185 CegarLoopUtils]: At program point L126(lines 125 623) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (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 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= 8497 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 (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) [2021-01-06 11:33:04,622 INFO L189 CegarLoopUtils]: For program point L457(lines 457 461) no Hoare annotation was computed. [2021-01-06 11:33:04,622 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 11:33:04,622 INFO L189 CegarLoopUtils]: For program point L194(lines 194 600) no Hoare annotation was computed. [2021-01-06 11:33:04,623 INFO L189 CegarLoopUtils]: For program point L161(lines 161 611) no Hoare annotation was computed. [2021-01-06 11:33:04,623 INFO L189 CegarLoopUtils]: For program point L128(lines 128 622) no Hoare annotation was computed. [2021-01-06 11:33:04,623 INFO L192 CegarLoopUtils]: At program point L690(lines 681 692) the Hoare annotation is: true [2021-01-06 11:33:04,623 INFO L189 CegarLoopUtils]: For program point L327(lines 327 331) no Hoare annotation was computed. [2021-01-06 11:33:04,623 INFO L185 CegarLoopUtils]: At program point L593(lines 101 661) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (and .cse3 .cse0 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (and .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) .cse4) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) [2021-01-06 11:33:04,623 INFO L189 CegarLoopUtils]: For program point L560(lines 560 564) no Hoare annotation was computed. [2021-01-06 11:33:04,624 INFO L189 CegarLoopUtils]: For program point L428(lines 428 432) no Hoare annotation was computed. [2021-01-06 11:33:04,624 INFO L185 CegarLoopUtils]: At program point L362(lines 344 380) the Hoare annotation is: (let ((.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse7 .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse9 .cse10 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse5 .cse6 .cse0 .cse1 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse9 .cse10 .cse11 .cse2 .cse3 .cse4))) [2021-01-06 11:33:04,624 INFO L189 CegarLoopUtils]: For program point L197(lines 197 599) no Hoare annotation was computed. [2021-01-06 11:33:04,624 INFO L189 CegarLoopUtils]: For program point L164(lines 164 610) no Hoare annotation was computed. [2021-01-06 11:33:04,624 INFO L189 CegarLoopUtils]: For program point L131(lines 131 621) no Hoare annotation was computed. [2021-01-06 11:33:04,624 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 11:33:04,624 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 673) no Hoare annotation was computed. [2021-01-06 11:33:04,625 INFO L189 CegarLoopUtils]: For program point L528(lines 528 532) no Hoare annotation was computed. [2021-01-06 11:33:04,625 INFO L189 CegarLoopUtils]: For program point L462(lines 462 473) no Hoare annotation was computed. [2021-01-06 11:33:04,625 INFO L189 CegarLoopUtils]: For program point L528-2(lines 211 592) no Hoare annotation was computed. [2021-01-06 11:33:04,625 INFO L185 CegarLoopUtils]: At program point L396(lines 387 418) the Hoare annotation is: (let ((.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse10 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse10 .cse11 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse7 .cse0 .cse1 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse10 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-01-06 11:33:04,625 INFO L189 CegarLoopUtils]: For program point L231(lines 231 242) no Hoare annotation was computed. [2021-01-06 11:33:04,627 INFO L185 CegarLoopUtils]: At program point L198(lines 194 600) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse12 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse14 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse16 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse17 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse2 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse3 .cse4 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))))) [2021-01-06 11:33:04,627 INFO L185 CegarLoopUtils]: At program point L165(lines 161 611) the Hoare annotation is: (let ((.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse8 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)))) (or (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse9 .cse10 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse6 .cse7 .cse0 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse9 .cse10 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5))) [2021-01-06 11:33:04,628 INFO L189 CegarLoopUtils]: For program point L231-2(lines 231 242) no Hoare annotation was computed. [2021-01-06 11:33:04,628 INFO L189 CegarLoopUtils]: For program point L364(lines 364 368) no Hoare annotation was computed. [2021-01-06 11:33:04,628 INFO L192 CegarLoopUtils]: At program point L662(lines 100 663) the Hoare annotation is: true [2021-01-06 11:33:04,628 INFO L189 CegarLoopUtils]: For program point L398(lines 398 404) no Hoare annotation was computed. [2021-01-06 11:33:04,628 INFO L189 CegarLoopUtils]: For program point L233(lines 233 238) no Hoare annotation was computed. [2021-01-06 11:33:04,628 INFO L189 CegarLoopUtils]: For program point L200(lines 200 598) no Hoare annotation was computed. [2021-01-06 11:33:04,628 INFO L189 CegarLoopUtils]: For program point L167(lines 167 609) no Hoare annotation was computed. [2021-01-06 11:33:04,628 INFO L189 CegarLoopUtils]: For program point L134(lines 134 620) no Hoare annotation was computed. [2021-01-06 11:33:04,629 INFO L185 CegarLoopUtils]: At program point L101-2(lines 101 661) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (and .cse3 .cse0 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (and .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448) .cse4) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) [2021-01-06 11:33:04,729 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,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:33:04,730 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:33:04,730 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:33:04,731 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:33:04,731 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:36" (3/4) ... [2021-01-06 11:33:04,734 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 11:33:04,764 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-01-06 11:33:04,765 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 11:33:04,766 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:33:04,767 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:33:04,871 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/bitvector/s3_srvr_1a.BV.c.cil.c-witness.graphml [2021-01-06 11:33:04,874 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:33:04,875 INFO L168 Benchmark]: Toolchain (without parser) took 30207.22 ms. Allocated memory was 172.0 MB in the beginning and 867.2 MB in the end (delta: 695.2 MB). Free memory was 146.2 MB in the beginning and 383.7 MB in the end (delta: -237.5 MB). Peak memory consumption was 458.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,875 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 172.0 MB. Free memory is still 142.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:33:04,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.47 ms. Allocated memory is still 172.0 MB. Free memory was 146.0 MB in the beginning and 130.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.53 ms. Allocated memory is still 172.0 MB. Free memory was 130.6 MB in the beginning and 127.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,876 INFO L168 Benchmark]: Boogie Preprocessor took 60.52 ms. Allocated memory is still 172.0 MB. Free memory was 127.7 MB in the beginning and 125.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,876 INFO L168 Benchmark]: RCFGBuilder took 1141.80 ms. Allocated memory is still 172.0 MB. Free memory was 125.6 MB in the beginning and 110.0 MB in the end (delta: 15.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,877 INFO L168 Benchmark]: TraceAbstraction took 28351.44 ms. Allocated memory was 172.0 MB in the beginning and 867.2 MB in the end (delta: 695.2 MB). Free memory was 109.5 MB in the beginning and 396.8 MB in the end (delta: -287.3 MB). Peak memory consumption was 485.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,877 INFO L168 Benchmark]: Witness Printer took 143.85 ms. Allocated memory is still 867.2 MB. Free memory was 396.8 MB in the beginning and 383.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:04,879 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 172.0 MB. Free memory is still 142.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 431.47 ms. Allocated memory is still 172.0 MB. Free memory was 146.0 MB in the beginning and 130.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 66.53 ms. Allocated memory is still 172.0 MB. Free memory was 130.6 MB in the beginning and 127.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 60.52 ms. Allocated memory is still 172.0 MB. Free memory was 127.7 MB in the beginning and 125.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1141.80 ms. Allocated memory is still 172.0 MB. Free memory was 125.6 MB in the beginning and 110.0 MB in the end (delta: 15.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 28351.44 ms. Allocated memory was 172.0 MB in the beginning and 867.2 MB in the end (delta: 695.2 MB). Free memory was 109.5 MB in the beginning and 396.8 MB in the end (delta: -287.3 MB). Peak memory consumption was 485.9 MB. Max. memory is 8.0 GB. * Witness Printer took 143.85 ms. Allocated memory is still 867.2 MB. Free memory was 396.8 MB in the beginning and 383.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 673]: 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: 182]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 2) && s__state <= 8672) && !(s__state == 8480)) && !(8560 == s__state)) && 8448 <= s__state) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) || (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(12292 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8640)) && !(s__state == 8512)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__hit == 0)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8528)) && !(12292 == s__state)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8576 == s__state)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(12292 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8512)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8576 == s__state)) && !(8496 == s__state)) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: (((((((((((((((!(s__state == 8545) && !(s__state == 8512)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 3 == s__s3__tmp__next_state___0) && !(8576 == s__state)) && !(8496 == s__state)) && !(s__state == 8544)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8448) && 8448 <= s__state)) || ((((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(s__state == 8528)) && !(12292 == s__state)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(s__state == 8528)) && !(12292 == s__state)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8672 <= s__state) || (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8528)) && !(12292 == s__state)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(12292 == s__state)) && !(s__state == 8608)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8576 == s__state)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8513 == s__state)) && !(s__state == 8481)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && blastFlag <= 3) && !(8448 == s__state)) && !(12292 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8480)) && !(8497 == s__state)) && s__state <= 8576) && 8448 <= s__state) && !(8576 == s__state)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481)) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8576 == s__state)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) || (((((((((((((((((((((((((!(s__state == 8592) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8528)) && !(12292 == s__state)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 2) && !(s__state == 8480)) && s__state <= 8672) && !(8560 == s__state)) && 8448 <= s__state) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) || (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8528)) && !(12292 == s__state)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(12292 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8512)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8576 == s__state)) && !(8496 == s__state)) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481)) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8576 == s__state)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8481)) || (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8528)) && !(12292 == s__state)) && !(s__state == 8529)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(12292 == s__state)) && !(s__state == 8608)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8576 == s__state)) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(8513 == s__state)) && !(s__state == 8481)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((blastFlag <= 2 && !(s__state == 8480)) && s__state <= 8672) && !(8560 == s__state)) && 8448 <= s__state) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8608)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) || (((((((((((((((((((((((((!(s__state == 8480) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(12292 == s__state)) && !(s__state == 8528)) && !(s__state == 8608)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(12292 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) || ((((((((((((((blastFlag <= 2 && !(s__state == 8512)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8576 == s__state)) && !(8496 == s__state)) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481)) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && blastFlag <= 2) && !(s__state == 8480)) && s__state <= 8672) && !(8560 == s__state)) && 8448 <= s__state) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8545)) && !(s__state == 8512)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8496 == s__state)) && !(8576 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8609)) || ((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && !(8448 == s__state)) && !(12292 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8609)) && !(s__hit == 0)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) || ((blastFlag <= 2 && s__state <= 8448) && !(8448 == s__state)) - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8672 <= s__state) || (((((((((((blastFlag <= 2 && !(s__state == 8545)) && !(8576 == s__state)) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481))) || (((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && s__state <= 8672) && !(s__state == 8641)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8609))) || (blastFlag <= 3 && !(s__hit == 0))) || (((3 == s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && 8448 <= s__state)) || s__state <= 3 - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8480)) && !(8560 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8576 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481)) || (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(12292 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(s__state == 8561)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8672)) && !(8576 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 3) && s__state <= 8672) && 8672 <= s__state) || (((((((((((blastFlag <= 2 && !(s__state == 8545)) && !(8576 == s__state)) && !(s__state == 8480)) && !(8448 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481))) || (((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(8593 == s__state)) && s__state <= 8672) && !(s__state == 8641)) && !(s__state == 8657)) && !(8577 == s__state)) && !(s__state == 8609))) || (blastFlag <= 3 && !(s__hit == 0))) || (((3 == s__s3__tmp__next_state___0 && blastFlag <= 3) && s__state <= 8448) && 8448 <= s__state)) || s__state <= 3 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(s__state == 8592) && !(s__state == 8480)) && !(8560 == s__state)) && blastFlag <= 3) && !(8448 == s__state)) && !(s__state == 8528)) && !(12292 == s__state)) && !(s__state == 8529)) && !(s__state == 8608)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8656)) && !(s__state == 8545)) && !(s__state == 8673)) && !(s__state == 8512)) && !(s__state == 8640)) && !(8497 == s__state)) && !(s__state == 8561)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8496 == s__state)) && !(8593 == s__state)) && !(s__state == 8544)) && !(s__state == 8641)) && !(s__state == 8609)) && !(s__hit == 0)) || ((((((((((((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8545)) && !(s__state == 8512)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8497 == s__state)) && !(s__state == 8561)) && s__state <= 8576) && 8448 <= s__state) && !(8496 == s__state)) && !(s__state == 8544)) && !(8448 == s__state)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8513 == s__state)) && !(s__state == 8481)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.9s, OverallIterations: 36, TraceHistogramMax: 25, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5501 SDtfs, 4814 SDslu, 2046 SDs, 0 SdLazy, 3394 SolverSat, 1374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1347 GetRequests, 1303 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2971occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 36 MinimizatonAttempts, 1622 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 210 NumberOfFragments, 3513 HoareAnnotationTreeSize, 29 FomulaSimplifications, 30233 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 6869 FormulaSimplificationTreeSizeReductionInter, 10.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 9390 NumberOfCodeBlocks, 9390 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 9351 ConstructedInterpolants, 0 QuantifiedInterpolants, 4592375 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2000 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 39 InterpolantComputations, 34 PerfectInterpolantSequences, 40483/40613 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...